/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:54:07,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:54:07,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:54:07,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:54:07,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:54:07,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:54:07,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:54:07,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:54:07,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:54:07,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:54:07,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:54:07,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:54:07,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:54:07,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:54:07,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:54:07,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:54:07,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:54:07,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:54:07,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:54:07,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:54:07,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:54:07,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:54:07,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:54:07,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:54:07,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:54:07,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:54:07,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:54:07,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:54:07,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:54:07,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:54:07,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:54:07,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:54:07,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:54:07,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:54:07,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:54:07,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:54:07,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:54:07,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:54:07,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:54:07,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:54:07,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:54:07,755 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:54:07,769 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:54:07,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:54:07,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:54:07,770 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:54:07,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:54:07,771 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:54:07,771 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:54:07,771 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:54:07,771 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:54:07,771 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:54:07,772 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:54:07,772 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:54:07,772 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:54:07,772 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:54:07,772 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:54:07,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:54:07,773 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:54:07,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:54:07,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:54:07,773 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:54:07,773 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:54:07,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:54:07,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:54:07,774 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:54:07,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:54:07,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:54:07,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:54:07,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:54:07,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:54:07,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:54:07,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:54:07,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:54:07,957 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:54:07,957 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:54:07,958 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:54:08,020 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_pftfd6/tmp/cd44d4272b9f4440b3e0b46ad3c4bb59/FLAG295eaa0f1 [2020-07-01 12:54:08,349 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:54:08,349 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:54:08,350 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:54:08,356 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_pftfd6/tmp/cd44d4272b9f4440b3e0b46ad3c4bb59/FLAG295eaa0f1 [2020-07-01 12:54:08,775 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_pftfd6/tmp/cd44d4272b9f4440b3e0b46ad3c4bb59 [2020-07-01 12:54:08,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:54:08,788 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:54:08,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:54:08,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:54:08,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:54:08,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:54:08" (1/1) ... [2020-07-01 12:54:08,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b82c411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:08, skipping insertion in model container [2020-07-01 12:54:08,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:54:08" (1/1) ... [2020-07-01 12:54:08,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:54:08,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:54:09,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:54:09,069 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:54:09,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:54:09,103 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:54:09,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09 WrapperNode [2020-07-01 12:54:09,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:54:09,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:54:09,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:54:09,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:54:09,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:54:09,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:54:09,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:54:09,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:54:09,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:54:09,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:54:09,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:54:09,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:54:09,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:54:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:54:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:54:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:54:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:54:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:54:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:54:09,541 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:54:09,542 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:54:09,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:54:09 BoogieIcfgContainer [2020-07-01 12:54:09,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:54:09,546 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:54:09,547 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:54:09,549 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:54:09,549 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:54:09" (1/1) ... [2020-07-01 12:54:09,565 INFO L313 BlockEncoder]: Initial Icfg 49 locations, 51 edges [2020-07-01 12:54:09,567 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:54:09,568 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:54:09,568 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:54:09,569 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:54:09,571 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:54:09,571 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:54:09,572 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:54:09,600 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:54:09,638 INFO L200 BlockEncoder]: SBE split 27 edges [2020-07-01 12:54:09,643 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:54:09,645 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:54:09,679 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 12:54:09,682 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:54:09,684 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:54:09,684 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:54:09,684 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:54:09,685 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:54:09,686 INFO L313 BlockEncoder]: Encoded RCFG 42 locations, 76 edges [2020-07-01 12:54:09,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:54:09 BasicIcfg [2020-07-01 12:54:09,686 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:54:09,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:54:09,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:54:09,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:54:09,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:54:08" (1/4) ... [2020-07-01 12:54:09,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760bf0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:54:09, skipping insertion in model container [2020-07-01 12:54:09,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (2/4) ... [2020-07-01 12:54:09,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760bf0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:54:09, skipping insertion in model container [2020-07-01 12:54:09,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:54:09" (3/4) ... [2020-07-01 12:54:09,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760bf0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:54:09, skipping insertion in model container [2020-07-01 12:54:09,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:54:09" (4/4) ... [2020-07-01 12:54:09,695 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:54:09,706 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:54:09,714 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-07-01 12:54:09,727 INFO L251 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-07-01 12:54:09,751 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:54:09,751 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:54:09,751 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:54:09,752 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:54:09,752 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:54:09,752 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:54:09,752 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:54:09,752 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:54:09,768 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-01 12:54:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:54:09,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:09,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:54:09,775 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 117085, now seen corresponding path program 1 times [2020-07-01 12:54:09,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:09,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621137865] [2020-07-01 12:54:09,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:09,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621137865] [2020-07-01 12:54:09,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:09,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:09,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355480421] [2020-07-01 12:54:09,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:09,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:09,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:09,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:09,973 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2020-07-01 12:54:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:10,117 INFO L93 Difference]: Finished difference Result 82 states and 143 transitions. [2020-07-01 12:54:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:10,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:54:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:10,131 INFO L225 Difference]: With dead ends: 82 [2020-07-01 12:54:10,131 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:54:10,135 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:54:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:54:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:54:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 69 transitions. [2020-07-01 12:54:10,174 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 69 transitions. Word has length 3 [2020-07-01 12:54:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:10,175 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 69 transitions. [2020-07-01 12:54:10,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 69 transitions. [2020-07-01 12:54:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:54:10,175 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:10,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:54:10,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:54:10,178 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:10,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:10,178 INFO L82 PathProgramCache]: Analyzing trace with hash 117209, now seen corresponding path program 1 times [2020-07-01 12:54:10,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:10,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466934586] [2020-07-01 12:54:10,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:10,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466934586] [2020-07-01 12:54:10,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:10,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:10,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257268253] [2020-07-01 12:54:10,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:10,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:10,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,250 INFO L87 Difference]: Start difference. First operand 42 states and 69 transitions. Second operand 3 states. [2020-07-01 12:54:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:10,353 INFO L93 Difference]: Finished difference Result 42 states and 69 transitions. [2020-07-01 12:54:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:10,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:54:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:10,375 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:54:10,376 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:54:10,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:54:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:54:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:54:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. [2020-07-01 12:54:10,382 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 57 transitions. Word has length 3 [2020-07-01 12:54:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:10,382 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 57 transitions. [2020-07-01 12:54:10,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 57 transitions. [2020-07-01 12:54:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:54:10,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:10,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:54:10,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:54:10,383 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:10,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:10,384 INFO L82 PathProgramCache]: Analyzing trace with hash 117211, now seen corresponding path program 1 times [2020-07-01 12:54:10,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:10,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640222950] [2020-07-01 12:54:10,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:10,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640222950] [2020-07-01 12:54:10,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:10,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:10,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788298267] [2020-07-01 12:54:10,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:10,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,414 INFO L87 Difference]: Start difference. First operand 36 states and 57 transitions. Second operand 3 states. [2020-07-01 12:54:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:10,488 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2020-07-01 12:54:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:10,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:54:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:10,489 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:54:10,490 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:54:10,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:54:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:54:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:54:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2020-07-01 12:54:10,495 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 3 [2020-07-01 12:54:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:10,495 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2020-07-01 12:54:10,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2020-07-01 12:54:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:54:10,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:10,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:54:10,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:54:10,496 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash 117212, now seen corresponding path program 1 times [2020-07-01 12:54:10,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:10,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269937610] [2020-07-01 12:54:10,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:10,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269937610] [2020-07-01 12:54:10,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:10,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:10,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565810343] [2020-07-01 12:54:10,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:10,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:10,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:10,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,536 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2020-07-01 12:54:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:10,602 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2020-07-01 12:54:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:10,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:54:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:10,603 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:54:10,603 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:54:10,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:54:10,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:54:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:54:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2020-07-01 12:54:10,608 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 45 transitions. Word has length 3 [2020-07-01 12:54:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:10,608 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 45 transitions. [2020-07-01 12:54:10,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 45 transitions. [2020-07-01 12:54:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:54:10,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:10,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:54:10,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:54:10,609 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:10,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash 3631004, now seen corresponding path program 1 times [2020-07-01 12:54:10,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:10,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592988334] [2020-07-01 12:54:10,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:10,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592988334] [2020-07-01 12:54:10,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:10,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:10,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772844441] [2020-07-01 12:54:10,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:10,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:10,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,642 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 3 states. [2020-07-01 12:54:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:10,697 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2020-07-01 12:54:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:10,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:54:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:10,699 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:54:10,699 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:54:10,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:54:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:54:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:54:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2020-07-01 12:54:10,703 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 4 [2020-07-01 12:54:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:10,705 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-07-01 12:54:10,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2020-07-01 12:54:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:54:10,706 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:10,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:54:10,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:54:10,706 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:10,707 INFO L82 PathProgramCache]: Analyzing trace with hash 3631001, now seen corresponding path program 1 times [2020-07-01 12:54:10,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:10,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284215384] [2020-07-01 12:54:10,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:10,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284215384] [2020-07-01 12:54:10,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:10,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:10,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583919147] [2020-07-01 12:54:10,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:10,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,750 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 3 states. [2020-07-01 12:54:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:10,819 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2020-07-01 12:54:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:10,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:54:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:10,820 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:54:10,820 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:54:10,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:54:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:54:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:54:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-07-01 12:54:10,825 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 4 [2020-07-01 12:54:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:10,825 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-01 12:54:10,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-07-01 12:54:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:54:10,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:10,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:54:10,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:54:10,826 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash 3631003, now seen corresponding path program 1 times [2020-07-01 12:54:10,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:10,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003389145] [2020-07-01 12:54:10,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:10,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003389145] [2020-07-01 12:54:10,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:10,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:10,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691893264] [2020-07-01 12:54:10,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:10,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,875 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2020-07-01 12:54:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:10,930 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2020-07-01 12:54:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:10,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:54:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:10,931 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:54:10,931 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:54:10,933 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:54:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:54:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:54:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2020-07-01 12:54:10,936 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 4 [2020-07-01 12:54:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:10,936 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-07-01 12:54:10,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2020-07-01 12:54:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:54:10,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:10,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:54:10,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:54:10,937 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:10,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:10,938 INFO L82 PathProgramCache]: Analyzing trace with hash 112559611, now seen corresponding path program 1 times [2020-07-01 12:54:10,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:10,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651221658] [2020-07-01 12:54:10,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:10,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651221658] [2020-07-01 12:54:10,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:10,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:10,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102156855] [2020-07-01 12:54:10,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:10,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:10,967 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 3 states. [2020-07-01 12:54:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:11,015 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2020-07-01 12:54:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:11,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:54:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:11,016 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:54:11,016 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:54:11,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:54:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:54:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:54:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-07-01 12:54:11,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 5 [2020-07-01 12:54:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:11,020 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-07-01 12:54:11,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2020-07-01 12:54:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:54:11,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:54:11,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:54:11,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:54:11,021 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:54:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 112559613, now seen corresponding path program 1 times [2020-07-01 12:54:11,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:11,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446152900] [2020-07-01 12:54:11,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:11,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446152900] [2020-07-01 12:54:11,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:11,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:11,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608791685] [2020-07-01 12:54:11,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:54:11,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:11,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:11,056 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 3 states. [2020-07-01 12:54:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:11,099 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-07-01 12:54:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:11,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:54:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:54:11,100 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:54:11,101 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:54:11,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:54:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:54:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:54:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:54:11,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:54:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:54:11,102 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:54:11,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:54:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:54:11,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:54:11,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:54:11,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:54:11,139 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:54:11,139 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:54:11,139 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:54:11,139 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:54:11,140 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:54:11,140 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:54:11,140 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:54:11,140 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,140 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:54:11,140 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,140 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,140 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,141 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,142 INFO L268 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,142 INFO L268 CegarLoopResult]: For program point L13-6(lines 13 16) no Hoare annotation was computed. [2020-07-01 12:54:11,142 INFO L264 CegarLoopResult]: At program point L13-8(lines 12 16) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:54:11,142 INFO L268 CegarLoopResult]: For program point L13-9(lines 13 16) no Hoare annotation was computed. [2020-07-01 12:54:11,142 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:54:11,142 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,143 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-01 12:54:11,144 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:54:11,144 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:54:11,144 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:54:11,144 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:54:11,144 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:54:11,145 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:54:11,147 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:54:11,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:54:11,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:54:11,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:54:11 BasicIcfg [2020-07-01 12:54:11,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:54:11,169 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:54:11,169 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:54:11,172 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:54:11,172 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:54:11,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:54:08" (1/5) ... [2020-07-01 12:54:11,173 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b87caa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:54:11, skipping insertion in model container [2020-07-01 12:54:11,173 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:54:11,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:54:09" (2/5) ... [2020-07-01 12:54:11,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b87caa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:54:11, skipping insertion in model container [2020-07-01 12:54:11,174 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:54:11,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:54:09" (3/5) ... [2020-07-01 12:54:11,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b87caa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:54:11, skipping insertion in model container [2020-07-01 12:54:11,174 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:54:11,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:54:09" (4/5) ... [2020-07-01 12:54:11,175 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b87caa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:54:11, skipping insertion in model container [2020-07-01 12:54:11,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:54:11,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:54:11" (5/5) ... [2020-07-01 12:54:11,176 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:54:11,197 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:54:11,197 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:54:11,198 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:54:11,198 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:54:11,198 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:54:11,198 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:54:11,198 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:54:11,198 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:54:11,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2020-07-01 12:54:11,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:54:11,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:54:11,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:54:11,214 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:54:11,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:54:11,214 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:54:11,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2020-07-01 12:54:11,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:54:11,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:54:11,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:54:11,217 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:54:11,218 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:54:11,223 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue [86] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 14#L-1true [152] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 16#L10true [68] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 31#L10-1true [106] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 36#L11true [87] L11-->L13-8: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 4#L13-8true [2020-07-01 12:54:11,224 INFO L796 eck$LassoCheckResult]: Loop: 4#L13-8true [95] L13-8-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 41#L13true [173] L13-->L13-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short6_2| (< 1 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 39#L13-1true [116] L13-1-->L13-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short6_5|) InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} AuxVars[] AssignedVars[] 8#L13-6true [99] L13-6-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 23#L14true [80] L14-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 21#L14-1true [76] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 19#L14-2true [208] L14-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (= (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_21 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (* |v_ULTIMATE.start_test_fun_#t~mem7_6| |v_ULTIMATE.start_test_fun_#t~mem8_6|))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_32|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_32|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem7] 25#L15true [83] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 43#L15-1true [210] L15-1-->L13-8: Formula: (and (= (store |v_#memory_int_25| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_25| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_24|) (= 1 (select |v_#valid_44| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 4#L13-8true [2020-07-01 12:54:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash 112648910, now seen corresponding path program 1 times [2020-07-01 12:54:11,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:11,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525516973] [2020-07-01 12:54:11,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:11,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525516973] [2020-07-01 12:54:11,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:11,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:54:11,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680914852] [2020-07-01 12:54:11,245 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:54:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:54:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash -760639403, now seen corresponding path program 1 times [2020-07-01 12:54:11,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:54:11,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957728248] [2020-07-01 12:54:11,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:54:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:54:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:54:11,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957728248] [2020-07-01 12:54:11,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:54:11,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:54:11,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864726397] [2020-07-01 12:54:11,260 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:54:11,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:54:11,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:54:11,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:54:11,262 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2020-07-01 12:54:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:54:11,356 INFO L93 Difference]: Finished difference Result 42 states and 69 transitions. [2020-07-01 12:54:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:54:11,359 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:54:11,363 INFO L168 Benchmark]: Toolchain (without parser) took 2575.12 ms. Allocated memory was 649.6 MB in the beginning and 704.1 MB in the end (delta: 54.5 MB). Free memory was 562.8 MB in the beginning and 429.0 MB in the end (delta: 133.8 MB). Peak memory consumption was 188.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:54:11,364 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:54:11,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.92 ms. Allocated memory was 649.6 MB in the beginning and 704.1 MB in the end (delta: 54.5 MB). Free memory was 562.8 MB in the beginning and 666.2 MB in the end (delta: -103.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:54:11,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.50 ms. Allocated memory is still 704.1 MB. Free memory was 666.2 MB in the beginning and 663.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:54:11,365 INFO L168 Benchmark]: Boogie Preprocessor took 24.04 ms. Allocated memory is still 704.1 MB. Free memory was 663.5 MB in the beginning and 662.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:54:11,366 INFO L168 Benchmark]: RCFGBuilder took 376.74 ms. Allocated memory is still 704.1 MB. Free memory was 662.1 MB in the beginning and 635.7 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:54:11,367 INFO L168 Benchmark]: BlockEncodingV2 took 139.93 ms. Allocated memory is still 704.1 MB. Free memory was 635.7 MB in the beginning and 624.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:54:11,367 INFO L168 Benchmark]: TraceAbstraction took 1480.45 ms. Allocated memory is still 704.1 MB. Free memory was 624.9 MB in the beginning and 454.7 MB in the end (delta: 170.2 MB). Peak memory consumption was 170.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:54:11,368 INFO L168 Benchmark]: BuchiAutomizer took 192.45 ms. Allocated memory is still 704.1 MB. Free memory was 454.7 MB in the beginning and 429.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:54:11,371 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 49 locations, 51 edges - StatisticsResult: Encoded RCFG 42 locations, 76 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 314.92 ms. Allocated memory was 649.6 MB in the beginning and 704.1 MB in the end (delta: 54.5 MB). Free memory was 562.8 MB in the beginning and 666.2 MB in the end (delta: -103.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.50 ms. Allocated memory is still 704.1 MB. Free memory was 666.2 MB in the beginning and 663.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.04 ms. Allocated memory is still 704.1 MB. Free memory was 663.5 MB in the beginning and 662.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 376.74 ms. Allocated memory is still 704.1 MB. Free memory was 662.1 MB in the beginning and 635.7 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 139.93 ms. Allocated memory is still 704.1 MB. Free memory was 635.7 MB in the beginning and 624.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1480.45 ms. Allocated memory is still 704.1 MB. Free memory was 624.9 MB in the beginning and 454.7 MB in the end (delta: 170.2 MB). Peak memory consumption was 170.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 192.45 ms. Allocated memory is still 704.1 MB. Free memory was 454.7 MB in the beginning and 429.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 12:54:11,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:54:11,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:54:11,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:54:11,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 24 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 SDtfs, 367 SDslu, 5 SDs, 0 SdLazy, 324 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:54:05.535 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_pftfd6/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:54:11.611 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check