./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 91b1670e 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-91b1670 [2018-11-28 23:41:16,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:41:16,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:41:16,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:41:16,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:41:16,282 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:41:16,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:41:16,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:41:16,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:41:16,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:41:16,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:41:16,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:41:16,290 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:41:16,291 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:41:16,292 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:41:16,293 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:41:16,294 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:41:16,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:41:16,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:41:16,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:41:16,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:41:16,309 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:41:16,312 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:41:16,313 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:41:16,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:41:16,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:41:16,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:41:16,320 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:41:16,320 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:41:16,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:41:16,322 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:41:16,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:41:16,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:41:16,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:41:16,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:41:16,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:41:16,331 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:41:16,359 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:41:16,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:41:16,360 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:41:16,361 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:41:16,361 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:41:16,361 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:41:16,361 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:41:16,362 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:41:16,362 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:41:16,363 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:41:16,363 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:41:16,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:41:16,363 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:41:16,363 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:41:16,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:41:16,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:41:16,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:41:16,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:41:16,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:41:16,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:41:16,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:41:16,366 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:41:16,366 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:41:16,366 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:41:16,367 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:41:16,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:41:16,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:41:16,367 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:41:16,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:41:16,368 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:41:16,368 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:41:16,370 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:41:16,370 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 [2018-11-28 23:41:16,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:41:16,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:41:16,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:41:16,429 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:41:16,430 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:41:16,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-28 23:41:16,496 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66c7f5aa1/0d013d06fce344a9a26fa52a1fff0ae5/FLAG96a90ecc4 [2018-11-28 23:41:16,958 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:41:16,959 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-28 23:41:16,966 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66c7f5aa1/0d013d06fce344a9a26fa52a1fff0ae5/FLAG96a90ecc4 [2018-11-28 23:41:17,321 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66c7f5aa1/0d013d06fce344a9a26fa52a1fff0ae5 [2018-11-28 23:41:17,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:41:17,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:41:17,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:17,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:41:17,335 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:41:17,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb8d73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17, skipping insertion in model container [2018-11-28 23:41:17,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:41:17,377 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:41:17,655 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:17,665 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:41:17,704 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:17,750 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:41:17,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17 WrapperNode [2018-11-28 23:41:17,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:17,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:17,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:41:17,752 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:41:17,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:17,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:41:17,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:41:17,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:41:17,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 23:41:17,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:41:17,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:41:17,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:41:17,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:41:17,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (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 [2018-11-28 23:41:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:41:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:41:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:41:18,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:41:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:41:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:41:18,462 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:41:18,462 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 23:41:18,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:18 BoogieIcfgContainer [2018-11-28 23:41:18,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:41:18,463 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:41:18,464 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:41:18,468 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:41:18,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:18,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:41:17" (1/3) ... [2018-11-28 23:41:18,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@340056df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:18, skipping insertion in model container [2018-11-28 23:41:18,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:18,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (2/3) ... [2018-11-28 23:41:18,471 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@340056df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:18, skipping insertion in model container [2018-11-28 23:41:18,471 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:18,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:18" (3/3) ... [2018-11-28 23:41:18,473 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-28 23:41:18,539 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:41:18,540 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:41:18,540 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:41:18,540 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:41:18,541 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:41:18,541 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:41:18,541 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:41:18,542 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:41:18,542 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:41:18,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:41:18,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:41:18,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:18,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:18,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:18,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:18,590 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:41:18,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:41:18,594 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:41:18,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:18,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:18,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:18,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:18,606 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.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(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 [2018-11-28 23:41:18,607 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 [2018-11-28 23:41:18,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:41:18,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:18,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:18,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:18,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-28 23:41:18,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:18,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:18,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:18,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:18,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:18,802 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-28 23:41:18,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:18,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:18,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:18,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:18,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:19,185 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:41:19,753 WARN L180 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-11-28 23:41:19,780 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:19,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:19,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:19,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:19,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:19,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:19,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:19,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:19,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 23:41:19,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:19,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:19,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,017 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:41:20,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,604 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-28 23:41:20,867 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:20,872 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:20,874 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 [2018-11-28 23:41:20,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,884 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 [2018-11-28 23:41:20,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,889 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 [2018-11-28 23:41:20,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:20,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:20,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,901 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 [2018-11-28 23:41:20,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,907 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 [2018-11-28 23:41:20,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,912 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 [2018-11-28 23:41:20,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,918 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 [2018-11-28 23:41:20,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:20,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:20,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,938 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 [2018-11-28 23:41:20,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,944 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 [2018-11-28 23:41:20,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:20,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:21,000 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:21,067 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:41:21,067 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:41:21,070 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:21,075 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:21,075 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:21,076 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 [] [2018-11-28 23:41:21,117 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:41:21,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:21,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:21,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:21,258 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 [2018-11-28 23:41:21,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2018-11-28 23:41:21,325 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. [2018-11-28 23:41:21,326 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 [2018-11-28 23:41:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:41:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 23:41:21,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-28 23:41:21,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:41:21,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:41:21,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-11-28 23:41:21,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:21,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2018-11-28 23:41:21,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:21,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:41:21,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-28 23:41:21,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:21,344 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:41:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-28 23:41:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 23:41:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:41:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 23:41:21,370 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:41:21,370 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:41:21,370 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:41:21,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-28 23:41:21,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:21,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:21,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:21,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:41:21,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:21,373 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.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(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 [2018-11-28 23:41:21,373 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 [2018-11-28 23:41:21,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-28 23:41:21,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:21,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:21,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:41:21,462 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:21,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-11-28 23:41:21,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:41:21,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:41:21,578 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:41:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:21,651 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 23:41:21,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:41:21,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 23:41:21,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:21,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2018-11-28 23:41:21,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:21,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:21,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-28 23:41:21,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:21,657 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:41:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-28 23:41:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 23:41:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:41:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 23:41:21,661 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:41:21,661 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:41:21,661 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:41:21,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-28 23:41:21,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:21,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:21,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:21,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:41:21,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:21,665 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.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(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 [2018-11-28 23:41:21,665 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 [2018-11-28 23:41:21,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-28 23:41:21,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-11-28 23:41:21,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,720 INFO L82 PathProgramCache]: Analyzing trace with hash 265181135, now seen corresponding path program 1 times [2018-11-28 23:41:21,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:21,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:22,170 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-11-28 23:41:22,349 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-11-28 23:41:22,359 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:22,359 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:22,359 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:22,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:22,360 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:22,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:22,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:22,360 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:22,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-28 23:41:22,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:22,361 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:22,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:23,058 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:23,059 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:23,059 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 [2018-11-28 23:41:23,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:23,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:23,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:23,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:23,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:23,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:23,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:23,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:23,064 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 [2018-11-28 23:41:23,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:23,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:23,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:23,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:23,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:23,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:23,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:23,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:23,070 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 [2018-11-28 23:41:23,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:23,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:23,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:23,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:23,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:23,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:23,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:23,081 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 [2018-11-28 23:41:23,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:23,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:23,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:23,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:23,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:23,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:23,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:23,207 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 23:41:23,207 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 23:41:23,208 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:23,211 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:23,211 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:23,212 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#str2~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2) = -1*ULTIMATE.start_main_~#str2~0.offset - 1*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2 Supporting invariants [] [2018-11-28 23:41:23,294 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:41:23,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:41:23,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:23,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:23,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:23,591 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 [2018-11-28 23:41:23,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:41:23,603 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. [2018-11-28 23:41:23,607 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 [2018-11-28 23:41:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:41:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-28 23:41:23,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:41:23,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:41:23,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:41:23,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-28 23:41:23,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:23,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2018-11-28 23:41:23,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:41:23,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:41:23,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 23:41:23,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:23,616 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:41:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 23:41:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 23:41:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:41:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 23:41:23,620 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:41:23,620 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:41:23,620 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:41:23,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 23:41:23,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:23,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:23,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:23,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:23,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:23,623 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.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(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 [2018-11-28 23:41:23,624 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~mem9;havoc main_#t~mem8;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 [2018-11-28 23:41:23,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash 265181077, now seen corresponding path program 1 times [2018-11-28 23:41:23,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:41:23,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:23,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:41:23,728 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:23,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2018-11-28 23:41:23,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,917 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 23:41:24,090 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 23:41:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:41:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:41:24,091 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 23:41:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:24,143 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 23:41:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:41:24,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 23:41:24,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:24,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 23:41:24,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:24,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:24,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-28 23:41:24,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:24,148 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:41:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-28 23:41:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:41:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:41:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 23:41:24,151 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:41:24,151 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:41:24,151 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:41:24,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-28 23:41:24,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:24,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:24,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:24,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:24,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:24,153 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.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(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 [2018-11-28 23:41:24,153 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~mem9;havoc main_#t~mem8;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 [2018-11-28 23:41:24,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1436000983, now seen corresponding path program 1 times [2018-11-28 23:41:24,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:24,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:24,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:24,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2018-11-28 23:41:24,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:24,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:24,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:24,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:24,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:24,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1461824416, now seen corresponding path program 1 times [2018-11-28 23:41:24,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:24,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:24,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:24,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:24,345 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 23:41:24,536 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 23:41:24,870 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2018-11-28 23:41:25,120 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-28 23:41:25,131 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:25,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:25,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:25,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:25,132 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:25,132 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:25,132 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:25,132 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:25,132 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-28 23:41:25,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:25,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:25,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:25,912 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:25,912 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 [2018-11-28 23:41:25,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:25,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:25,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:25,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,918 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 [2018-11-28 23:41:25,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:25,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:25,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:25,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,921 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 [2018-11-28 23:41:25,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:25,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:25,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:25,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,923 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 [2018-11-28 23:41:25,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:25,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:25,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,927 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 [2018-11-28 23:41:25,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:25,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:25,965 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:26,006 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:41:26,009 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:41:26,009 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:26,010 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:26,014 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:26,014 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-28 23:41:26,129 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:41:26,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:26,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:26,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:26,723 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 [2018-11-28 23:41:26,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 23:41:26,874 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. [2018-11-28 23:41:26,875 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 [2018-11-28 23:41:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:41:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-28 23:41:26,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:41:26,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:26,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:41:26,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:26,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 23:41:26,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:26,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-11-28 23:41:26,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:26,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 20 states and 22 transitions. [2018-11-28 23:41:26,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:41:26,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:41:26,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-28 23:41:26,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:26,882 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-28 23:41:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-28 23:41:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-28 23:41:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:41:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 23:41:26,886 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 23:41:26,886 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 23:41:26,887 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:41:26,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-28 23:41:26,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:26,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:26,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:26,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:26,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:26,888 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.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(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 [2018-11-28 23:41:26,888 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~mem9;havoc main_#t~mem8;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 [2018-11-28 23:41:26,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash 780803417, now seen corresponding path program 2 times [2018-11-28 23:41:26,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:26,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:26,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:26,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:26,978 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 [2018-11-28 23:41:26,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:41:27,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:41:27,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:27,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:27,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:27,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-28 23:41:27,059 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:27,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2018-11-28 23:41:27,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:27,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,269 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 23:41:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:41:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:41:27,270 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 23:41:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:27,441 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-28 23:41:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:41:27,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2018-11-28 23:41:27,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:27,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 25 transitions. [2018-11-28 23:41:27,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:41:27,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:41:27,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-28 23:41:27,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:27,446 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-28 23:41:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-28 23:41:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-11-28 23:41:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:41:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 23:41:27,450 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 23:41:27,450 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 23:41:27,450 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:41:27,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-28 23:41:27,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:27,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:27,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:27,455 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:27,455 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:27,455 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.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(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 [2018-11-28 23:41:27,455 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~mem9;havoc main_#t~mem8;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 [2018-11-28 23:41:27,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1267136613, now seen corresponding path program 3 times [2018-11-28 23:41:27,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:27,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2018-11-28 23:41:27,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,496 INFO L82 PathProgramCache]: Analyzing trace with hash 993507108, now seen corresponding path program 2 times [2018-11-28 23:41:27,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,886 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 23:41:28,221 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 23:41:29,011 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 122 [2018-11-28 23:41:29,340 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-11-28 23:41:29,345 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:29,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:29,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:29,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:29,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:29,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:29,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:29,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:29,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-28 23:41:29,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:29,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:29,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:29,649 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) [2018-11-28 23:41:29,657 INFO L168 Benchmark]: Toolchain (without parser) took 12330.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -333.1 MB). Peak memory consumption was 388.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:29,658 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-11-28 23:41:29,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.22 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. [2018-11-28 23:41:29,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.85 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. [2018-11-28 23:41:29,663 INFO L168 Benchmark]: Boogie Preprocessor took 57.04 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. [2018-11-28 23:41:29,667 INFO L168 Benchmark]: RCFGBuilder took 602.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:29,668 INFO L168 Benchmark]: BuchiAutomizer took 11189.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -187.7 MB). Peak memory consumption was 409.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:29,681 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.16 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 422.22 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 50.85 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 57.04 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 602.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11189.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -187.7 MB). Peak memory consumption was 409.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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...