./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:37:53,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:37:53,584 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:37:53,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:37:53,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:37:53,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:37:53,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:37:53,593 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:37:53,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:37:53,595 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:37:53,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:37:53,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:37:53,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:37:53,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:37:53,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:37:53,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:37:53,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:37:53,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:37:53,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:37:53,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:37:53,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:37:53,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:37:53,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:37:53,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:37:53,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:37:53,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:37:53,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:37:53,606 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:37:53,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:37:53,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:37:53,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:37:53,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:37:53,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:37:53,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:37:53,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:37:53,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:37:53,610 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:37:53,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:37:53,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:37:53,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:37:53,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:37:53,620 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:37:53,620 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:37:53,620 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:37:53,620 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:37:53,620 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:37:53,620 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:37:53,620 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:37:53,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:37:53,621 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:37:53,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:37:53,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:37:53,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:37:53,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:37:53,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:37:53,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:37:53,621 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:37:53,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:37:53,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:37:53,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:37:53,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:37:53,622 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:37:53,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:37:53,622 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:37:53,623 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:37:53,623 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:37:53,623 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b [2018-11-23 03:37:53,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:37:53,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:37:53,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:37:53,658 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:37:53,658 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:37:53,659 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2018-11-23 03:37:53,697 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/data/aac88bba9/1846c49d82b3482990e131dd04d62e34/FLAG73ee7d293 [2018-11-23 03:37:54,145 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:37:54,145 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2018-11-23 03:37:54,151 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/data/aac88bba9/1846c49d82b3482990e131dd04d62e34/FLAG73ee7d293 [2018-11-23 03:37:54,161 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/data/aac88bba9/1846c49d82b3482990e131dd04d62e34 [2018-11-23 03:37:54,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:37:54,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:37:54,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:37:54,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:37:54,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:37:54,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c24d0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54, skipping insertion in model container [2018-11-23 03:37:54,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:37:54,208 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:37:54,417 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:37:54,425 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:37:54,505 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:37:54,543 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:37:54,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54 WrapperNode [2018-11-23 03:37:54,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:37:54,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:37:54,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:37:54,544 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:37:54,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:37:54,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:37:54,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:37:54,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:37:54,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... [2018-11-23 03:37:54,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:37:54,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:37:54,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:37:54,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:37:54,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:37:54,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:37:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:37:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:37:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:37:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:37:54,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:37:54,800 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:37:54,800 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 03:37:54,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:37:54 BoogieIcfgContainer [2018-11-23 03:37:54,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:37:54,801 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:37:54,801 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:37:54,803 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:37:54,803 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:37:54,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:37:54" (1/3) ... [2018-11-23 03:37:54,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9956bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:37:54, skipping insertion in model container [2018-11-23 03:37:54,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:37:54,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:54" (2/3) ... [2018-11-23 03:37:54,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9956bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:37:54, skipping insertion in model container [2018-11-23 03:37:54,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:37:54,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:37:54" (3/3) ... [2018-11-23 03:37:54,806 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca_true-termination.c.i [2018-11-23 03:37:54,840 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:37:54,840 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:37:54,840 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:37:54,840 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:37:54,840 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:37:54,840 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:37:54,840 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:37:54,840 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:37:54,841 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:37:54,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 03:37:54,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:37:54,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:37:54,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:37:54,870 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:37:54,870 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:37:54,870 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:37:54,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 03:37:54,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:37:54,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:37:54,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:37:54,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:37:54,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:37:54,878 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#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; 12#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.alloc(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.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2018-11-23 03:37:54,879 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-11-23 03:37:54,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:54,884 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 03:37:54,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:54,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:54,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:54,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:54,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 03:37:54,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:54,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:54,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:37:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:37:55,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:37:55,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:37:55,006 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:37:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:37:55,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:37:55,018 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 03:37:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:37:55,023 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 03:37:55,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:37:55,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 03:37:55,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:37:55,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 03:37:55,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 03:37:55,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 03:37:55,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 03:37:55,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:37:55,028 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:37:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 03:37:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 03:37:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 03:37:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 03:37:55,045 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:37:55,045 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:37:55,045 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:37:55,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 03:37:55,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:37:55,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:37:55,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:37:55,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:37:55,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:37:55,047 INFO L794 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.alloc(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.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2018-11-23 03:37:55,047 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2018-11-23 03:37:55,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 03:37:55,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:55,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:55,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:55,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 03:37:55,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:55,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:55,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:37:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:55,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 03:37:55,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:55,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:55,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:55,312 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 03:37:55,530 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-23 03:37:55,686 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 03:37:55,757 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:37:55,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:37:55,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:37:55,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:37:55,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:37:55,758 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:37:55,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:37:55,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:37:55,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 03:37:55,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:37:55,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:37:55,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:55,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:55,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:55,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:55,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:55,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:55,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:55,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,078 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-11-23 03:37:56,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:56,438 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-23 03:37:56,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:37:56,563 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:37:56,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:37:56,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:37:56,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:37:56,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:37:56,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:37:56,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:37:56,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:37:56,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:37:56,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:37:56,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:37:56,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:37:56,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:37:56,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:37:56,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:37:56,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:37:56,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:37:56,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:37:56,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:37:56,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:37:56,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:37:56,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:37:56,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:37:56,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:37:56,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:37:56,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,596 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 03:37:56,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,600 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:37:56,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:37:56,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:37:56,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:37:56,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:37:56,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:37:56,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:37:56,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:37:56,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:56,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:56,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:56,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:56,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:56,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:37:56,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:37:56,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:37:56,684 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:37:56,684 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 03:37:56,686 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:37:56,687 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:37:56,687 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:37:56,688 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1 Supporting invariants [] [2018-11-23 03:37:56,715 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 03:37:56,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:37:56,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:37:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:37:56,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:37:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:37:56,786 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:37:56,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 03:37:56,808 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. [2018-11-23 03:37:56,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:37:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:37:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 03:37:56,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 03:37:56,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:37:56,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 03:37:56,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:37:56,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 03:37:56,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:37:56,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 03:37:56,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:37:56,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 03:37:56,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 03:37:56,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:37:56,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 03:37:56,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:37:56,813 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:37:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 03:37:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 03:37:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 03:37:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 03:37:56,815 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:37:56,815 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:37:56,815 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:37:56,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 03:37:56,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:37:56,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:37:56,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:37:56,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:37:56,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:37:56,816 INFO L794 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.alloc(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.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 189#L372-5 [2018-11-23 03:37:56,816 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 184#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 189#L372-5 [2018-11-23 03:37:56,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 03:37:56,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:56,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:56,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:56,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:56,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:56,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 03:37:56,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:56,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:56,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:56,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:56,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 03:37:56,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:56,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:57,159 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-11-23 03:37:57,243 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:37:57,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:37:57,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:37:57,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:37:57,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:37:57,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:37:57,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:37:57,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:37:57,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 03:37:57,244 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:37:57,244 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:37:57,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,426 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-11-23 03:37:57,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:57,851 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 03:37:57,876 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:37:57,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:37:57,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:37:57,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:37:57,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:37:57,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:37:57,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:37:57,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:37:57,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:37:57,900 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:37:57,910 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:37:57,910 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:37:57,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:37:57,911 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 03:37:57,911 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:37:57,911 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, ULTIMATE.start_main_~length2~0) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [1*ULTIMATE.start_main_~length2~0 - 1 >= 0] [2018-11-23 03:37:57,949 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-23 03:37:57,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:37:57,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:37:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:37:57,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:37:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:37:57,997 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:37:57,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 03:37:58,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 03:37:58,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:37:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:37:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:37:58,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:37:58,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:37:58,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 03:37:58,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:37:58,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 03:37:58,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:37:58,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 03:37:58,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:37:58,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 03:37:58,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 03:37:58,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 03:37:58,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 03:37:58,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:37:58,030 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 03:37:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 03:37:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 03:37:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:37:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 03:37:58,032 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 03:37:58,032 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 03:37:58,032 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:37:58,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 03:37:58,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:37:58,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:37:58,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:37:58,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:37:58,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:37:58,034 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 365#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; 366#L382 assume !(main_~length1~0 < 1); 367#L382-2 assume !(main_~length2~0 < 1); 364#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(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.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 360#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 361#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 374#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 370#L372-1 assume !cstrcspn_#t~short210; 371#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 356#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 357#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 358#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 359#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 363#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 373#L372-5 [2018-11-23 03:37:58,034 INFO L796 eck$LassoCheckResult]: Loop: 373#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 368#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 369#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 373#L372-5 [2018-11-23 03:37:58,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 03:37:58,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:58,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 03:37:58,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:58,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:58,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-11-23 03:37:58,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:58,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:37:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:37:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:37:58,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:37:58,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87b834dd-bd13-4112-9902-7e9a7862481d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:37:58,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:37:58,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:37:58,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 03:37:58,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 03:37:58,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:37:58,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-23 03:37:58,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2018-11-23 03:37:58,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:37:58,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 03:37:58,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 03:37:58,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:37:58,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:37:58,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 03:37:58,241 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2018-11-23 03:37:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:37:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:37:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-11-23 03:37:58,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:37:58,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:37:58,455 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-23 03:37:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:37:58,594 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-23 03:37:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:37:58,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-11-23 03:37:58,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:37:58,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-11-23 03:37:58,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 03:37:58,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 03:37:58,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-23 03:37:58,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:37:58,600 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 03:37:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-23 03:37:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-23 03:37:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:37:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-23 03:37:58,603 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 03:37:58,603 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 03:37:58,603 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:37:58,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-23 03:37:58,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:37:58,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:37:58,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:37:58,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:37:58,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:37:58,604 INFO L794 eck$LassoCheckResult]: Stem: 528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 521#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; 522#L382 assume !(main_~length1~0 < 1); 523#L382-2 assume !(main_~length2~0 < 1); 520#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(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.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 516#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 517#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 536#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 526#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 527#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 512#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 513#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 514#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 515#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 519#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 529#L372-5 [2018-11-23 03:37:58,604 INFO L796 eck$LassoCheckResult]: Loop: 529#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 524#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 525#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 529#L372-5 [2018-11-23 03:37:58,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 03:37:58,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:58,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:37:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 03:37:58,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:58,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:58,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:37:58,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:37:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 03:37:58,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:37:58,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:37:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:37:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:37:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:37:59,100 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 129 [2018-11-23 03:37:59,560 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 105 [2018-11-23 03:37:59,561 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:37:59,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:37:59,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:37:59,562 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:37:59,562 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:37:59,562 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:37:59,562 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:37:59,562 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:37:59,562 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 03:37:59,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:37:59,562 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:37:59,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:37:59,683 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 03:38:00,032 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2018-11-23 03:38:00,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:38:00,657 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-23 03:38:00,828 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:38:00,828 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:38:00,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:38:00,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:38:00,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:38:00,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:38:00,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:38:00,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:38:00,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:38:00,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:38:00,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:38:00,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:38:00,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:38:00,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:38:00,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:38:00,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:38:00,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:38:00,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:38:00,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:38:00,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:38:00,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:38:00,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:38:00,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:38:00,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,846 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:38:00,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,847 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:38:00,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:38:00,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:38:00,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:38:00,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:38:00,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,863 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-11-23 03:38:00,863 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 03:38:00,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,888 INFO L402 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2018-11-23 03:38:00,888 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 03:38:00,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,982 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:38:00,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,984 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:38:00,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:00,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:38:00,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:38:00,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:38:00,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:38:00,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:38:00,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:38:00,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:38:00,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:38:01,003 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:38:01,012 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:38:01,012 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 03:38:01,012 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:38:01,013 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:38:01,013 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:38:01,013 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 03:38:01,117 INFO L297 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2018-11-23 03:38:01,121 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:38:01,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:38:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:01,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:01,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:38:01,200 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:38:01,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:38:01,237 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-11-23 03:38:01,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:38:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:38:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:38:01,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:38:01,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:38:01,239 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:38:01,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:38:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:01,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:01,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:38:01,311 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:38:01,311 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:38:01,342 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-11-23 03:38:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:38:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:38:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:38:01,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:38:01,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:38:01,344 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:38:01,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:38:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:01,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:01,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:38:01,413 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:38:01,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:38:01,447 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2018-11-23 03:38:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:38:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:38:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 03:38:01,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:38:01,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:38:01,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 03:38:01,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:38:01,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 03:38:01,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:38:01,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-23 03:38:01,451 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:38:01,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-23 03:38:01,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:38:01,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:38:01,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:38:01,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:38:01,452 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:38:01,452 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:38:01,452 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:38:01,452 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:38:01,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:38:01,452 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:38:01,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:38:01,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:38:01 BoogieIcfgContainer [2018-11-23 03:38:01,457 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:38:01,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:38:01,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:38:01,458 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:38:01,458 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:37:54" (3/4) ... [2018-11-23 03:38:01,461 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:38:01,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:38:01,461 INFO L168 Benchmark]: Toolchain (without parser) took 7296.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.1 MB). Free memory was 955.5 MB in the beginning and 1.0 GB in the end (delta: -60.2 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:01,462 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:38:01,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:01,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.80 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. [2018-11-23 03:38:01,463 INFO L168 Benchmark]: Boogie Preprocessor took 20.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:38:01,463 INFO L168 Benchmark]: RCFGBuilder took 208.41 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. [2018-11-23 03:38:01,463 INFO L168 Benchmark]: BuchiAutomizer took 6656.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.9 MB). Peak memory consumption was 169.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:01,464 INFO L168 Benchmark]: Witness Printer took 2.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:38:01,466 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.80 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 20.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 208.41 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 6656.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.9 MB). Peak memory consumption was 169.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 * 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 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + length2 and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 107 SDtfs, 170 SDslu, 102 SDs, 0 SdLazy, 138 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital361 mio100 ax100 hnf99 lsp92 ukn73 mio100 lsp40 div115 bol100 ite100 ukn100 eq183 hnf83 smp91 dnf870 smp24 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 118ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 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...