./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strspn_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_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/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 aca5f83919a6623f93755f2c57c9c6598ba71e3b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:49:35,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:49:35,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:49:35,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:49:35,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:49:35,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:49:35,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:49:35,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:49:35,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:49:35,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:49:35,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:49:35,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:49:35,606 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:49:35,607 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:49:35,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:49:35,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:49:35,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:49:35,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:49:35,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:49:35,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:49:35,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:49:35,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:49:35,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:49:35,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:49:35,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:49:35,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:49:35,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:49:35,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:49:35,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:49:35,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:49:35,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:49:35,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:49:35,620 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:49:35,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:49:35,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:49:35,621 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:49:35,622 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 00:49:35,633 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:49:35,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:49:35,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:49:35,634 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:49:35,634 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:49:35,634 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:49:35,634 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:49:35,634 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:49:35,635 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:49:35,635 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:49:35,635 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:49:35,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:49:35,635 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:49:35,635 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:49:35,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:49:35,636 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:49:35,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:49:35,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:49:35,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:49:35,636 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:49:35,636 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:49:35,636 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:49:35,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:49:35,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:49:35,637 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:49:35,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:49:35,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:49:35,637 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:49:35,638 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:49:35,638 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_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/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 -> aca5f83919a6623f93755f2c57c9c6598ba71e3b [2018-11-23 00:49:35,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:49:35,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:49:35,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:49:35,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:49:35,673 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:49:35,674 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-11-23 00:49:35,716 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/data/53399fd1f/9e6e73e0ca4c41e6b8674703654a7e13/FLAG3c17452bd [2018-11-23 00:49:36,137 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:49:36,138 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-11-23 00:49:36,144 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/data/53399fd1f/9e6e73e0ca4c41e6b8674703654a7e13/FLAG3c17452bd [2018-11-23 00:49:36,152 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/bin-2019/uautomizer/data/53399fd1f/9e6e73e0ca4c41e6b8674703654a7e13 [2018-11-23 00:49:36,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:49:36,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:49:36,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:49:36,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:49:36,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:49:36,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190dcc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36, skipping insertion in model container [2018-11-23 00:49:36,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:49:36,192 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:49:36,377 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:49:36,386 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:49:36,465 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:49:36,497 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:49:36,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36 WrapperNode [2018-11-23 00:49:36,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:49:36,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:49:36,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:49:36,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:49:36,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:49:36,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:49:36,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:49:36,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:49:36,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... [2018-11-23 00:49:36,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:49:36,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:49:36,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:49:36,557 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:49:36,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59e80ed6-29cf-4429-ab8f-a3e5fc46835f/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 00:49:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:49:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:49:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:49:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:49:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:49:36,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:49:36,772 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:49:36,772 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 00:49:36,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:36 BoogieIcfgContainer [2018-11-23 00:49:36,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:49:36,773 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:49:36,773 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:49:36,777 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:49:36,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:49:36,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:49:36" (1/3) ... [2018-11-23 00:49:36,778 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e7aad8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:49:36, skipping insertion in model container [2018-11-23 00:49:36,778 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:49:36,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:36" (2/3) ... [2018-11-23 00:49:36,779 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e7aad8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:49:36, skipping insertion in model container [2018-11-23 00:49:36,779 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:49:36,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:36" (3/3) ... [2018-11-23 00:49:36,780 INFO L375 chiAutomizerObserver]: Analyzing ICFG strspn_true-termination.c.i [2018-11-23 00:49:36,817 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:49:36,818 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:49:36,818 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:49:36,818 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:49:36,818 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:49:36,818 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:49:36,818 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:49:36,819 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:49:36,819 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:49:36,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 00:49:36,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 00:49:36,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:36,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:36,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 00:49:36,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:49:36,849 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:49:36,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 00:49:36,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 00:49:36,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:36,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:36,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 00:49:36,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:49:36,856 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 9#L521true assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 6#L525true assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 19#L510-4true [2018-11-23 00:49:36,856 INFO L796 eck$LassoCheckResult]: Loop: 19#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 12#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4#L511-6true assume !true; 5#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 7#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 15#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 19#L510-4true [2018-11-23 00:49:36,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-23 00:49:36,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:36,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:36,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:36,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:36,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1366197546, now seen corresponding path program 1 times [2018-11-23 00:49:36,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:36,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:36,980 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 00:49:36,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:49:36,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:49:36,985 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:49:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:49:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:49:36,996 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 00:49:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:49:37,001 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 00:49:37,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:49:37,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 00:49:37,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 00:49:37,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2018-11-23 00:49:37,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 00:49:37,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 00:49:37,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-23 00:49:37,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:49:37,007 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 00:49:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-23 00:49:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 00:49:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 00:49:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-23 00:49:37,024 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 00:49:37,024 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 00:49:37,025 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:49:37,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-23 00:49:37,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 00:49:37,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:37,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:37,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 00:49:37,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:49:37,026 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 52#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 48#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 49#L510-4 [2018-11-23 00:49:37,026 INFO L796 eck$LassoCheckResult]: Loop: 49#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 55#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 44#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 45#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 53#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 46#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 47#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 50#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 49#L510-4 [2018-11-23 00:49:37,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:37,027 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-23 00:49:37,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:37,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:37,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:37,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1786909933, now seen corresponding path program 1 times [2018-11-23 00:49:37,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:37,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:37,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:49:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:37,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1162005510, now seen corresponding path program 1 times [2018-11-23 00:49:37,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:37,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:37,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:37,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:37,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:37,259 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-23 00:49:37,480 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-11-23 00:49:37,551 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:49:37,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:49:37,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:49:37,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:49:37,552 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:49:37,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:49:37,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:49:37,553 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:49:37,553 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration2_Lasso [2018-11-23 00:49:37,553 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:49:37,553 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:49:37,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,580 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 00:49:37,584 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 00:49:37,818 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 00:49:37,819 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 00:49:37,821 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 00:49:37,822 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 00:49:37,824 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 00:49:37,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,826 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 00:49:37,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,828 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 00:49:37,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,831 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 00:49:37,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:37,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:38,090 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:49:38,095 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:49:38,097 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 00:49:38,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:38,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:38,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:38,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,103 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 00:49:38,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:38,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:38,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:38,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:38,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:38,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:38,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:38,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,108 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 00:49:38,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:38,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:38,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:38,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:38,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:38,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:38,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:38,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,113 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 00:49:38,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:38,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:38,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,119 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 00:49:38,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:38,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,119 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:49:38,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,120 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:38,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:38,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,126 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 00:49:38,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:38,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:38,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,144 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 00:49:38,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:38,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:38,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,148 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 00:49:38,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:38,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:38,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:38,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,153 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 00:49:38,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:38,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:38,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,159 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 00:49:38,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,160 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:38,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,162 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:49:38,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:38,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:38,174 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 00:49:38,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:38,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:38,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:38,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:38,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:38,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:38,200 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:49:38,215 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 00:49:38,216 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 00:49:38,218 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:49:38,219 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:49:38,219 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:49:38,220 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2018-11-23 00:49:38,261 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 00:49:38,267 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:49:38,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:38,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:38,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:38,366 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 00:49:38,369 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 00:49:38,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-23 00:49:38,443 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 5 states. [2018-11-23 00:49:38,444 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 00:49:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 00:49:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 00:49:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-23 00:49:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-23 00:49:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-23 00:49:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:38,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-23 00:49:38,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 00:49:38,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 24 transitions. [2018-11-23 00:49:38,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 00:49:38,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 00:49:38,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-23 00:49:38,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 00:49:38,449 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 00:49:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-23 00:49:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 00:49:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 00:49:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-23 00:49:38,451 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 00:49:38,451 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 00:49:38,451 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:49:38,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-23 00:49:38,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 00:49:38,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:38,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:38,452 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:49:38,452 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 00:49:38,452 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 189#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 185#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 186#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 193#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 179#L511-6 [2018-11-23 00:49:38,453 INFO L796 eck$LassoCheckResult]: Loop: 179#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 180#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 190#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 195#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 179#L511-6 [2018-11-23 00:49:38,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:38,453 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-11-23 00:49:38,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:38,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:38,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:38,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 1 times [2018-11-23 00:49:38,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:38,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:38,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:38,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:38,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:38,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:38,479 INFO L82 PathProgramCache]: Analyzing trace with hash 736220242, now seen corresponding path program 1 times [2018-11-23 00:49:38,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:38,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:38,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:38,768 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-11-23 00:49:38,838 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:49:38,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:49:38,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:49:38,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:49:38,839 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:49:38,839 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:49:38,839 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:49:38,839 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:49:38,839 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration3_Lasso [2018-11-23 00:49:38,839 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:49:38,839 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:49:38,842 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 00:49:38,846 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 00:49:39,083 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 00:49:39,085 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 00:49:39,086 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 00:49:39,087 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 00:49:39,088 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 00:49:39,090 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 00:49:39,090 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 00:49:39,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,096 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 00:49:39,096 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 00:49:39,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:39,393 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:49:39,394 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:49:39,394 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 00:49:39,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:39,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:39,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:39,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:39,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:39,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:39,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:39,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:39,396 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 00:49:39,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:39,400 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:39,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:39,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:39,402 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:49:39,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:39,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:39,409 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 00:49:39,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:39,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:39,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:39,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:39,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:39,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:39,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:39,412 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 00:49:39,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:39,412 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:39,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:39,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:39,414 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:49:39,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:39,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:39,419 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 00:49:39,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:39,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:39,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:39,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:39,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:39,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:39,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:39,422 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 00:49:39,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:39,423 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:39,423 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:39,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:39,431 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-23 00:49:39,432 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 00:49:39,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:39,457 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 00:49:39,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:39,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:39,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:39,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:39,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:39,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:39,475 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:49:39,493 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 00:49:39,493 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 00:49:39,494 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:49:39,494 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:49:39,495 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:49:39,495 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_2) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_2 Supporting invariants [] [2018-11-23 00:49:39,541 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-23 00:49:39,543 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:49:39,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:39,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:39,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:39,582 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 00:49:39,582 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 00:49:39,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 00:49:39,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 48 states and 60 transitions. Complement of second has 5 states. [2018-11-23 00:49:39,605 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 00:49:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:49:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-23 00:49:39,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 00:49:39,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:39,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 00:49:39,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:39,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-23 00:49:39,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:39,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-23 00:49:39,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 00:49:39,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 40 transitions. [2018-11-23 00:49:39,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 00:49:39,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 00:49:39,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-11-23 00:49:39,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 00:49:39,609 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 00:49:39,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-11-23 00:49:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-23 00:49:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 00:49:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-23 00:49:39,611 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-23 00:49:39,612 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-23 00:49:39,612 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 00:49:39,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-23 00:49:39,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 00:49:39,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:39,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:39,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:49:39,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 00:49:39,616 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 371#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 367#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 368#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 377#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 378#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 373#L511-1 assume !strspn_#t~short7; 374#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 365#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 366#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 369#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 380#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 376#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 361#L511-6 [2018-11-23 00:49:39,617 INFO L796 eck$LassoCheckResult]: Loop: 361#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 362#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 372#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 379#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 361#L511-6 [2018-11-23 00:49:39,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1779209729, now seen corresponding path program 1 times [2018-11-23 00:49:39,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:39,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:39,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:39,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:39,655 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 00:49:39,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:49:39,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:49:39,656 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:49:39,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 2 times [2018-11-23 00:49:39,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:39,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:39,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:39,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:39,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:49:39,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:49:39,770 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 00:49:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:49:39,795 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 00:49:39,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:49:39,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-23 00:49:39,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 00:49:39,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 38 transitions. [2018-11-23 00:49:39,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 00:49:39,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 00:49:39,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2018-11-23 00:49:39,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 00:49:39,798 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 00:49:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2018-11-23 00:49:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-23 00:49:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:49:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 00:49:39,801 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 00:49:39,801 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 00:49:39,802 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 00:49:39,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-23 00:49:39,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 00:49:39,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:39,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:39,803 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:49:39,803 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 00:49:39,803 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 441#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 442#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 438#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 439#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 448#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 449#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 457#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 454#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 436#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 437#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 440#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 452#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 447#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 432#L511-6 [2018-11-23 00:49:39,804 INFO L796 eck$LassoCheckResult]: Loop: 432#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 433#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 443#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 450#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 432#L511-6 [2018-11-23 00:49:39,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash 4202367, now seen corresponding path program 2 times [2018-11-23 00:49:39,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:39,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:49:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:39,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 3 times [2018-11-23 00:49:39,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:39,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:39,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:49:39,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:39,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1675488540, now seen corresponding path program 1 times [2018-11-23 00:49:39,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:39,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:39,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:49:39,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:40,400 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 130 [2018-11-23 00:49:40,540 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-23 00:49:40,541 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:49:40,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:49:40,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:49:40,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:49:40,542 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:49:40,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:49:40,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:49:40,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:49:40,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration5_Lasso [2018-11-23 00:49:40,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:49:40,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:49:40,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:40,547 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 00:49:40,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:40,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:40,552 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 00:49:40,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:40,556 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 00:49:40,557 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 00:49:40,559 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 00:49:40,560 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 00:49:40,562 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 00:49:40,563 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 00:49:40,565 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 00:49:40,567 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 00:49:40,845 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 00:49:40,930 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 00:49:40,931 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 00:49:40,932 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 00:49:40,933 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 00:49:40,934 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 00:49:40,935 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 00:49:40,936 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 00:49:41,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:49:41,281 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:49:41,281 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 00:49:41,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,284 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 00:49:41,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,286 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 00:49:41,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:41,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:41,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,288 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 00:49:41,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,290 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 00:49:41,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,291 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 00:49:41,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,293 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 00:49:41,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,295 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 00:49:41,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,296 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 00:49:41,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,298 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 00:49:41,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:41,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:41,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,301 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 00:49:41,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,302 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 00:49:41,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:41,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:41,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:41,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,304 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 00:49:41,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:41,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:41,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,307 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 00:49:41,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:41,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:41,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:41,312 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 00:49:41,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:41,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:41,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:41,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:41,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:41,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:41,335 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:49:41,359 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 00:49:41,359 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 00:49:41,359 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:49:41,360 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:49:41,361 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:49:41,361 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3 Supporting invariants [] [2018-11-23 00:49:41,450 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-23 00:49:41,452 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:49:41,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:41,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:41,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:41,512 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 00:49:41,512 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 00:49:41,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 00:49:41,547 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2018-11-23 00:49:41,548 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 00:49:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 00:49:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 00:49:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 00:49:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:41,549 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 00:49:41,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:41,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:41,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:41,612 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 00:49:41,612 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 00:49:41,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 00:49:41,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2018-11-23 00:49:41,641 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 00:49:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 00:49:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 00:49:41,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 00:49:41,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:41,642 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 00:49:41,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:41,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:41,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:41,707 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 00:49:41,707 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 00:49:41,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 00:49:41,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 57 transitions. Complement of second has 5 states. [2018-11-23 00:49:41,742 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 00:49:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 00:49:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-23 00:49:41,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 00:49:41,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:41,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-23 00:49:41,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:41,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-23 00:49:41,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:41,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-11-23 00:49:41,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:49:41,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2018-11-23 00:49:41,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 00:49:41,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 00:49:41,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 00:49:41,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:49:41,747 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:49:41,747 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:49:41,747 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:49:41,747 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 00:49:41,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:49:41,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:49:41,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 00:49:41,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:49:41 BoogieIcfgContainer [2018-11-23 00:49:41,753 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:49:41,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:49:41,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:49:41,754 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:49:41,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:36" (3/4) ... [2018-11-23 00:49:41,759 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:49:41,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:49:41,760 INFO L168 Benchmark]: Toolchain (without parser) took 5605.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 957.1 MB in the beginning and 889.1 MB in the end (delta: 68.0 MB). Peak memory consumption was 416.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:41,761 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:49:41,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -198.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:41,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.77 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:41,763 INFO L168 Benchmark]: Boogie Preprocessor took 22.21 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 00:49:41,763 INFO L168 Benchmark]: RCFGBuilder took 215.46 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:41,763 INFO L168 Benchmark]: BuchiAutomizer took 4980.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 889.1 MB in the end (delta: 239.2 MB). Peak memory consumption was 419.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:41,764 INFO L168 Benchmark]: Witness Printer took 5.24 ms. Allocated memory is still 1.4 GB. Free memory is still 889.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:49:41,767 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -198.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.77 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.21 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 215.46 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4980.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 889.1 MB in the end (delta: 239.2 MB). Peak memory consumption was 419.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.24 ms. Allocated memory is still 1.4 GB. Free memory is still 889.1 MB. 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 (in_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] and consists of 3 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. 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, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 101 SDtfs, 128 SDslu, 44 SDs, 0 SdLazy, 78 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax100 hnf99 lsp94 ukn80 mio100 lsp40 div100 bol100 ite100 ukn100 eq186 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...