./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer --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 9eff01e8b41fd58fd007a4a54a96fca4ce69974c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/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.23-1dbac8b [2018-10-27 06:08:21,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:21,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:21,525 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:21,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:21,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:21,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:21,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:21,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:21,530 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:21,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:21,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:21,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:21,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:21,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:21,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:21,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:21,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:21,537 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:21,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:21,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:21,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:21,542 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:21,542 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:21,542 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:21,543 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:21,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:21,544 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:21,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:21,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:21,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:21,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:21,547 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:21,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:21,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:21,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:21,548 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:08:21,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:21,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:21,561 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:21,561 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:21,561 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:21,561 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:21,561 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:21,562 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:21,562 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:21,562 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:21,562 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:21,562 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:21,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:08:21,562 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:21,563 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:21,563 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:08:21,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:21,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:21,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:21,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:21,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:08:21,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:21,564 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:21,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:21,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:21,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:21,564 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:21,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:21,565 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:21,565 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:21,565 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:21,566 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer 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 -> 9eff01e8b41fd58fd007a4a54a96fca4ce69974c [2018-10-27 06:08:21,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:21,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:21,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:21,606 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:21,606 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:21,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-10-27 06:08:21,661 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/data/684bf4e76/33a3716679574893bf3f196442aefc0c/FLAG14918c96c [2018-10-27 06:08:22,040 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:22,041 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-10-27 06:08:22,047 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/data/684bf4e76/33a3716679574893bf3f196442aefc0c/FLAG14918c96c [2018-10-27 06:08:22,059 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/data/684bf4e76/33a3716679574893bf3f196442aefc0c [2018-10-27 06:08:22,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:22,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:22,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:22,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:22,068 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:22,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5effdc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22, skipping insertion in model container [2018-10-27 06:08:22,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:22,111 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:22,248 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:22,251 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:22,267 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:22,283 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:22,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22 WrapperNode [2018-10-27 06:08:22,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:22,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:22,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:22,285 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:22,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:22,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:22,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:22,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:22,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... [2018-10-27 06:08:22,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:22,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:22,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:22,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:22,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/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-10-27 06:08:22,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:22,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:23,055 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:23,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:23 BoogieIcfgContainer [2018-10-27 06:08:23,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:23,056 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:23,057 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:23,060 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:23,061 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:23,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:22" (1/3) ... [2018-10-27 06:08:23,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25ffe929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:23, skipping insertion in model container [2018-10-27 06:08:23,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:23,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:22" (2/3) ... [2018-10-27 06:08:23,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25ffe929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:23, skipping insertion in model container [2018-10-27 06:08:23,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:23,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:23" (3/3) ... [2018-10-27 06:08:23,065 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-10-27 06:08:23,114 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:23,115 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:23,115 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:23,115 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:23,115 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:23,116 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:23,116 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:23,116 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:23,116 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:23,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-10-27 06:08:23,153 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-10-27 06:08:23,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:23,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:23,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:23,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:23,160 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:23,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-10-27 06:08:23,162 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-10-27 06:08:23,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:23,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:23,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:23,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:23,171 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 21#L18-4true [2018-10-27 06:08:23,172 INFO L795 eck$LassoCheckResult]: Loop: 21#L18-4true assume true; 7#L18-1true assume !!(main_~i~0 < main_~MAX~0); 24#L19true SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 23#L19-1true havoc main_#t~nondet2; 3#L18-3true main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 21#L18-4true [2018-10-27 06:08:23,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:08:23,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,291 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-10-27 06:08:23,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:23,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-10-27 06:08:23,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,636 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-27 06:08:24,142 WARN L179 SmtUtils]: Spent 488.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 06:08:24,160 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:24,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:24,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:24,161 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:24,161 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:24,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:24,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:24,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:24,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-10-27 06:08:24,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:24,163 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:24,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,670 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:08:24,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,887 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-27 06:08:25,395 WARN L179 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-27 06:08:25,421 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:25,426 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:25,428 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-10-27 06:08:25,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,434 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-10-27 06:08:25,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,437 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-10-27 06:08:25,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,442 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-10-27 06:08:25,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,445 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-10-27 06:08:25,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:25,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,458 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-10-27 06:08:25,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:25,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,466 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-10-27 06:08:25,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,469 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-10-27 06:08:25,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,475 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-10-27 06:08:25,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:25,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,484 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-10-27 06:08:25,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,489 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-10-27 06:08:25,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:25,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,500 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-10-27 06:08:25,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:25,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,508 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-10-27 06:08:25,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:25,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,518 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-10-27 06:08:25,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:25,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,527 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-10-27 06:08:25,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:25,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,543 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-10-27 06:08:25,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,548 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-10-27 06:08:25,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,549 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:25,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,551 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:25,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,563 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-10-27 06:08:25,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,566 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,566 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-10-27 06:08:25,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:25,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:25,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:25,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:25,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:25,569 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-10-27 06:08:25,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:25,578 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:25,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:25,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:25,583 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:25,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:25,628 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:25,658 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:25,659 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:25,661 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:25,663 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:25,663 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:25,664 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~#str1~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~#str1~0.offset - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:08:25,747 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:08:25,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:25,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:25,894 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-10-27 06:08:25,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 4 states. [2018-10-27 06:08:25,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 4 states. Result 58 states and 70 transitions. Complement of second has 8 states. [2018-10-27 06:08:25,948 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-10-27 06:08:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-10-27 06:08:25,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 5 letters. [2018-10-27 06:08:25,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:08:25,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 10 letters. [2018-10-27 06:08:25,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 70 transitions. [2018-10-27 06:08:25,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-10-27 06:08:25,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 27 states and 32 transitions. [2018-10-27 06:08:25,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:08:25,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:08:25,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-10-27 06:08:25,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:25,964 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-10-27 06:08:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-10-27 06:08:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-27 06:08:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 06:08:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-10-27 06:08:25,995 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-10-27 06:08:25,995 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-10-27 06:08:25,995 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:25,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-10-27 06:08:25,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-10-27 06:08:25,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:25,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:25,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:25,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:25,997 INFO L793 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 163#L18-4 assume true; 154#L18-1 assume !(main_~i~0 < main_~MAX~0); 155#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 164#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 165#L25-4 [2018-10-27 06:08:25,998 INFO L795 eck$LassoCheckResult]: Loop: 165#L25-4 assume true; 167#L25-1 assume !!(main_~i~0 >= 0); 169#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 170#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 174#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 168#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 165#L25-4 [2018-10-27 06:08:25,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash 889538727, now seen corresponding path program 1 times [2018-10-27 06:08:25,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:25,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:26,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:26,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:26,099 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:26,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1602309961, now seen corresponding path program 1 times [2018-10-27 06:08:26,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:26,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:26,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:26,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:26,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:26,222 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:08:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:26,290 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-10-27 06:08:26,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:26,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-10-27 06:08:26,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:08:26,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 30 states and 32 transitions. [2018-10-27 06:08:26,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:08:26,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:08:26,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2018-10-27 06:08:26,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:26,293 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-27 06:08:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2018-10-27 06:08:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-10-27 06:08:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:08:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-10-27 06:08:26,296 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-10-27 06:08:26,296 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-10-27 06:08:26,296 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:26,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2018-10-27 06:08:26,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:08:26,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:26,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:26,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:26,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:26,301 INFO L793 eck$LassoCheckResult]: Stem: 239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 234#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 235#L18-4 assume true; 225#L18-1 assume !!(main_~i~0 < main_~MAX~0); 226#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 228#L19-1 havoc main_#t~nondet2; 217#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 218#L18-4 assume true; 223#L18-1 assume !(main_~i~0 < main_~MAX~0); 224#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 236#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 237#L25-4 [2018-10-27 06:08:26,301 INFO L795 eck$LassoCheckResult]: Loop: 237#L25-4 assume true; 238#L25-1 assume !!(main_~i~0 >= 0); 219#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 220#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 242#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 240#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 237#L25-4 [2018-10-27 06:08:26,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1918637386, now seen corresponding path program 1 times [2018-10-27 06:08:26,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:26,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1602309961, now seen corresponding path program 2 times [2018-10-27 06:08:26,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:26,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1788835374, now seen corresponding path program 1 times [2018-10-27 06:08:26,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:26,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:26,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:26,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,737 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2018-10-27 06:08:27,048 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-10-27 06:08:27,062 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:27,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:27,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:27,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:27,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:27,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:27,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:27,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:27,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-10-27 06:08:27,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:27,063 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:27,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,392 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-10-27 06:08:27,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,826 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:27,826 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:27,826 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-10-27 06:08:27,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,829 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-10-27 06:08:27,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,835 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-10-27 06:08:27,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,841 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-10-27 06:08:27,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,867 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:27,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:27,884 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:27,885 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:27,886 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:27,887 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:27,887 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-10-27 06:08:27,992 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-10-27 06:08:28,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:28,028 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-10-27 06:08:28,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:08:28,119 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 28 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 33 states and 36 transitions. Complement of second has 7 states. [2018-10-27 06:08:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-10-27 06:08:28,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 6 letters. [2018-10-27 06:08:28,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:28,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 17 letters. Loop has 6 letters. [2018-10-27 06:08:28,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:28,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 12 letters. [2018-10-27 06:08:28,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:28,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-10-27 06:08:28,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:08:28,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 28 states and 31 transitions. [2018-10-27 06:08:28,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-10-27 06:08:28,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-10-27 06:08:28,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-10-27 06:08:28,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:28,128 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-27 06:08:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-10-27 06:08:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-27 06:08:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 06:08:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-27 06:08:28,130 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-27 06:08:28,130 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-27 06:08:28,130 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:28,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2018-10-27 06:08:28,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:08:28,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:28,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:28,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:28,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:28,131 INFO L793 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 392#L18-4 assume true; 383#L18-1 assume !!(main_~i~0 < main_~MAX~0); 384#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 386#L19-1 havoc main_#t~nondet2; 375#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 376#L18-4 assume true; 381#L18-1 assume !(main_~i~0 < main_~MAX~0); 382#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 394#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 395#L25-4 assume true; 397#L25-1 assume !(main_~i~0 >= 0); 390#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 379#L31-4 [2018-10-27 06:08:28,132 INFO L795 eck$LassoCheckResult]: Loop: 379#L31-4 assume true; 380#L31-1 assume !!(main_~i~0 < main_~MAX~0); 387#L32 SUMMARY for call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L32 393#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L32-1 388#L32-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 389#L4 assume !(__VERIFIER_assert_~cond == 0); 401#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 385#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := main_#t~post6 + 1;havoc main_#t~post6; 379#L31-4 [2018-10-27 06:08:28,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash 701615097, now seen corresponding path program 1 times [2018-10-27 06:08:28,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:28,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:28,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:28,563 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/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-10-27 06:08:28,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:28,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:28,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2018-10-27 06:08:28,634 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:28,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1439866352, now seen corresponding path program 1 times [2018-10-27 06:08:28,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:28,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,794 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 06:08:28,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:08:28,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:08:28,882 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-10-27 06:08:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:28,952 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-10-27 06:08:28,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:08:28,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 44 transitions. [2018-10-27 06:08:28,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:08:28,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 43 transitions. [2018-10-27 06:08:28,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-10-27 06:08:28,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-10-27 06:08:28,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 43 transitions. [2018-10-27 06:08:28,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:28,955 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-27 06:08:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 43 transitions. [2018-10-27 06:08:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-27 06:08:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 06:08:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-10-27 06:08:28,957 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-27 06:08:28,957 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-27 06:08:28,957 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:28,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-10-27 06:08:28,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:08:28,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:28,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:28,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:28,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:28,962 INFO L793 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 511#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 512#L18-4 assume true; 503#L18-1 assume !!(main_~i~0 < main_~MAX~0); 504#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 506#L19-1 havoc main_#t~nondet2; 495#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 496#L18-4 assume true; 501#L18-1 assume !(main_~i~0 < main_~MAX~0); 502#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 514#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 515#L25-4 assume true; 516#L25-1 assume !!(main_~i~0 >= 0); 497#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 498#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 522#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 520#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 517#L25-4 assume true; 518#L25-1 assume !(main_~i~0 >= 0); 510#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 499#L31-4 [2018-10-27 06:08:28,962 INFO L795 eck$LassoCheckResult]: Loop: 499#L31-4 assume true; 500#L31-1 assume !!(main_~i~0 < main_~MAX~0); 507#L32 SUMMARY for call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L32 513#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L32-1 508#L32-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 509#L4 assume !(__VERIFIER_assert_~cond == 0); 521#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 505#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := main_#t~post6 + 1;havoc main_#t~post6; 499#L31-4 [2018-10-27 06:08:28,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash 759605873, now seen corresponding path program 1 times [2018-10-27 06:08:28,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:28,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:28,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1439866352, now seen corresponding path program 2 times [2018-10-27 06:08:28,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:28,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:28,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2128962432, now seen corresponding path program 1 times [2018-10-27 06:08:29,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:29,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:29,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,164 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 06:08:29,295 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-10-27 06:08:29,622 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2018-10-27 06:08:29,796 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2018-10-27 06:08:29,798 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:29,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:29,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:29,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:29,799 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:29,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:29,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:29,799 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:29,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration5_Lasso [2018-10-27 06:08:29,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:29,799 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:29,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:30,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:30,353 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:30,353 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:30,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:30,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:30,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:30,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:30,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:30,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:30,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:30,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:30,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:30,360 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-10-27 06:08:30,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:30,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:30,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:30,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:30,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:30,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:30,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:30,367 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-10-27 06:08:30,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:30,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:30,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:30,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:30,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:30,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:30,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:30,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:30,369 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-10-27 06:08:30,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:30,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:30,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:30,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:30,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:30,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:30,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:30,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:30,377 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-10-27 06:08:30,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:30,377 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:30,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:30,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:30,379 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:30,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:30,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:30,387 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-10-27 06:08:30,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:30,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:30,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:30,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:30,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:30,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:30,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:30,427 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:30,427 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:08:30,428 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:30,429 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:30,429 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:30,429 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-10-27 06:08:30,626 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-10-27 06:08:30,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:30,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:30,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:30,881 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-10-27 06:08:30,881 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-10-27 06:08:31,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 30 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 72 states and 77 transitions. Complement of second has 13 states. [2018-10-27 06:08:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2018-10-27 06:08:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-10-27 06:08:31,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 20 letters. Loop has 8 letters. [2018-10-27 06:08:31,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:31,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 28 letters. Loop has 8 letters. [2018-10-27 06:08:31,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:31,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 20 letters. Loop has 16 letters. [2018-10-27 06:08:31,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:31,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 77 transitions. [2018-10-27 06:08:31,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:08:31,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 39 states and 41 transitions. [2018-10-27 06:08:31,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:08:31,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:08:31,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-10-27 06:08:31,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:31,139 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-10-27 06:08:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-10-27 06:08:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-10-27 06:08:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 06:08:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-10-27 06:08:31,141 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-27 06:08:31,141 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-27 06:08:31,141 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:31,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2018-10-27 06:08:31,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:08:31,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:31,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:31,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:31,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:31,146 INFO L793 eck$LassoCheckResult]: Stem: 781#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 773#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 774#L18-4 assume true; 785#L18-1 assume !!(main_~i~0 < main_~MAX~0); 788#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 787#L19-1 havoc main_#t~nondet2; 756#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 757#L18-4 assume true; 764#L18-1 assume !!(main_~i~0 < main_~MAX~0); 765#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 767#L19-1 havoc main_#t~nondet2; 768#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 786#L18-4 assume true; 762#L18-1 assume !(main_~i~0 < main_~MAX~0); 763#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 780#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 776#L25-4 assume true; 777#L25-1 assume !!(main_~i~0 >= 0); 758#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 759#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 784#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 782#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 778#L25-4 assume true; 779#L25-1 assume !(main_~i~0 >= 0); 772#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 760#L31-4 [2018-10-27 06:08:31,146 INFO L795 eck$LassoCheckResult]: Loop: 760#L31-4 assume true; 761#L31-1 assume !!(main_~i~0 < main_~MAX~0); 769#L32 SUMMARY for call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L32 775#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L32-1 770#L32-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 771#L4 assume !(__VERIFIER_assert_~cond == 0); 783#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 766#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := main_#t~post6 + 1;havoc main_#t~post6; 760#L31-4 [2018-10-27 06:08:31,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:31,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1803361748, now seen corresponding path program 2 times [2018-10-27 06:08:31,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:31,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:31,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:31,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:31,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:31,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:31,858 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daefc3f2-ca8b-4c43-ac3d-dfcc29189061/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:31,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:31,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:31,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:31,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:31,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:31,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-10-27 06:08:31,930 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:31,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1439866352, now seen corresponding path program 3 times [2018-10-27 06:08:31,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:31,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:31,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,059 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 06:08:32,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:08:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:08:32,114 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-10-27 06:08:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:32,173 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-10-27 06:08:32,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:08:32,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 52 transitions. [2018-10-27 06:08:32,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:08:32,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 49 states and 51 transitions. [2018-10-27 06:08:32,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-10-27 06:08:32,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-10-27 06:08:32,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 51 transitions. [2018-10-27 06:08:32,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:32,175 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-10-27 06:08:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 51 transitions. [2018-10-27 06:08:32,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-10-27 06:08:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 06:08:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-10-27 06:08:32,177 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-10-27 06:08:32,177 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-10-27 06:08:32,177 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:32,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2018-10-27 06:08:32,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:08:32,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:32,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:32,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:32,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:32,182 INFO L793 eck$LassoCheckResult]: Stem: 951#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 944#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 945#L18-4 assume true; 957#L18-1 assume !!(main_~i~0 < main_~MAX~0); 964#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 962#L19-1 havoc main_#t~nondet2; 960#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 958#L18-4 assume true; 935#L18-1 assume !!(main_~i~0 < main_~MAX~0); 936#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 938#L19-1 havoc main_#t~nondet2; 927#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 928#L18-4 assume true; 933#L18-1 assume !(main_~i~0 < main_~MAX~0); 934#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 950#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 946#L25-4 assume true; 947#L25-1 assume !!(main_~i~0 >= 0); 956#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 959#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 954#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 952#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 948#L25-4 assume true; 949#L25-1 assume !!(main_~i~0 >= 0); 929#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 930#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 965#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 963#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 961#L25-4 assume true; 955#L25-1 assume !(main_~i~0 >= 0); 942#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 931#L31-4 [2018-10-27 06:08:32,182 INFO L795 eck$LassoCheckResult]: Loop: 931#L31-4 assume true; 932#L31-1 assume !!(main_~i~0 < main_~MAX~0); 939#L32 SUMMARY for call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L32 943#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L32-1 940#L32-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 941#L4 assume !(__VERIFIER_assert_~cond == 0); 953#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 937#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := main_#t~post6 + 1;havoc main_#t~post6; 931#L31-4 [2018-10-27 06:08:32,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1550183436, now seen corresponding path program 3 times [2018-10-27 06:08:32,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:32,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1439866352, now seen corresponding path program 4 times [2018-10-27 06:08:32,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1188565787, now seen corresponding path program 2 times [2018-10-27 06:08:32,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,749 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 132 [2018-10-27 06:08:33,051 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-10-27 06:08:33,053 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:33,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:33,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:33,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:33,053 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:33,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:33,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:33,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:33,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-10-27 06:08:33,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:33,054 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:33,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:33,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:33,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:33,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:33,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-10-27 06:08:33,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:33,117 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:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) 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-10-27 06:08:33,120 INFO L168 Benchmark]: Toolchain (without parser) took 11057.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.7 MB). Free memory was 961.8 MB in the beginning and 1.1 GB in the end (delta: -91.6 MB). Peak memory consumption was 258.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:33,121 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:33,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:33,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.55 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:33,130 INFO L168 Benchmark]: Boogie Preprocessor took 42.12 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:33,131 INFO L168 Benchmark]: RCFGBuilder took 683.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -213.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:33,131 INFO L168 Benchmark]: BuchiAutomizer took 10062.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.6 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 108.1 MB). Peak memory consumption was 272.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:33,135 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 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 44.55 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.12 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 683.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -213.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10062.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.6 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 108.1 MB). Peak memory consumption was 272.7 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...