./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_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_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/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 c9cfd4c0ab406cfeab77b774b2e25db3fba848a9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:44:04,648 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:44:04,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:44:04,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:44:04,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:44:04,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:44:04,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:44:04,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:44:04,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:44:04,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:44:04,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:44:04,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:44:04,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:44:04,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:44:04,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:44:04,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:44:04,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:44:04,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:44:04,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:44:04,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:44:04,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:44:04,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:44:04,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:44:04,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:44:04,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:44:04,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:44:04,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:44:04,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:44:04,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:44:04,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:44:04,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:44:04,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:44:04,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:44:04,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:44:04,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:44:04,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:44:04,677 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:44:04,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:44:04,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:44:04,689 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:44:04,689 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:44:04,689 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:44:04,689 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:44:04,689 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:44:04,690 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:44:04,690 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:44:04,690 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:44:04,690 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:44:04,690 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:44:04,690 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:44:04,690 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:44:04,691 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:44:04,691 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:44:04,691 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:44:04,691 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:44:04,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:44:04,691 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:44:04,691 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:44:04,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:44:04,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:44:04,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:44:04,692 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:44:04,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:44:04,692 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:44:04,692 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:44:04,693 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:44:04,693 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_4b3266e9-6056-424f-bfbf-ed662d364dd1/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 -> c9cfd4c0ab406cfeab77b774b2e25db3fba848a9 [2018-11-23 15:44:04,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:44:04,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:44:04,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:44:04,726 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:44:04,726 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:44:04,727 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-23 15:44:04,762 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/data/ab1e931cd/07aeb4ae9a294adcbe51c642bd541963/FLAG32f3f9633 [2018-11-23 15:44:05,106 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:44:05,107 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-23 15:44:05,113 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/data/ab1e931cd/07aeb4ae9a294adcbe51c642bd541963/FLAG32f3f9633 [2018-11-23 15:44:05,122 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/bin-2019/uautomizer/data/ab1e931cd/07aeb4ae9a294adcbe51c642bd541963 [2018-11-23 15:44:05,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:44:05,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:44:05,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:44:05,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:44:05,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:44:05,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28603259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05, skipping insertion in model container [2018-11-23 15:44:05,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:44:05,166 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:44:05,373 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:44:05,380 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:44:05,458 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:44:05,499 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:44:05,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05 WrapperNode [2018-11-23 15:44:05,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:44:05,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:44:05,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:44:05,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:44:05,507 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:44:05" (1/1) ... [2018-11-23 15:44:05,515 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:44:05" (1/1) ... [2018-11-23 15:44:05,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:44:05,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:44:05,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:44:05,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:44:05,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (1/1) ... [2018-11-23 15:44:05,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:44:05,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:44:05,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:44:05,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:44:05,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b3266e9-6056-424f-bfbf-ed662d364dd1/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 15:44:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:44:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:44:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:44:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:44:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:44:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:44:05,731 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:44:05,731 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 15:44:05,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:44:05 BoogieIcfgContainer [2018-11-23 15:44:05,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:44:05,732 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:44:05,732 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:44:05,735 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:44:05,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:44:05,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:44:05" (1/3) ... [2018-11-23 15:44:05,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42b6fd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:44:05, skipping insertion in model container [2018-11-23 15:44:05,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:44:05,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:05" (2/3) ... [2018-11-23 15:44:05,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42b6fd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:44:05, skipping insertion in model container [2018-11-23 15:44:05,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:44:05,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:44:05" (3/3) ... [2018-11-23 15:44:05,739 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-23 15:44:05,776 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:44:05,777 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:44:05,777 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:44:05,777 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:44:05,777 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:44:05,777 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:44:05,777 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:44:05,778 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:44:05,778 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:44:05,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 15:44:05,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 15:44:05,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:44:05,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:44:05,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:44:05,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:44:05,806 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:44:05,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 15:44:05,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 15:44:05,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:44:05,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:44:05,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:44:05,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:44:05,812 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.base, main_#t~ret217.offset, 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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2018-11-23 15:44:05,812 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-11-23 15:44:05,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:05,817 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 15:44:05,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:05,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:05,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:05,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:05,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:05,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:05,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 15:44:05,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:05,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:05,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:05,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:05,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:05,936 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 15:44:05,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:44:05,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:44:05,940 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:44:05,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:44:05,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:44:05,950 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 15:44:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:44:05,955 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 15:44:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:44:05,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 15:44:05,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 15:44:05,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 15:44:05,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 15:44:05,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 15:44:05,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 15:44:05,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:44:05,963 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 15:44:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 15:44:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 15:44:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 15:44:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 15:44:05,983 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 15:44:05,984 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 15:44:05,984 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:44:05,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 15:44:05,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 15:44:05,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:44:05,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:44:05,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:44:05,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:44:05,985 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.base, main_#t~ret217.offset, 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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 47#L369-4 [2018-11-23 15:44:05,986 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2018-11-23 15:44:05,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 15:44:05,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:05,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:05,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:06,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 15:44:06,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:06,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:06,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:06,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:44:06,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:06,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 15:44:06,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:06,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:06,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:06,254 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 15:44:06,493 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 15:44:06,662 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 15:44:06,737 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:44:06,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:44:06,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:44:06,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:44:06,738 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:44:06,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:44:06,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:44:06,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:44:06,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 15:44:06,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:44:06,739 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:44:06,757 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 15:44:06,766 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 15:44:06,767 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 15:44:06,768 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 15:44:06,771 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 15:44:06,772 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 15:44:06,773 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 15:44:06,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 15:44:06,776 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 15:44:06,778 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 15:44:06,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 15:44:06,781 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 15:44:06,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 15:44:06,787 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 15:44:06,789 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 15:44:06,795 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 15:44:06,797 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 15:44:06,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:06,800 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 15:44:07,046 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 15:44:07,427 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:44:07,431 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:44:07,432 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 15:44:07,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:44:07,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:44:07,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:44:07,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:07,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:07,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,450 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 15:44:07,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,453 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 15:44:07,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,455 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 15:44:07,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:07,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:07,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,463 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 15:44:07,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,465 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 15:44:07,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:44:07,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,471 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 15:44:07,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,473 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 15:44:07,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,477 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 15:44:07,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,479 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 15:44:07,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,481 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 15:44:07,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,487 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 15:44:07,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:44:07,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,491 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 15:44:07,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,494 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 15:44:07,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,497 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:44:07,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,500 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:44:07,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:07,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,514 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 15:44:07,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:07,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:07,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,520 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 15:44:07,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:07,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,525 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 15:44:07,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:07,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,528 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:44:07,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,529 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:44:07,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:07,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:07,536 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 15:44:07,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:07,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:07,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:07,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:07,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:07,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:07,572 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:44:07,590 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 15:44:07,590 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:44:07,592 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:44:07,594 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:44:07,594 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:44:07,594 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2018-11-23 15:44:07,635 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-23 15:44:07,640 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:44:07,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:07,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:07,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:07,697 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 15:44:07,700 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 15:44:07,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 15:44:07,748 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 15:44:07,748 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 15:44:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:44:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 15:44:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 15:44:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 15:44:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 15:44:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:07,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 15:44:07,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:44:07,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 15:44:07,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 15:44:07,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:44:07,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 15:44:07,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:44:07,753 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 15:44:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 15:44:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 15:44:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 15:44:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 15:44:07,755 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 15:44:07,755 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 15:44:07,755 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:44:07,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 15:44:07,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:44:07,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:44:07,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:44:07,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:44:07,756 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:44:07,756 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#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.base, main_#t~ret217.offset, 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; 183#L382 assume !(main_~length1~0 < 1); 184#L382-2 assume !(main_~length2~0 < 1); 181#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 178#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 180#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 190#L372-5 [2018-11-23 15:44:07,756 INFO L796 eck$LassoCheckResult]: Loop: 190#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 185#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 186#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 190#L372-5 [2018-11-23 15:44:07,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 15:44:07,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:07,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:07,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:07,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 15:44:07,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:07,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:07,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:07,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:07,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:07,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 15:44:07,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:07,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:07,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:08,121 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2018-11-23 15:44:08,183 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:44:08,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:44:08,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:44:08,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:44:08,184 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:44:08,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:44:08,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:44:08,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:44:08,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 15:44:08,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:44:08,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:44:08,188 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 15:44:08,190 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 15:44:08,192 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 15:44:08,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:08,199 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 15:44:08,200 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 15:44:08,201 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 15:44:08,202 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 15:44:08,204 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 15:44:08,205 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 15:44:08,206 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 15:44:08,207 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 15:44:08,208 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 15:44:08,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:08,211 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 15:44:08,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:08,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:08,214 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 15:44:08,372 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-23 15:44:08,427 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 15:44:08,428 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 15:44:08,429 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 15:44:08,723 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 15:44:08,806 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:44:08,806 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:44:08,806 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 15:44:08,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,809 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 15:44:08,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,811 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 15:44:08,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:08,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,813 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 15:44:08,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,814 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 15:44:08,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,820 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 15:44:08,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,821 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 15:44:08,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,825 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 15:44:08,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:08,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,827 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 15:44:08,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:08,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,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 15:44:08,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,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 15:44:08,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,837 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 15:44:08,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,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 15:44:08,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,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 15:44:08,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,848 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 15:44:08,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,849 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 15:44:08,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,851 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 15:44:08,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:08,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:08,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:08,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,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 15:44:08,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:08,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,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 15:44:08,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,855 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:44:08,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,857 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:44:08,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,862 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 15:44:08,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:08,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,865 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 15:44:08,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,865 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:44:08,865 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 15:44:08,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,882 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-23 15:44:08,882 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 15:44:08,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,937 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 15:44:08,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,937 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:44:08,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,938 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:44:08,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,943 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 15:44:08,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:08,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:08,947 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 15:44:08,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:08,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:08,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:08,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:08,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:08,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:08,957 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:44:08,968 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 15:44:08,968 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:44:08,969 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:44:08,969 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:44:08,969 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:44:08,969 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 + 2*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-23 15:44:09,019 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 15:44:09,020 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:44:09,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:09,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:09,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:09,069 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 15:44:09,070 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 15:44:09,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 15:44:09,105 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 15:44:09,105 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 15:44:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:44:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 15:44:09,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 15:44:09,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:09,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 15:44:09,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:09,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 15:44:09,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:09,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 15:44:09,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:44:09,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 15:44:09,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 15:44:09,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 15:44:09,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 15:44:09,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:44:09,109 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 15:44:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 15:44:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 15:44:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:44:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 15:44:09,111 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 15:44:09,111 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 15:44:09,111 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:44:09,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 15:44:09,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:44:09,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:44:09,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:44:09,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:44:09,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:44:09,112 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 363#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.base, main_#t~ret217.offset, 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; 364#L382 assume !(main_~length1~0 < 1); 365#L382-2 assume !(main_~length2~0 < 1); 362#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 358#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 359#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 372#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 368#L372-1 assume !cstrpbrk_#t~short210; 369#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 354#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 355#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 356#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 357#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 361#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 371#L372-5 [2018-11-23 15:44:09,112 INFO L796 eck$LassoCheckResult]: Loop: 371#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 366#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 367#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 371#L372-5 [2018-11-23 15:44:09,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:09,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 15:44:09,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:09,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:09,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:09,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:44:09,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:44:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:44:09,161 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:44:09,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:09,161 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 15:44:09,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:09,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:09,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:09,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:09,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:44:09,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:44:09,261 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 15:44:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:44:09,319 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-23 15:44:09,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:44:09,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 15:44:09,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 15:44:09,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-23 15:44:09,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 15:44:09,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 15:44:09,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 15:44:09,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:44:09,322 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 15:44:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 15:44:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 15:44:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 15:44:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 15:44:09,323 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 15:44:09,323 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 15:44:09,323 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:44:09,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 15:44:09,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:44:09,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:44:09,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:44:09,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:44:09,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:44:09,325 INFO L794 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 435#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.base, main_#t~ret217.offset, 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; 436#L382 assume !(main_~length1~0 < 1); 437#L382-2 assume !(main_~length2~0 < 1); 434#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 430#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 431#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 444#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 448#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 447#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 426#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 427#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 428#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 429#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 433#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 443#L372-5 [2018-11-23 15:44:09,325 INFO L796 eck$LassoCheckResult]: Loop: 443#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 439#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 440#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 443#L372-5 [2018-11-23 15:44:09,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 15:44:09,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:44:09,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:09,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 15:44:09,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:09,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:09,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:44:09,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:09,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:09,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 15:44:09,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:44:09,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:44:09,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:44:09,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:09,826 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 130 [2018-11-23 15:44:10,366 WARN L180 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-11-23 15:44:10,368 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:44:10,368 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:44:10,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:44:10,368 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:44:10,368 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:44:10,368 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:44:10,368 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:44:10,368 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:44:10,368 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 15:44:10,368 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:44:10,368 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:44:10,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:10,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:10,377 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 15:44:10,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:10,380 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 15:44:10,381 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 15:44:10,383 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 15:44:10,384 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 15:44:10,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:10,386 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 15:44:10,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:10,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:10,390 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 15:44:10,391 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 15:44:10,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:10,393 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 15:44:10,394 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 15:44:10,543 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 15:44:10,916 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-11-23 15:44:10,983 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 15:44:10,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:44:10,985 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 15:44:11,341 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-23 15:44:11,546 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:44:11,546 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:44:11,546 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 15:44:11,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:44:11,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,549 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 15:44:11,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,550 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 15:44:11,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,551 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 15:44:11,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:11,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,552 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 15:44:11,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,553 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 15:44:11,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,554 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 15:44:11,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,556 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 15:44:11,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,557 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 15:44:11,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:11,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,559 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 15:44:11,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,561 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 15:44:11,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,562 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 15:44:11,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,564 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 15:44:11,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,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 15:44:11,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,567 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 15:44:11,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:44:11,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:44:11,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:44:11,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,568 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 15:44:11,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,569 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-23 15:44:11,569 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 15:44:11,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,586 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-23 15:44:11,587 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 15:44:11,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,693 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 15:44:11,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:11,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,699 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 15:44:11,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,699 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:44:11,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,700 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:44:11,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,705 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 15:44:11,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:11,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,710 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 15:44:11,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:11,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:44:11,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,712 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:44:11,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,713 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:44:11,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,718 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 15:44:11,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:11,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:44:11,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:11,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:44:11,723 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 15:44:11,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:44:11,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:44:11,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:44:11,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:44:11,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:44:11,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:44:11,739 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:44:11,750 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 15:44:11,750 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 15:44:11,751 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:44:11,751 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:44:11,751 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:44:11,752 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 + 2*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-23 15:44:11,859 INFO L297 tatePredicateManager]: 27 out of 29 supporting invariants were superfluous and have been removed [2018-11-23 15:44:11,861 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:44:11,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:11,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:11,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:11,917 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 15:44:11,917 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 15:44:11,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 15:44:11,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 15:44:11,948 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 15:44:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:44:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 15:44:11,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:44:11,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:11,948 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:44:11,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:11,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:12,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:12,017 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 15:44:12,018 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 15:44:12,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 15:44:12,052 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 15:44:12,054 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 15:44:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:44:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 15:44:12,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:44:12,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:12,055 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:44:12,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:12,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:12,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:12,110 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 15:44:12,110 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 15:44:12,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 15:44:12,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-11-23 15:44:12,137 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 15:44:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:44:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 15:44:12,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:44:12,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 15:44:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 15:44:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:44:12,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 15:44:12,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:44:12,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-23 15:44:12,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:44:12,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:44:12,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:44:12,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:44:12,140 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:44:12,140 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:44:12,140 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:44:12,140 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:44:12,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:44:12,141 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:44:12,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:44:12,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:44:12 BoogieIcfgContainer [2018-11-23 15:44:12,149 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:44:12,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:44:12,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:44:12,149 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:44:12,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:44:05" (3/4) ... [2018-11-23 15:44:12,152 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:44:12,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:44:12,152 INFO L168 Benchmark]: Toolchain (without parser) took 7027.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.0 MB). Free memory was 951.1 MB in the beginning and 1.3 GB in the end (delta: -336.8 MB). Peak memory consumption was 73.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:12,153 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:44:12,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -216.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:12,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:12,154 INFO L168 Benchmark]: Boogie Preprocessor took 17.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:44:12,154 INFO L168 Benchmark]: RCFGBuilder took 186.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:12,155 INFO L168 Benchmark]: BuchiAutomizer took 6416.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -144.1 MB). Peak memory consumption was 79.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:12,155 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:44:12,158 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -216.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6416.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -144.1 MB). Peak memory consumption was 79.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s 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 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 130 SDslu, 80 SDs, 0 SdLazy, 113 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital368 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp36 div119 bol100 ite100 ukn100 eq174 hnf82 smp92 dnf624 smp28 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 124ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...