./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/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 64bit --witnessprinter.graph.data.programhash 5bb7c0b0be083ae28de17688b83fb766e3f101f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:12:27,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:27,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:27,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:27,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:27,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:27,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:27,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:27,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:27,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:27,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:27,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:27,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:27,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:27,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:27,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:27,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:27,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:27,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:27,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:27,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:27,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:27,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:27,236 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:27,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:27,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:27,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:27,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:27,241 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:27,242 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:27,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:27,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:27,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:27,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:27,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:27,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:27,246 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:12:27,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:27,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:27,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:12:27,263 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:12:27,263 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:12:27,263 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:12:27,264 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:12:27,264 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:12:27,264 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:12:27,264 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:12:27,264 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:12:27,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:27,265 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:12:27,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:27,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:27,267 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:12:27,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:12:27,267 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:12:27,267 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:27,268 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:12:27,268 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:12:27,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:27,268 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:27,268 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:12:27,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:27,269 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:12:27,269 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:12:27,270 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:12:27,270 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_b412b4e4-f94a-4d48-9077-0fcf34748174/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb7c0b0be083ae28de17688b83fb766e3f101f5 [2018-10-27 06:12:27,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:27,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:27,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:27,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:27,328 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:27,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i [2018-10-27 06:12:27,386 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/data/6f46242b1/51e50fa4125146bba87829d3922344b4/FLAG2b1bdcc9c [2018-10-27 06:12:27,838 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:27,843 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i [2018-10-27 06:12:27,855 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/data/6f46242b1/51e50fa4125146bba87829d3922344b4/FLAG2b1bdcc9c [2018-10-27 06:12:27,867 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/data/6f46242b1/51e50fa4125146bba87829d3922344b4 [2018-10-27 06:12:27,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:27,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:27,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:27,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:27,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:27,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:27" (1/1) ... [2018-10-27 06:12:27,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1d7a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:27, skipping insertion in model container [2018-10-27 06:12:27,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:27" (1/1) ... [2018-10-27 06:12:27,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:27,930 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:28,207 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:28,217 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:28,256 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:28,297 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:28,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28 WrapperNode [2018-10-27 06:12:28,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:28,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:28,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:28,299 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:28,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:28,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:28,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:28,423 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:28,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... [2018-10-27 06:12:28,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:28,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:28,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:28,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:28,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b412b4e4-f94a-4d48-9077-0fcf34748174/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:12:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:12:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:28,991 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:28,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:28 BoogieIcfgContainer [2018-10-27 06:12:28,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:28,992 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:28,992 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:28,996 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:28,997 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:28,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:27" (1/3) ... [2018-10-27 06:12:28,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@167bf755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:28, skipping insertion in model container [2018-10-27 06:12:28,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:29,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:28" (2/3) ... [2018-10-27 06:12:29,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@167bf755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:29, skipping insertion in model container [2018-10-27 06:12:29,000 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:29,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:28" (3/3) ... [2018-10-27 06:12:29,002 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-termination.c.i [2018-10-27 06:12:29,061 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:29,062 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:29,062 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:29,062 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:29,062 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:29,069 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:29,069 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:29,070 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:29,070 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:29,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:12:29,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:29,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:29,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:29,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:29,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:29,126 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:29,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:12:29,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:29,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:29,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:29,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:29,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:29,139 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 21#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 7#L568-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 26#L573true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 28#L573-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 12#L574true assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 4#L552-5true [2018-10-27 06:12:29,142 INFO L795 eck$LassoCheckResult]: Loop: 4#L552-5true assume true; 14#L552-1true SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L552-1 16#L552-2true assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 22#L554true SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L554 11#L554-1true cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 19#L555-9true assume !true; 20#L555-10true SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-10 5#L557true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 3#L552-4true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 4#L552-5true [2018-10-27 06:12:29,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:29,153 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:12:29,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:29,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:29,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-10-27 06:12:29,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:29,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:29,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:29,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:29,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:29,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:29,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:12:29,399 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:12:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:12:29,420 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 06:12:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:29,430 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 06:12:29,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:12:29,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-10-27 06:12:29,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:29,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-10-27 06:12:29,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:12:29,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:12:29,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:12:29,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:29,447 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:12:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:12:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:12:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:12:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:12:29,473 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:12:29,474 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:12:29,474 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:29,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:12:29,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:29,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:29,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:29,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:29,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:29,476 INFO L793 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 74#L565 assume !(main_~length1~0 < 1); 75#L565-2 assume !(main_~length2~0 < 1); 72#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 73#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 84#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 81#L574 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 68#L552-5 [2018-10-27 06:12:29,476 INFO L795 eck$LassoCheckResult]: Loop: 68#L552-5 assume true; 69#L552-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L552-1 85#L552-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 76#L554 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L554 77#L554-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 66#L555-9 assume true; 71#L555-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-1 78#L555-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 80#L555-3 assume !cstrspn_#t~short7; 64#L555-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 65#L555-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-10 70#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 67#L552-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 68#L552-5 [2018-10-27 06:12:29,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:29,477 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:12:29,482 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:29,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:29,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:29,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:29,519 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-10-27 06:12:29,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:29,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:29,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:29,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:29,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:29,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:12:29,974 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:29,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:12:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:12:29,975 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-10-27 06:12:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:30,483 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-10-27 06:12:30,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:12:30,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-10-27 06:12:30,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:12:30,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-10-27 06:12:30,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-10-27 06:12:30,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:12:30,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-10-27 06:12:30,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:30,490 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-10-27 06:12:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-10-27 06:12:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-27 06:12:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:12:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-27 06:12:30,495 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:12:30,495 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:12:30,495 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:30,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-10-27 06:12:30,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:12:30,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:30,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:30,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:30,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:30,497 INFO L793 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 159#L565 assume !(main_~length1~0 < 1); 160#L565-2 assume !(main_~length2~0 < 1); 156#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 157#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 169#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 166#L574 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 152#L552-5 [2018-10-27 06:12:30,499 INFO L795 eck$LassoCheckResult]: Loop: 152#L552-5 assume true; 153#L552-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L552-1 170#L552-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 161#L554 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L554 162#L554-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 150#L555-9 assume true; 155#L555-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-1 163#L555-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 165#L555-3 assume cstrspn_#t~short7; 168#L555-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-4 171#L555-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 172#L555-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 158#L555-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-10 154#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 151#L552-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 152#L552-5 [2018-10-27 06:12:30,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-10-27 06:12:30,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:30,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-10-27 06:12:30,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:30,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:30,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:30,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-10-27 06:12:30,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:30,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,091 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-10-27 06:12:31,330 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-27 06:12:31,634 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-10-27 06:12:31,739 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-10-27 06:12:31,754 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:31,755 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:31,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:31,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:31,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:31,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:31,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:31,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:31,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:12:31,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:31,759 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:31,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:31,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:31,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:31,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:31,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,168 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-10-27 06:12:32,325 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-10-27 06:12:32,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,699 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 06:12:33,011 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:33,016 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:33,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:33,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:33,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:33,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:33,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:33,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:33,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:33,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:33,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:33,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:33,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:33,179 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:12:33,179 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:12:33,182 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:33,183 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:33,183 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:33,184 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-10-27 06:12:33,330 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:12:33,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:33,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:33,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:33,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:33,421 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:12:33,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:12:33,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 40 states and 47 transitions. Complement of second has 6 states. [2018-10-27 06:12:33,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-10-27 06:12:33,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-10-27 06:12:33,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:33,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-10-27 06:12:33,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:33,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-10-27 06:12:33,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:33,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-10-27 06:12:33,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:12:33,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-10-27 06:12:33,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:12:33,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:12:33,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-10-27 06:12:33,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:33,476 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-10-27 06:12:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-10-27 06:12:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-27 06:12:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:12:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-10-27 06:12:33,480 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:12:33,480 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:12:33,480 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:12:33,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-10-27 06:12:33,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:33,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:33,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:33,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:33,483 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:33,483 INFO L793 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 356#L565 assume !(main_~length1~0 < 1); 357#L565-2 assume !(main_~length2~0 < 1); 353#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 354#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 371#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 367#L574 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 347#L552-5 assume true; 349#L552-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L552-1 374#L552-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 360#L554 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L554 361#L554-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 342#L555-9 [2018-10-27 06:12:33,484 INFO L795 eck$LassoCheckResult]: Loop: 342#L555-9 assume true; 351#L555-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-1 358#L555-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 365#L555-3 assume !cstrspn_#t~short7; 341#L555-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 342#L555-9 [2018-10-27 06:12:33,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-10-27 06:12:33,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:33,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:33,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:33,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:33,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-10-27 06:12:33,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:33,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:33,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:33,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:33,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:33,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:12:33,586 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:33,587 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:12:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:33,624 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-10-27 06:12:33,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:33,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-10-27 06:12:33,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:33,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-10-27 06:12:33,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:12:33,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:12:33,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-10-27 06:12:33,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:33,628 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:12:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-10-27 06:12:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 06:12:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:12:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 06:12:33,631 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:12:33,631 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:12:33,631 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:12:33,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-10-27 06:12:33,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:33,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:33,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:33,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:33,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:33,634 INFO L793 eck$LassoCheckResult]: Stem: 447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 435#L565 assume !(main_~length1~0 < 1); 436#L565-2 assume !(main_~length2~0 < 1); 433#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 434#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 450#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 446#L574 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 427#L552-5 assume true; 429#L552-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L552-1 451#L552-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 437#L554 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L554 438#L554-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 421#L555-9 [2018-10-27 06:12:33,635 INFO L795 eck$LassoCheckResult]: Loop: 421#L555-9 assume true; 431#L555-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-1 441#L555-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 444#L555-3 assume cstrspn_#t~short7; 448#L555-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-4 453#L555-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 420#L555-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 421#L555-9 [2018-10-27 06:12:33,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-10-27 06:12:33,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:33,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:33,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:33,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:33,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-10-27 06:12:33,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:33,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:33,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:33,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-10-27 06:12:33,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:33,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:33,828 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:12:34,145 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-10-27 06:12:34,342 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:12:34,344 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:34,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:34,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:34,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:34,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:34,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:34,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:34,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:34,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:12:34,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:34,345 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:34,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:34,813 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2018-10-27 06:12:35,030 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-10-27 06:12:35,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,324 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-10-27 06:12:35,534 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:12:35,709 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:35,709 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:35,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:35,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:35,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:35,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:35,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,808 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:35,808 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-10-27 06:12:35,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,847 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-10-27 06:12:35,847 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-10-27 06:12:35,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,985 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:35,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:35,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:35,989 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:35,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:35,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:35,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:35,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:35,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:35,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:36,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,009 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:36,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,011 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:36,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,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-10-27 06:12:36,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:36,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:36,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,065 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:36,099 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:12:36,100 INFO L444 ModelExtractionUtils]: 60 out of 64 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:12:36,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:36,102 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:36,103 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:36,104 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-10-27 06:12:36,507 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-10-27 06:12:36,509 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:36,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:36,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:12:36,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:36,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:36,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:36,671 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:12:36,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-10-27 06:12:36,743 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 86 states and 94 transitions. Complement of second has 10 states. [2018-10-27 06:12:36,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:12:36,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:12:36,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:36,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-10-27 06:12:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:36,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-10-27 06:12:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:36,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-10-27 06:12:36,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:36,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-10-27 06:12:36,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:12:36,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:12:36,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-10-27 06:12:36,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:36,754 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-10-27 06:12:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-10-27 06:12:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-10-27 06:12:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:12:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-27 06:12:36,761 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:12:36,761 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:12:36,762 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:12:36,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-10-27 06:12:36,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:36,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:36,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:36,765 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:36,765 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:36,765 INFO L793 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 733#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 724#L565 assume !(main_~length1~0 < 1); 725#L565-2 assume !(main_~length2~0 < 1); 722#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 723#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 742#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 738#L574 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 714#L552-5 assume true; 715#L552-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L552-1 746#L552-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 747#L554 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L554 736#L554-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 737#L555-9 assume true; 731#L555-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-1 732#L555-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 735#L555-3 assume cstrspn_#t~short7; 741#L555-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-4 744#L555-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 710#L555-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 711#L555-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-10 718#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 712#L552-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 713#L552-5 assume true; 717#L552-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L552-1 745#L552-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 726#L554 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L554 727#L554-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 709#L555-9 [2018-10-27 06:12:36,765 INFO L795 eck$LassoCheckResult]: Loop: 709#L555-9 assume true; 719#L555-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-1 730#L555-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 734#L555-3 assume cstrspn_#t~short7; 740#L555-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L555-4 743#L555-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 708#L555-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 709#L555-9 [2018-10-27 06:12:36,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:36,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-10-27 06:12:36,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:36,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-10-27 06:12:36,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:36,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:36,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:36,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-10-27 06:12:36,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:36,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:36,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:37,737 WARN L179 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:12:38,010 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-10-27 06:12:38,584 WARN L179 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 149 [2018-10-27 06:12:39,497 WARN L179 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 119 [2018-10-27 06:12:39,502 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:39,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:39,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:39,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:39,502 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:39,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:39,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:39,503 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:39,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:12:39,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:39,503 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:39,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:39,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:12:40,637 WARN L179 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 119 [2018-10-27 06:12:40,786 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-10-27 06:12:40,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:41,038 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 06:12:41,757 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-10-27 06:12:41,876 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:12:41,884 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:41,885 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:41,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:41,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:41,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:41,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:41,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:41,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:41,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:41,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:41,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:41,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:41,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:41,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:41,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:41,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:41,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:41,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:41,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:41,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:41,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:41,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:41,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:41,988 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:41,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:41,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:41,990 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:41,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:42,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:42,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:42,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:42,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:42,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:42,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:42,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:42,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:42,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:42,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:42,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:42,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:42,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:42,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:42,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:42,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:42,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:42,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:42,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:42,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:42,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:42,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:42,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:42,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:42,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:42,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:42,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:42,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:42,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:42,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:42,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:42,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:42,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:42,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:42,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:42,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:42,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:42,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:42,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:42,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:42,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:42,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:42,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:42,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:42,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:42,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:42,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:42,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:42,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:42,178 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:12:42,178 INFO L444 ModelExtractionUtils]: 63 out of 70 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:12:42,178 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:42,179 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:42,179 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:42,180 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-10-27 06:12:42,388 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-10-27 06:12:42,390 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:42,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:42,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:12:42,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:42,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:42,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:42,664 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:12:42,664 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:12:42,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-10-27 06:12:42,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:12:42,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:12:42,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:42,772 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:12:42,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:42,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:42,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:42,876 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:12:42,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:12:42,975 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-10-27 06:12:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:12:42,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:12:42,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:42,977 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:12:42,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:43,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:43,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:43,092 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:12:43,092 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:12:43,168 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 85 states and 92 transitions. Complement of second has 9 states. [2018-10-27 06:12:43,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-10-27 06:12:43,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:12:43,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:43,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:12:43,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:43,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-10-27 06:12:43,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:43,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-10-27 06:12:43,174 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:43,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-10-27 06:12:43,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:43,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:43,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:43,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:43,175 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:43,175 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:43,175 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:43,175 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:12:43,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:43,176 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:43,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:12:43,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:43 BoogieIcfgContainer [2018-10-27 06:12:43,186 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:43,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:43,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:43,187 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:43,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:28" (3/4) ... [2018-10-27 06:12:43,191 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:12:43,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:43,191 INFO L168 Benchmark]: Toolchain (without parser) took 15321.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.5 MB). Free memory was 951.8 MB in the beginning and 891.8 MB in the end (delta: 59.9 MB). Peak memory consumption was 426.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:43,192 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:43,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:43,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -222.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:43,194 INFO L168 Benchmark]: Boogie Preprocessor took 34.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:43,194 INFO L168 Benchmark]: RCFGBuilder took 533.79 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: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:43,195 INFO L168 Benchmark]: BuchiAutomizer took 14194.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 1.1 GB in the beginning and 891.8 MB in the end (delta: 234.5 MB). Peak memory consumption was 443.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:43,195 INFO L168 Benchmark]: Witness Printer took 4.01 ms. Allocated memory is still 1.4 GB. Free memory is still 891.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:43,199 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 425.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -222.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 533.79 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: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14194.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 1.1 GB in the beginning and 891.8 MB in the end (delta: 234.5 MB). Peak memory consumption was 443.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.01 ms. Allocated memory is still 1.4 GB. Free memory is still 891.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 12.2s. Construction of modules took 0.4s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 190 SDtfs, 238 SDslu, 225 SDs, 0 SdLazy, 213 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax105 hnf99 lsp86 ukn87 mio100 lsp30 div122 bol100 ite100 ukn100 eq173 hnf83 smp95 dnf525 smp25 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 176ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...