./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/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 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:24,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:24,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:24,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:24,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:24,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:24,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:24,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:24,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:24,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:24,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:24,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:24,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:24,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:24,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:24,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:24,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:24,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:24,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:24,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:24,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:24,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:24,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:24,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:24,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:24,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:24,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:24,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:24,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:24,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:24,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:24,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:24,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:24,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:24,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:24,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:24,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:24,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:24,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:24,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:24,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:24,452 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:00:24,463 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:24,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:24,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:24,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:24,465 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:24,465 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:24,465 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:24,465 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:24,465 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:24,466 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:24,466 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:24,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:24,466 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:24,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:24,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:24,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:24,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:24,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:24,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:24,468 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:24,468 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:24,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:24,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:24,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:24,468 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:24,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:24,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:24,469 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:24,470 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:24,470 INFO L138 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_14155638-db15-4127-886f-550a77261e79/bin/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 -> 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca [2019-10-22 09:00:24,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:24,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:24,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:24,513 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:24,513 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:24,514 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i [2019-10-22 09:00:24,562 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/data/e3d424d93/2d14bba93a6f40e986b975962f6d477e/FLAG3ef7fa641 [2019-10-22 09:00:24,994 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:24,994 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i [2019-10-22 09:00:25,002 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/data/e3d424d93/2d14bba93a6f40e986b975962f6d477e/FLAG3ef7fa641 [2019-10-22 09:00:25,013 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/uautomizer/data/e3d424d93/2d14bba93a6f40e986b975962f6d477e [2019-10-22 09:00:25,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:25,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:25,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:25,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:25,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:25,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fda6529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25, skipping insertion in model container [2019-10-22 09:00:25,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,034 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:25,067 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:25,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:25,399 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:25,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:25,475 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:25,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25 WrapperNode [2019-10-22 09:00:25,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:25,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:25,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:25,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:25,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:25,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:25,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:25,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:25,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:25,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:25,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:25,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:25,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14155638-db15-4127-886f-550a77261e79/bin/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 [2019-10-22 09:00:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:25,845 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:25,845 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:00:25,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:25 BoogieIcfgContainer [2019-10-22 09:00:25,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:25,847 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:25,847 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:25,850 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:25,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:25,851 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:25" (1/3) ... [2019-10-22 09:00:25,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@242ecc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:25, skipping insertion in model container [2019-10-22 09:00:25,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:25,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (2/3) ... [2019-10-22 09:00:25,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@242ecc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:25, skipping insertion in model container [2019-10-22 09:00:25,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:25,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:25" (3/3) ... [2019-10-22 09:00:25,861 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn_diffterm_alloca.i [2019-10-22 09:00:25,940 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:25,941 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:25,941 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:25,941 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:25,941 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:25,941 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:25,941 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:25,941 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:25,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:00:26,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:26,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:26,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:26,007 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:26,007 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:26,007 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:26,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:00:26,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:26,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:26,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:26,009 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:26,009 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:26,016 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 6#L369-4true [2019-10-22 09:00:26,017 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2019-10-22 09:00:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 09:00:26,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945023817] [2019-10-22 09:00:26,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,167 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-10-22 09:00:26,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995950161] [2019-10-22 09:00:26,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:26,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995950161] [2019-10-22 09:00:26,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:26,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:26,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286404211] [2019-10-22 09:00:26,204 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:26,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:26,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:00:26,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:00:26,220 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 09:00:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:26,226 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 09:00:26,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:00:26,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 09:00:26,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:26,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-10-22 09:00:26,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:00:26,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:00:26,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-10-22 09:00:26,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:26,234 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 09:00:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-10-22 09:00:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 09:00:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:00:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 09:00:26,259 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 09:00:26,259 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 09:00:26,260 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:26,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 09:00:26,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:26,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:26,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:26,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:26,261 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:26,261 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 47#L369-4 [2019-10-22 09:00:26,261 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2019-10-22 09:00:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-10-22 09:00:26,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912440973] [2019-10-22 09:00:26,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,295 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-10-22 09:00:26,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456375865] [2019-10-22 09:00:26,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-10-22 09:00:26,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018371049] [2019-10-22 09:00:26,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,380 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:26,609 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-22 09:00:26,833 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-22 09:00:27,147 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-10-22 09:00:27,267 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-22 09:00:27,280 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:27,281 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:27,281 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:27,281 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:27,281 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:27,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:27,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:27,282 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:27,282 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration2_Lasso [2019-10-22 09:00:27,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:27,282 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:27,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,711 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-22 09:00:27,866 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-10-22 09:00:28,463 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 09:00:28,628 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-10-22 09:00:28,637 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:28,642 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:28,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,654 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,666 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,666 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,674 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,674 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,677 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,682 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,683 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,689 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,689 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,692 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,694 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,695 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,695 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,695 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,695 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,696 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,697 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,698 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,698 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,703 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,704 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,704 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,710 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,710 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,762 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:28,798 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:00:28,798 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:00:28,800 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:28,802 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:28,802 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:28,803 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 Supporting invariants [] [2019-10-22 09:00:28,835 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 09:00:28,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:28,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:28,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 09:00:28,979 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-10-22 09:00:28,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 09:00:28,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 09:00:28,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:28,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-10-22 09:00:28,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:28,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-10-22 09:00:28,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:28,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-10-22 09:00:28,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:28,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-10-22 09:00:28,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:00:28,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:00:28,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 09:00:28,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:28,987 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:00:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 09:00:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 09:00:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:00:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 09:00:28,989 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:00:28,989 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:00:28,989 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:28,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 09:00:28,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:28,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:28,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:28,990 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:28,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:28,990 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 177#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 179#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 189#L372-5 [2019-10-22 09:00:28,990 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 184#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 189#L372-5 [2019-10-22 09:00:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-10-22 09:00:28,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:28,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476915614] [2019-10-22 09:00:28,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:29,017 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-10-22 09:00:29,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:29,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672514872] [2019-10-22 09:00:29,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:29,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:29,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:29,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-10-22 09:00:29,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:29,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52726465] [2019-10-22 09:00:29,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:29,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:29,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:29,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:29,225 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-10-22 09:00:29,524 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-10-22 09:00:29,614 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:29,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:29,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:29,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:29,615 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:29,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:29,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:29,615 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:29,615 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration3_Lasso [2019-10-22 09:00:29,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:29,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:29,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,880 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-10-22 09:00:29,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:29,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,491 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 09:00:30,727 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-10-22 09:00:30,751 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:30,751 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:30,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,753 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,756 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,758 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,758 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,761 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,762 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:30,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,765 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,771 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,772 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:30,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,777 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,777 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,780 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,786 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,787 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,792 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:30,792 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,794 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:30,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,799 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:30,799 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:30,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,822 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,822 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,824 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,824 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:30,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,827 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:30,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:30,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:30,834 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,835 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:30,871 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:30,897 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:30,898 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:00:30,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:30,899 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:30,899 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:30,900 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-10-22 09:00:30,939 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 09:00:30,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:30,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:30,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:30,991 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:30,991 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 09:00:31,027 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-10-22 09:00:31,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 09:00:31,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 09:00:31,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:31,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 09:00:31,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:31,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 09:00:31,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:31,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-10-22 09:00:31,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:31,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-10-22 09:00:31,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:00:31,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:00:31,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-10-22 09:00:31,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:31,033 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-22 09:00:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-10-22 09:00:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 09:00:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:00:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 09:00:31,040 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 09:00:31,040 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 09:00:31,040 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:31,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 09:00:31,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:31,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:31,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:31,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:31,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:31,042 INFO L791 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 355#L382 assume !(main_~length1~0 < 1); 356#L382-2 assume !(main_~length2~0 < 1); 353#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 349#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 350#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 363#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 359#L372-1 assume !cstrspn_#t~short210; 360#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 345#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 346#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 347#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 348#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 352#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 362#L372-5 [2019-10-22 09:00:31,042 INFO L793 eck$LassoCheckResult]: Loop: 362#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 357#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 358#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 362#L372-5 [2019-10-22 09:00:31,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-10-22 09:00:31,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529216500] [2019-10-22 09:00:31,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:31,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529216500] [2019-10-22 09:00:31,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:31,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:00:31,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561513631] [2019-10-22 09:00:31,124 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-10-22 09:00:31,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684523884] [2019-10-22 09:00:31,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,135 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:31,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:31,270 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 09:00:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:31,337 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-10-22 09:00:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:31,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-10-22 09:00:31,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:00:31,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-10-22 09:00:31,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:00:31,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:00:31,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-10-22 09:00:31,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:31,340 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 09:00:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-10-22 09:00:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-10-22 09:00:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 09:00:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-22 09:00:31,342 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 09:00:31,342 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 09:00:31,342 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:31,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-10-22 09:00:31,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:31,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:31,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:31,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:31,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:31,344 INFO L791 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 426#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 427#L382 assume !(main_~length1~0 < 1); 428#L382-2 assume !(main_~length2~0 < 1); 425#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 421#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 422#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 440#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 439#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 438#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 417#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 418#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 419#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 420#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 423#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 434#L372-5 [2019-10-22 09:00:31,344 INFO L793 eck$LassoCheckResult]: Loop: 434#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 429#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 430#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 434#L372-5 [2019-10-22 09:00:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-10-22 09:00:31,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136702843] [2019-10-22 09:00:31,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,369 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,369 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-10-22 09:00:31,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256550699] [2019-10-22 09:00:31,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,377 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-10-22 09:00:31,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076872281] [2019-10-22 09:00:31,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,415 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,983 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 139 [2019-10-22 09:00:32,753 WARN L191 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2019-10-22 09:00:32,754 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:32,755 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:32,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:32,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:32,755 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:32,755 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:32,755 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:32,755 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:32,755 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration5_Lasso [2019-10-22 09:00:32,755 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:32,755 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:32,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,982 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 09:00:33,544 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-10-22 09:00:33,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,246 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-10-22 09:00:34,388 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-10-22 09:00:34,724 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 09:00:34,745 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:34,745 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:34,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,752 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,752 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,756 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,758 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,758 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,760 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,760 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,761 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,762 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,762 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,764 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,766 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,766 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,774 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,774 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,774 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,776 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,778 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,778 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:34,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,796 INFO L202 nArgumentSynthesizer]: 6 stem disjuncts [2019-10-22 09:00:34,796 INFO L203 nArgumentSynthesizer]: 7 loop disjuncts [2019-10-22 09:00:34,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,850 INFO L400 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2019-10-22 09:00:34,850 INFO L401 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2019-10-22 09:00:35,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:35,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,162 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,162 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:35,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,166 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,166 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,167 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,167 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:35,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,169 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,169 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:35,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,174 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,174 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,201 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:35,235 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:35,235 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:00:35,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:35,237 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:35,237 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:35,237 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 Supporting invariants [] [2019-10-22 09:00:35,349 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2019-10-22 09:00:35,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:35,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:35,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:00:35,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 09:00:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 09:00:35,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 09:00:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:35,413 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:35,466 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:35,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:00:35,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 09:00:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 09:00:35,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 09:00:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:35,487 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:35,532 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:35,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:00:35,553 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2019-10-22 09:00:35,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-10-22 09:00:35,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 09:00:35,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:35,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 09:00:35,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:35,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 09:00:35,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:35,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-10-22 09:00:35,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:35,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-10-22 09:00:35,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:35,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:35,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:35,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:35,557 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:35,557 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:35,557 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:35,557 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:35,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:35,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:35,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:35,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:35 BoogieIcfgContainer [2019-10-22 09:00:35,563 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:35,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:35,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:35,564 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:35,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:25" (3/4) ... [2019-10-22 09:00:35,567 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:35,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:35,569 INFO L168 Benchmark]: Toolchain (without parser) took 10552.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 126.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:35,569 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:35,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:35,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.75 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:35,570 INFO L168 Benchmark]: Boogie Preprocessor took 25.06 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:35,571 INFO L168 Benchmark]: RCFGBuilder took 305.26 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:35,571 INFO L168 Benchmark]: BuchiAutomizer took 9716.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.0 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:35,572 INFO L168 Benchmark]: Witness Printer took 3.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:35,574 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 458.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.75 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.06 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 305.26 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9716.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.0 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 120 SDslu, 52 SDs, 0 SdLazy, 95 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp31 div127 bol100 ite100 ukn100 eq168 hnf81 smp93 dnf653 smp46 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 381ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 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...