./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 561472dda653ab23fa8eff641224e01683fc61ba .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:58:13,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:58:13,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:58:13,621 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:58:13,621 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:58:13,622 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:58:13,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:58:13,625 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:58:13,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:58:13,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:58:13,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:58:13,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:58:13,631 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:58:13,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:58:13,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:58:13,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:58:13,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:58:13,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:58:13,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:58:13,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:58:13,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:58:13,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:58:13,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:58:13,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:58:13,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:58:13,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:58:13,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:58:13,649 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:58:13,650 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:58:13,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:58:13,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:58:13,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:58:13,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:58:13,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:58:13,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:58:13,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:58:13,655 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:58:13,675 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:58:13,675 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:58:13,677 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:58:13,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:58:13,677 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:58:13,677 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:58:13,677 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:58:13,678 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:58:13,678 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:58:13,678 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:58:13,678 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:58:13,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:58:13,679 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:58:13,680 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:58:13,682 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:58:13,683 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:58:13,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:58:13,683 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:58:13,683 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:58:13,683 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:58:13,683 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:58:13,685 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:58:13,685 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:58:13,685 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:58:13,685 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:58:13,685 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:58:13,686 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:58:13,686 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:58:13,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:58:13,686 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:58:13,686 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:58:13,690 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:58:13,690 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 561472dda653ab23fa8eff641224e01683fc61ba [2019-01-01 22:58:13,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:58:13,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:58:13,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:58:13,780 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:58:13,780 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:58:13,781 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i [2019-01-01 22:58:13,855 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76f19134/ff9970f464854c479cfcccd504e6bd2e/FLAGab41311b2 [2019-01-01 22:58:14,315 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:58:14,316 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i [2019-01-01 22:58:14,322 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76f19134/ff9970f464854c479cfcccd504e6bd2e/FLAGab41311b2 [2019-01-01 22:58:14,691 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76f19134/ff9970f464854c479cfcccd504e6bd2e [2019-01-01 22:58:14,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:58:14,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:58:14,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:58:14,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:58:14,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:58:14,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:58:14" (1/1) ... [2019-01-01 22:58:14,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219e31c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:14, skipping insertion in model container [2019-01-01 22:58:14,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:58:14" (1/1) ... [2019-01-01 22:58:14,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:58:14,732 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:58:14,972 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:58:14,977 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:58:15,004 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:58:15,039 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:58:15,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15 WrapperNode [2019-01-01 22:58:15,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:58:15,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:58:15,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:58:15,043 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:58:15,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:58:15,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:58:15,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:58:15,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:58:15,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... [2019-01-01 22:58:15,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:58:15,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:58:15,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:58:15,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:58:15,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:58:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:58:15,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:58:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:58:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:58:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:58:15,728 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:58:15,728 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-01 22:58:15,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:58:15 BoogieIcfgContainer [2019-01-01 22:58:15,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:58:15,730 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:58:15,730 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:58:15,734 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:58:15,735 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:15,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:58:14" (1/3) ... [2019-01-01 22:58:15,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67dadfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:58:15, skipping insertion in model container [2019-01-01 22:58:15,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:15,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:15" (2/3) ... [2019-01-01 22:58:15,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67dadfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:58:15, skipping insertion in model container [2019-01-01 22:58:15,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:15,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:58:15" (3/3) ... [2019-01-01 22:58:15,739 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2019-01-01 22:58:15,802 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:58:15,803 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:58:15,803 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:58:15,803 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:58:15,804 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:58:15,804 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:58:15,804 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:58:15,804 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:58:15,804 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:58:15,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 22:58:15,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:58:15,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:15,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:15,852 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:58:15,852 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:15,853 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:58:15,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 22:58:15,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:58:15,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:15,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:15,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:58:15,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:15,864 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 6#L20-3true [2019-01-01 22:58:15,864 INFO L796 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 7#L20-2true main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6#L20-3true [2019-01-01 22:58:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:15,871 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 22:58:15,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:15,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:15,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:15,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:15,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-01 22:58:16,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:16,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 22:58:16,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:16,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,245 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-01 22:58:16,517 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 22:58:17,069 WARN L181 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-01-01 22:58:17,100 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:17,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:17,102 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:17,102 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:17,102 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:17,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:17,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:17,102 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:17,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 22:58:17,103 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:17,103 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:17,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:17,937 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-01-01 22:58:18,233 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-01 22:58:18,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:18,303 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:18,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:18,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:18,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:18,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:18,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:18,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:18,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:18,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:18,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:18,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:18,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:18,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:18,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:18,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:18,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:18,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:18,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:18,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:18,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:18,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:18,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:18,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:18,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:18,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:18,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:18,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:18,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:18,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:18,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:18,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:18,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:18,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:18,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:18,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:18,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:18,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:18,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:18,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:18,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:18,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:18,476 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:18,537 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 22:58:18,537 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:58:18,543 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:18,547 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:18,550 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:18,551 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~MAX~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~MAX~0 Supporting invariants [] [2019-01-01 22:58:18,601 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:58:18,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:18,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:18,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:18,773 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:58:18,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-01-01 22:58:18,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 8 states. [2019-01-01 22:58:18,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:58:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-01 22:58:18,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 22:58:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:18,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 22:58:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:18,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 22:58:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:18,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-01-01 22:58:18,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:58:18,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2019-01-01 22:58:18,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:58:18,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 22:58:18,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-01-01 22:58:18,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:18,858 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-01 22:58:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-01-01 22:58:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 22:58:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 22:58:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-01-01 22:58:18,885 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-01 22:58:18,885 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-01 22:58:18,885 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:58:18,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-01-01 22:58:18,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:58:18,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:18,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:18,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 22:58:18,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:18,887 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 112#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 107#L20-3 assume !(main_~i~0 < main_~MAX~0); 105#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 106#L27-3 [2019-01-01 22:58:18,888 INFO L796 eck$LassoCheckResult]: Loop: 106#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 115#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 106#L27-3 [2019-01-01 22:58:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-01 22:58:18,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:18,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:18,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:18,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:58:18,958 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-01-01 22:58:18,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:18,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:18,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:18,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:19,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:58:19,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:58:19,107 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 22:58:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:19,135 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-01 22:58:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:58:19,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-01 22:58:19,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:58:19,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2019-01-01 22:58:19,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:58:19,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:58:19,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-01-01 22:58:19,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:19,139 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 22:58:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-01-01 22:58:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-01 22:58:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 22:58:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-01 22:58:19,141 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-01 22:58:19,141 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-01 22:58:19,141 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:58:19,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-01-01 22:58:19,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:58:19,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:19,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:19,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:58:19,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:19,143 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 139#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 140#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 146#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 147#L20-3 assume !(main_~i~0 < main_~MAX~0); 144#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 145#L27-3 [2019-01-01 22:58:19,143 INFO L796 eck$LassoCheckResult]: Loop: 145#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 149#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 145#L27-3 [2019-01-01 22:58:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-01-01 22:58:19,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:19,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:19,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-01-01 22:58:19,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:19,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:19,188 INFO L82 PathProgramCache]: Analyzing trace with hash 265181135, now seen corresponding path program 1 times [2019-01-01 22:58:19,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:19,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:19,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:19,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:19,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:19,597 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-01-01 22:58:19,800 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-01-01 22:58:19,804 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:19,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:19,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:19,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:19,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:19,805 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:19,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:19,805 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:19,805 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration3_Lasso [2019-01-01 22:58:19,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:19,805 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:19,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,356 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-01-01 22:58:20,629 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 22:58:20,739 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:20,740 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:20,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:20,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:20,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:20,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:20,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:20,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:20,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:20,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:20,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:20,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,773 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:58:20,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,778 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:58:20,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:20,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:20,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:20,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:20,840 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:20,875 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:58:20,875 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 22:58:20,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:20,877 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:20,878 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:20,878 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2, ULTIMATE.start_main_~#str2~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2 - 1*ULTIMATE.start_main_~#str2~0.offset - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 22:58:20,951 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:58:20,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:58:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:20,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:21,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:21,160 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:58:21,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 22:58:21,170 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 21 transitions. Complement of second has 5 states. [2019-01-01 22:58:21,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:58:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-01 22:58:21,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 22:58:21,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:21,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 22:58:21,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:21,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 22:58:21,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:21,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-01-01 22:58:21,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:21,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2019-01-01 22:58:21,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:58:21,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 22:58:21,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-01-01 22:58:21,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:21,179 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 22:58:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-01-01 22:58:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 22:58:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 22:58:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-01 22:58:21,182 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 22:58:21,183 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 22:58:21,183 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:58:21,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-01 22:58:21,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:21,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:21,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:21,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:21,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:21,186 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 224#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 225#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 233#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 234#L20-3 assume !(main_~i~0 < main_~MAX~0); 231#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 232#L27-3 assume !(main_~i~0 >= 0); 235#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 227#L33-3 [2019-01-01 22:58:21,186 INFO L796 eck$LassoCheckResult]: Loop: 227#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 228#L5 assume !(0 == __VERIFIER_assert_~cond); 229#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 226#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 227#L33-3 [2019-01-01 22:58:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash 265181077, now seen corresponding path program 1 times [2019-01-01 22:58:21,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:21,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:21,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:21,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:58:21,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:21,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:58:21,300 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2019-01-01 22:58:21,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:21,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,452 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 22:58:21,687 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 22:58:21,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:58:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:58:21,688 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 22:58:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:21,737 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-01 22:58:21,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:58:21,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-01 22:58:21,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:21,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 22:58:21,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:58:21,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:58:21,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-01-01 22:58:21,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:21,740 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 22:58:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-01-01 22:58:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 22:58:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 22:58:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 22:58:21,744 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 22:58:21,745 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 22:58:21,745 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:58:21,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-01 22:58:21,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:21,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:21,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:21,746 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:21,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:21,746 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 266#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 272#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 273#L20-3 assume !(main_~i~0 < main_~MAX~0); 270#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 271#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 277#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 275#L27-3 assume !(main_~i~0 >= 0); 274#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 264#L33-3 [2019-01-01 22:58:21,747 INFO L796 eck$LassoCheckResult]: Loop: 264#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 267#L5 assume !(0 == __VERIFIER_assert_~cond); 268#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 263#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 264#L33-3 [2019-01-01 22:58:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1436000983, now seen corresponding path program 1 times [2019-01-01 22:58:21,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:21,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2019-01-01 22:58:21,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:21,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:21,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1461824416, now seen corresponding path program 1 times [2019-01-01 22:58:21,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:21,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:21,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:21,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:22,141 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 22:58:22,570 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-01-01 22:58:23,042 WARN L181 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-01-01 22:58:23,046 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:23,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:23,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:23,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:23,046 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:23,046 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:23,046 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:23,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:23,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-01 22:58:23,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:23,047 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:23,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,268 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-01 22:58:23,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:24,083 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:24,084 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:24,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:24,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:24,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:24,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:24,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:24,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:24,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:24,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:24,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:24,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:24,153 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:24,187 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-01 22:58:24,187 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-01 22:58:24,187 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:24,189 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:24,189 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:24,189 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_3, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_3 - 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 22:58:24,295 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 22:58:24,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:58:24,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:24,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:24,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:24,426 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-01-01 22:58:24,426 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-01 22:58:24,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 34 states and 39 transitions. Complement of second has 10 states. [2019-01-01 22:58:24,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-01 22:58:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 22:58:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-01-01 22:58:24,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 22:58:24,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:24,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 22:58:24,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:24,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 22:58:24,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:24,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2019-01-01 22:58:24,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:24,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 20 states and 22 transitions. [2019-01-01 22:58:24,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 22:58:24,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:58:24,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-01-01 22:58:24,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:24,621 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 22:58:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-01-01 22:58:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-01 22:58:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 22:58:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-01 22:58:24,625 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-01 22:58:24,625 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-01 22:58:24,625 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:58:24,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-01-01 22:58:24,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:24,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:24,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:24,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:24,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:24,630 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 413#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 414#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 422#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 423#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 424#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 429#L20-3 assume !(main_~i~0 < main_~MAX~0); 420#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 421#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 426#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 428#L27-3 assume !(main_~i~0 >= 0); 425#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 416#L33-3 [2019-01-01 22:58:24,630 INFO L796 eck$LassoCheckResult]: Loop: 416#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 417#L5 assume !(0 == __VERIFIER_assert_~cond); 418#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 415#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 416#L33-3 [2019-01-01 22:58:24,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash 780803417, now seen corresponding path program 2 times [2019-01-01 22:58:24,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:24,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:24,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:24,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:58:24,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:58:24,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:24,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:58:24,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:58:24,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:24,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:58:24,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-01-01 22:58:24,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2019-01-01 22:58:24,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:24,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:25,015 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 22:58:25,125 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 22:58:25,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:58:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:58:25,126 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-01 22:58:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:25,315 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-01 22:58:25,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:58:25,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-01-01 22:58:25,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:25,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 25 transitions. [2019-01-01 22:58:25,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 22:58:25,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 22:58:25,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-01-01 22:58:25,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:25,320 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-01-01 22:58:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-01-01 22:58:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-01-01 22:58:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:58:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-01 22:58:25,322 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-01 22:58:25,322 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-01 22:58:25,322 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:58:25,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-01-01 22:58:25,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:25,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:25,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:25,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:25,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:25,326 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 504#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 505#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 511#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 512#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 513#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 518#L20-3 assume !(main_~i~0 < main_~MAX~0); 508#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 509#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 515#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 516#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 517#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 519#L27-3 assume !(main_~i~0 >= 0); 514#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 503#L33-3 [2019-01-01 22:58:25,326 INFO L796 eck$LassoCheckResult]: Loop: 503#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 506#L5 assume !(0 == __VERIFIER_assert_~cond); 507#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 502#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 503#L33-3 [2019-01-01 22:58:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:25,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1267136613, now seen corresponding path program 3 times [2019-01-01 22:58:25,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:25,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:25,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2019-01-01 22:58:25,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:25,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:25,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:25,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:25,368 INFO L82 PathProgramCache]: Analyzing trace with hash 993507108, now seen corresponding path program 2 times [2019-01-01 22:58:25,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:25,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:25,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:25,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:25,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:25,759 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 22:58:25,955 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 22:58:26,736 WARN L181 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 125 [2019-01-01 22:58:27,097 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-01-01 22:58:27,099 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:27,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:27,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:27,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:27,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:27,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:27,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:27,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:27,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-01 22:58:27,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:27,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:27,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:27,187 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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:316) 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) [2019-01-01 22:58:27,195 INFO L168 Benchmark]: Toolchain (without parser) took 12494.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -235.0 MB). Peak memory consumption was 364.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:27,196 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:58:27,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:27,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.39 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:58:27,201 INFO L168 Benchmark]: Boogie Preprocessor took 60.71 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:27,202 INFO L168 Benchmark]: RCFGBuilder took 572.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:27,207 INFO L168 Benchmark]: BuchiAutomizer took 11459.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -51.9 MB). Peak memory consumption was 385.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:27,214 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.39 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.71 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 572.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11459.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -51.9 MB). Peak memory consumption was 385.3 MB. Max. memory is 11.5 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...