./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/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_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/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 Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:39:49,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:39:49,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:39:49,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:39:49,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:39:49,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:39:49,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:39:49,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:39:49,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:39:49,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:39:49,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:39:49,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:39:49,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:39:49,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:39:49,213 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:39:49,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:39:49,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:39:49,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:39:49,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:39:49,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:39:49,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:39:49,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:39:49,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:39:49,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:39:49,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:39:49,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:39:49,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:39:49,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:39:49,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:39:49,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:39:49,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:39:49,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:39:49,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:39:49,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:39:49,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:39:49,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:39:49,226 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 09:39:49,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:39:49,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:39:49,238 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:39:49,238 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:39:49,238 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:39:49,238 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 09:39:49,238 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 09:39:49,238 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 09:39:49,239 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 09:39:49,239 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 09:39:49,239 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 09:39:49,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:39:49,239 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:39:49,239 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 09:39:49,239 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:39:49,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:39:49,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:39:49,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 09:39:49,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 09:39:49,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 09:39:49,240 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:39:49,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:39:49,240 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 09:39:49,241 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:39:49,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 09:39:49,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:39:49,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:39:49,241 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 09:39:49,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:39:49,241 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:39:49,241 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 09:39:49,242 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 09:39:49,242 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_001eef44-ef0f-4a49-b836-5991dc215bce/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-11-23 09:39:49,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:39:49,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:39:49,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:39:49,277 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:39:49,277 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:39:49,277 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 09:39:49,321 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/data/f545cefe2/ef9848295c12452e8423034ff093d8a0/FLAG0497af025 [2018-11-23 09:39:49,720 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:39:49,721 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 09:39:49,724 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/data/f545cefe2/ef9848295c12452e8423034ff093d8a0/FLAG0497af025 [2018-11-23 09:39:49,735 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/bin-2019/uautomizer/data/f545cefe2/ef9848295c12452e8423034ff093d8a0 [2018-11-23 09:39:49,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:39:49,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:39:49,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:39:49,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:39:49,742 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:39:49,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49, skipping insertion in model container [2018-11-23 09:39:49,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:39:49,769 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:39:49,874 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:39:49,876 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:39:49,892 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:39:49,904 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:39:49,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49 WrapperNode [2018-11-23 09:39:49,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:39:49,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:39:49,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:39:49,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:39:49,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:39:49,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:39:49,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:39:49,926 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:39:49,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... [2018-11-23 09:39:49,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:39:49,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:39:49,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:39:49,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:39:49,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/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-11-23 09:39:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:39:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:39:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:39:50,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:39:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:39:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:39:50,149 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:39:50,149 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 09:39:50,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:50 BoogieIcfgContainer [2018-11-23 09:39:50,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:39:50,150 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 09:39:50,150 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 09:39:50,153 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 09:39:50,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:39:50,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 09:39:49" (1/3) ... [2018-11-23 09:39:50,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10fc895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 09:39:50, skipping insertion in model container [2018-11-23 09:39:50,155 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:39:50,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:49" (2/3) ... [2018-11-23 09:39:50,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10fc895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 09:39:50, skipping insertion in model container [2018-11-23 09:39:50,155 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:39:50,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:50" (3/3) ... [2018-11-23 09:39:50,156 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-23 09:39:50,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:39:50,192 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 09:39:50,192 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 09:39:50,192 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 09:39:50,192 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:39:50,192 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:39:50,192 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 09:39:50,192 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:39:50,192 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 09:39:50,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 09:39:50,216 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 09:39:50,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:39:50,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:39:50,222 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:39:50,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:39:50,222 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 09:39:50,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 09:39:50,223 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 09:39:50,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:39:50,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:39:50,224 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:39:50,224 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:39:50,230 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true 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;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 3#L18-3true [2018-11-23 09:39:50,230 INFO L796 eck$LassoCheckResult]: Loop: 3#L18-3true assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5#L18-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3#L18-3true [2018-11-23 09:39:50,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 09:39:50,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:50,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:50,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:50,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 09:39:50,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:50,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:50,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:50,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 09:39:50,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:50,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:50,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:50,568 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:39:50,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:39:50,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:39:50,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:39:50,569 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:39:50,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:39:50,569 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:39:50,569 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:39:50,570 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 09:39:50,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:39:50,570 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:39:50,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:50,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,009 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-23 09:39:51,027 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:39:51,031 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:39:51,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:51,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:51,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:51,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:51,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:51,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:51,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:51,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:51,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:51,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:51,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,094 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:39:51,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,097 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:39:51,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:51,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:51,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:51,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:51,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:51,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,106 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:39:51,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,107 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:39:51,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:51,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:51,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:51,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:51,112 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:39:51,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:51,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:51,115 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:39:51,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:51,142 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:39:51,163 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 09:39:51,163 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 09:39:51,165 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:39:51,167 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:39:51,167 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:39:51,168 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~#str1~0.offset) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~#str1~0.offset Supporting invariants [] [2018-11-23 09:39:51,173 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 09:39:51,178 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 09:39:51,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:51,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:51,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:39:51,238 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 09:39:51,238 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2018-11-23 09:39:51,269 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 8 states. [2018-11-23 09:39:51,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 09:39:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:39:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 09:39:51,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 09:39:51,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:51,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 09:39:51,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:51,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 09:39:51,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:51,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-11-23 09:39:51,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 09:39:51,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2018-11-23 09:39:51,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 09:39:51,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 09:39:51,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-23 09:39:51,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:39:51,281 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 09:39:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-23 09:39:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 09:39:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:39:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-23 09:39:51,297 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 09:39:51,297 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 09:39:51,298 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 09:39:51,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-23 09:39:51,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 09:39:51,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:39:51,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:39:51,299 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 09:39:51,299 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:39:51,299 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 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;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 102#L18-3 assume !(main_~i~0 < main_~MAX~0); 103#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 114#L25-3 [2018-11-23 09:39:51,299 INFO L796 eck$LassoCheckResult]: Loop: 114#L25-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 115#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 114#L25-3 [2018-11-23 09:39:51,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-23 09:39:51,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:51,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:39:51,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:51,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:51,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 09:39:51,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:51,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-11-23 09:39:51,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:51,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:51,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:39:51,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:39:51,411 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 09:39:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:51,439 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 09:39:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:39:51,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2018-11-23 09:39:51,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 09:39:51,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 16 transitions. [2018-11-23 09:39:51,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 09:39:51,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 09:39:51,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-23 09:39:51,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:39:51,442 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 09:39:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-23 09:39:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 09:39:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 09:39:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-23 09:39:51,443 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 09:39:51,443 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 09:39:51,443 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 09:39:51,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-23 09:39:51,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 09:39:51,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:39:51,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:39:51,444 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 09:39:51,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:39:51,445 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 145#L-1 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;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 141#L18-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 142#L18-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 143#L18-3 assume !(main_~i~0 < main_~MAX~0); 144#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 149#L25-3 [2018-11-23 09:39:51,445 INFO L796 eck$LassoCheckResult]: Loop: 149#L25-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 150#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 149#L25-3 [2018-11-23 09:39:51,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:51,445 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-23 09:39:51,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:51,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:51,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-11-23 09:39:51,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:51,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:51,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:51,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:51,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash 265181135, now seen corresponding path program 1 times [2018-11-23 09:39:51,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:51,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:39:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:51,726 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:39:51,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:39:51,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:39:51,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:39:51,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:39:51,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:39:51,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:39:51,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:39:51,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-23 09:39:51,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:39:51,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:39:51,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:51,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:39:51,999 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:39:52,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:52,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:52,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:52,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:52,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:52,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:52,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:52,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:52,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:52,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:52,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:52,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:52,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:52,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:52,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:52,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,012 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:39:52,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,013 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:39:52,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:52,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:52,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:52,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:52,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:52,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:52,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:52,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:52,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,025 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:39:52,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,026 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:39:52,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:52,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:52,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:52,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:52,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:52,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:52,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:52,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:52,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:52,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:52,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:52,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:52,048 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:39:52,053 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 09:39:52,053 INFO L444 ModelExtractionUtils]: 22 out of 25 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 09:39:52,053 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:39:52,054 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:39:52,054 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:39:52,054 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-23 09:39:52,091 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 09:39:52,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:52,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:52,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:39:52,128 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 09:39:52,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 09:39:52,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 16 states and 21 transitions. Complement of second has 7 states. [2018-11-23 09:39:52,144 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-11-23 09:39:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:39:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-23 09:39:52,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 09:39:52,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:52,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 09:39:52,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:52,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 09:39:52,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:52,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2018-11-23 09:39:52,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 09:39:52,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2018-11-23 09:39:52,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 09:39:52,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 09:39:52,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-23 09:39:52,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:39:52,147 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 09:39:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-23 09:39:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 09:39:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:39:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-23 09:39:52,148 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 09:39:52,149 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 09:39:52,149 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 09:39:52,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-23 09:39:52,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 09:39:52,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:39:52,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:39:52,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:52,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 09:39:52,151 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 230#L-1 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;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 231#L18-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 232#L18-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 233#L18-3 assume !(main_~i~0 < main_~MAX~0); 234#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 238#L25-3 assume !(main_~i~0 >= 0); 235#L25-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 236#L31-3 [2018-11-23 09:39:52,151 INFO L796 eck$LassoCheckResult]: Loop: 236#L31-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__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; 241#L4 assume !(0 == __VERIFIER_assert_~cond); 242#L4-2 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; 243#L31-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 236#L31-3 [2018-11-23 09:39:52,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:52,151 INFO L82 PathProgramCache]: Analyzing trace with hash 265181077, now seen corresponding path program 1 times [2018-11-23 09:39:52,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:52,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:39:52,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:52,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_001eef44-ef0f-4a49-b836-5991dc215bce/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-11-23 09:39:52,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:52,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:39:52,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:39:52,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2018-11-23 09:39:52,228 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 09:39:52,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2018-11-23 09:39:52,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:52,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:52,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:52,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:39:52,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:39:52,361 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-23 09:39:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:52,385 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 09:39:52,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:39:52,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-23 09:39:52,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 09:39:52,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 09:39:52,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 09:39:52,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 09:39:52,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-23 09:39:52,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:39:52,387 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 09:39:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-23 09:39:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-11-23 09:39:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:39:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-23 09:39:52,387 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 09:39:52,388 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 09:39:52,388 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 09:39:52,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-23 09:39:52,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 09:39:52,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:39:52,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:39:52,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:52,388 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 09:39:52,388 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 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;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 296#L18-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 297#L18-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 298#L18-3 assume !(main_~i~0 < main_~MAX~0); 299#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 303#L25-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 304#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 305#L25-3 assume !(main_~i~0 >= 0); 300#L25-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 301#L31-3 [2018-11-23 09:39:52,388 INFO L796 eck$LassoCheckResult]: Loop: 301#L31-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__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; 306#L4 assume !(0 == __VERIFIER_assert_~cond); 307#L4-2 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; 308#L31-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 301#L31-3 [2018-11-23 09:39:52,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1436000983, now seen corresponding path program 1 times [2018-11-23 09:39:52,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:52,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:52,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2018-11-23 09:39:52,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:52,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:52,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1461824416, now seen corresponding path program 1 times [2018-11-23 09:39:52,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:39:52,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:39:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:39:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:39:52,670 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-11-23 09:39:52,795 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2018-11-23 09:39:52,796 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:39:52,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:39:52,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:39:52,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:39:52,797 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:39:52,797 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:39:52,797 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:39:52,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:39:52,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-23 09:39:52,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:39:52,797 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:39:52,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,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-11-23 09:39:52,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,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-11-23 09:39:52,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:52,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:39:53,082 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:39:53,083 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:39:53,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:53,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:53,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:53,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:53,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:53,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:53,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:53,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:53,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:53,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:53,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:53,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:53,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:53,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:53,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:39:53,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:53,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:39:53,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:39:53,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:53,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:53,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:53,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:53,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:53,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:53,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:53,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:53,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:53,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:53,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:53,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:53,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:53,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,104 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:39:53,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,105 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:39:53,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:53,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:39:53,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:39:53,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:39:53,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:39:53,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:39:53,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:39:53,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:39:53,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:39:53,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:39:53,143 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 09:39:53,143 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 09:39:53,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:39:53,144 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:39:53,144 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:39:53,144 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_3, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~#str2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_3 + 2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~#str2~0.offset Supporting invariants [] [2018-11-23 09:39:53,163 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 09:39:53,164 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 09:39:53,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:53,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:53,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:39:53,226 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 09:39:53,226 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 09:39:53,234 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 19 states and 22 transitions. Complement of second has 6 states. [2018-11-23 09:39:53,234 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-11-23 09:39:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:39:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 09:39:53,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 09:39:53,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:53,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 09:39:53,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:53,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-23 09:39:53,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:39:53,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-23 09:39:53,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 09:39:53,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-23 09:39:53,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 09:39:53,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 09:39:53,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 09:39:53,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:39:53,237 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:39:53,237 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:39:53,237 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:39:53,237 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 09:39:53,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 09:39:53,237 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 09:39:53,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 09:39:53,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 09:39:53 BoogieIcfgContainer [2018-11-23 09:39:53,242 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 09:39:53,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:39:53,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:39:53,243 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:39:53,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:50" (3/4) ... [2018-11-23 09:39:53,245 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:39:53,245 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:39:53,246 INFO L168 Benchmark]: Toolchain (without parser) took 3508.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:53,247 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:39:53,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.97 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:53,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.94 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:53,248 INFO L168 Benchmark]: Boogie Preprocessor took 50.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:53,248 INFO L168 Benchmark]: RCFGBuilder took 172.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:53,249 INFO L168 Benchmark]: BuchiAutomizer took 3092.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.0 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:53,249 INFO L168 Benchmark]: Witness Printer took 2.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:39:53,252 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.97 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.4 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 20.94 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3092.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.0 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[str1] + -1 * str1 and consists of 5 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[str1] + 2 * j + 2 * str2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 38 SDtfs, 41 SDslu, 19 SDs, 0 SdLazy, 65 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax100 hnf99 lsp86 ukn65 mio100 lsp73 div143 bol100 ite100 ukn100 eq157 hnf71 smp87 dnf153 smp84 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...