./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:11:29,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:11:29,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:11:29,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:11:29,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:11:29,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:11:29,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:11:29,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:11:29,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:11:29,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:11:29,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:11:29,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:11:29,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:11:29,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:11:29,618 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:11:29,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:11:29,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:11:29,621 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:11:29,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:11:29,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:11:29,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:11:29,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:11:29,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:11:29,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:11:29,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:11:29,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:11:29,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:11:29,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:11:29,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:11:29,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:11:29,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:11:29,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:11:29,634 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:11:29,634 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:11:29,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:11:29,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:11:29,635 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 15:11:29,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:11:29,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:11:29,648 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:11:29,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:11:29,648 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:11:29,648 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:11:29,649 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:11:29,649 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:11:29,649 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:11:29,649 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:11:29,650 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:11:29,650 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:11:29,650 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:11:29,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:11:29,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:11:29,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:11:29,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:11:29,651 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:11:29,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:11:29,651 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:11:29,651 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:11:29,651 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:11:29,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:11:29,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:11:29,651 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:11:29,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:11:29,652 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:11:29,652 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:11:29,653 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:11:29,653 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_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b [2018-11-18 15:11:29,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:11:29,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:11:29,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:11:29,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:11:29,692 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:11:29,692 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2018-11-18 15:11:29,740 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/data/293e3b000/b1b127a4d5454d458725c261c8c4b7f7/FLAGc13e4492f [2018-11-18 15:11:30,118 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:11:30,119 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2018-11-18 15:11:30,128 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/data/293e3b000/b1b127a4d5454d458725c261c8c4b7f7/FLAGc13e4492f [2018-11-18 15:11:30,504 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/data/293e3b000/b1b127a4d5454d458725c261c8c4b7f7 [2018-11-18 15:11:30,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:11:30,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:11:30,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:11:30,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:11:30,513 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:11:30,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af4c8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30, skipping insertion in model container [2018-11-18 15:11:30,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:11:30,558 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:11:30,784 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:11:30,793 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:11:30,831 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:11:30,917 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:11:30,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30 WrapperNode [2018-11-18 15:11:30,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:11:30,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:11:30,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:11:30,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:11:30,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:11:30,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:11:30,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:11:30,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:11:30,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... [2018-11-18 15:11:30,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:11:30,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:11:30,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:11:30,967 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:11:30,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/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-18 15:11:31,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:11:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:11:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:11:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:11:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:11:31,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:11:31,199 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:11:31,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:11:31 BoogieIcfgContainer [2018-11-18 15:11:31,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:11:31,199 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:11:31,200 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:11:31,203 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:11:31,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:11:31,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:11:30" (1/3) ... [2018-11-18 15:11:31,205 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c1babc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:11:31, skipping insertion in model container [2018-11-18 15:11:31,205 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:11:31,205 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:11:30" (2/3) ... [2018-11-18 15:11:31,205 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c1babc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:11:31, skipping insertion in model container [2018-11-18 15:11:31,205 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:11:31,206 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:11:31" (3/3) ... [2018-11-18 15:11:31,207 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca_true-termination.c.i [2018-11-18 15:11:31,243 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:11:31,243 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:11:31,243 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:11:31,243 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:11:31,244 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:11:31,244 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:11:31,244 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:11:31,244 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:11:31,244 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:11:31,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 15:11:31,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:11:31,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:11:31,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:11:31,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:11:31,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:11:31,278 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:11:31,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 15:11:31,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:11:31,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:11:31,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:11:31,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:11:31,280 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:11:31,285 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 13#L382true assume !(main_~length1~0 < 1); 17#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2018-11-18 15:11:31,285 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 19#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 4#L372-6true assume !true; 7#L372-7true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 9#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-11-18 15:11:31,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 15:11:31,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:31,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:31,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:31,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1454947914, now seen corresponding path program 1 times [2018-11-18 15:11:31,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:31,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:31,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:31,428 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-18 15:11:31,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:11:31,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:11:31,434 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:11:31,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:11:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:11:31,447 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 15:11:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:31,452 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-18 15:11:31,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:11:31,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-18 15:11:31,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:11:31,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 18 transitions. [2018-11-18 15:11:31,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 15:11:31,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 15:11:31,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2018-11-18 15:11:31,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:11:31,462 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:11:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2018-11-18 15:11:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 15:11:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 15:11:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-18 15:11:31,482 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:11:31,483 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:11:31,483 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:11:31,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-18 15:11:31,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:11:31,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:11:31,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:11:31,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:11:31,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:31,485 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 54#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 55#L382 assume !(main_~length1~0 < 1); 56#L382-2 assume !(main_~length2~0 < 1); 53#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 49#L369-4 [2018-11-18 15:11:31,485 INFO L796 eck$LassoCheckResult]: Loop: 49#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 50#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 46#L372-6 assume true; 47#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 57#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 59#L372-4 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 51#L372-7 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 52#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 48#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 49#L369-4 [2018-11-18 15:11:31,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 15:11:31,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:31,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:31,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:31,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:31,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:31,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1329778143, now seen corresponding path program 1 times [2018-11-18 15:11:31,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:31,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:31,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:11:31,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:31,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash 152793724, now seen corresponding path program 1 times [2018-11-18 15:11:31,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:31,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:31,754 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 15:11:31,903 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-18 15:11:32,065 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-18 15:11:32,145 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:11:32,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:11:32,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:11:32,146 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:11:32,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:11:32,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:11:32,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:11:32,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:11:32,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 15:11:32,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:11:32,148 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:11:32,168 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-18 15:11:32,172 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-18 15:11:32,175 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-18 15:11:32,177 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-18 15:11:32,179 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-18 15:11:32,181 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-18 15:11:32,183 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-18 15:11:32,191 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-18 15:11:32,469 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-18 15:11:32,470 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-18 15:11:32,471 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-18 15:11:32,473 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-18 15:11:32,474 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-18 15:11:32,475 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-18 15:11:32,477 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-18 15:11:32,478 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-18 15:11:32,480 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-18 15:11:32,481 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-18 15:11:32,826 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-18 15:11:32,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:11:32,952 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:11:32,953 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-18 15:11:32,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:32,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:32,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:32,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:32,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:32,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:32,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,966 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-18 15:11:32,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:32,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:32,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:32,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,968 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-18 15:11:32,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:32,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:32,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,973 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-18 15:11:32,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:32,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:32,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:32,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,976 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-18 15:11:32,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:32,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:32,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:32,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,979 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-18 15:11:32,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:32,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:32,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:32,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:32,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:32,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:32,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:32,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:32,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:32,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:32,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:32,994 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-18 15:11:32,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:32,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:32,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:32,995 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 15:11:32,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:32,997 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:11:32,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:33,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:33,011 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-18 15:11:33,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:33,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:33,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:33,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:33,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:33,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:33,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:33,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:33,014 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-18 15:11:33,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:33,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:33,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:33,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:33,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:33,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:33,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:33,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:33,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:33,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:33,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:33,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:33,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:33,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:33,059 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:11:33,076 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 15:11:33,077 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 15:11:33,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:11:33,080 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:11:33,080 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:11:33,080 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1 Supporting invariants [] [2018-11-18 15:11:33,124 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 15:11:33,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:33,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:33,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:33,188 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-18 15:11:33,191 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-18 15:11:33,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 15:11:33,223 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 4 states. [2018-11-18 15:11:33,223 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-18 15:11:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 15:11:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-18 15:11:33,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 15:11:33,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:33,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 15:11:33,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:33,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 15:11:33,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:33,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-18 15:11:33,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:11:33,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-11-18 15:11:33,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 15:11:33,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 15:11:33,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-18 15:11:33,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:11:33,229 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 15:11:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-18 15:11:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 15:11:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 15:11:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-18 15:11:33,231 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 15:11:33,231 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 15:11:33,231 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:11:33,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-18 15:11:33,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:11:33,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:11:33,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:11:33,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:33,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:11:33,232 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 194#L382 assume !(main_~length1~0 < 1); 195#L382-2 assume !(main_~length2~0 < 1); 192#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 187#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 189#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 181#L372-6 [2018-11-18 15:11:33,232 INFO L796 eck$LassoCheckResult]: Loop: 181#L372-6 assume true; 182#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 196#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 199#L372-4 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 181#L372-6 [2018-11-18 15:11:33,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-18 15:11:33,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:33,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:33,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 1 times [2018-11-18 15:11:33,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:33,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:33,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:33,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2145109973, now seen corresponding path program 1 times [2018-11-18 15:11:33,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:33,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:33,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:33,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:33,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:33,570 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-11-18 15:11:33,634 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:11:33,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:11:33,634 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:11:33,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:11:33,635 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:11:33,635 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:11:33,635 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:11:33,635 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:11:33,635 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 15:11:33,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:11:33,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:11:33,638 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-18 15:11:33,828 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-11-18 15:11:33,887 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-18 15:11:33,888 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-18 15:11:33,889 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-18 15:11:33,890 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-18 15:11:33,891 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-18 15:11:33,892 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-18 15:11:33,893 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-18 15:11:33,894 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-18 15:11:33,895 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-18 15:11:33,896 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-18 15:11:33,897 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-18 15:11:33,898 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-18 15:11:33,898 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-18 15:11:33,899 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-18 15:11:33,900 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-18 15:11:33,901 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-18 15:11:33,902 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-18 15:11:34,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:11:34,295 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:11:34,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-18 15:11:34,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:34,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:34,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:34,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:34,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:34,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:34,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:11:34,338 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:11:34,338 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 15:11:34,338 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:11:34,340 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 15:11:34,340 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:11:34,340 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, ULTIMATE.start_main_~length2~0) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [1*ULTIMATE.start_main_~length2~0 - 1 >= 0] [2018-11-18 15:11:34,381 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-18 15:11:34,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:34,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:34,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:34,445 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-18 15:11:34,445 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-18 15:11:34,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 15:11:34,499 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 49 states and 63 transitions. Complement of second has 8 states. [2018-11-18 15:11:34,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:11:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:11:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 15:11:34,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 15:11:34,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:34,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-18 15:11:34,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:34,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-18 15:11:34,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:34,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2018-11-18 15:11:34,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:11:34,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 44 transitions. [2018-11-18 15:11:34,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 15:11:34,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 15:11:34,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-18 15:11:34,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:11:34,504 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-18 15:11:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-18 15:11:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-18 15:11:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 15:11:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 15:11:34,506 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 15:11:34,506 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 15:11:34,506 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:11:34,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-18 15:11:34,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:11:34,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:11:34,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:11:34,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:34,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:11:34,508 INFO L794 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 392#L382 assume !(main_~length1~0 < 1); 393#L382-2 assume !(main_~length2~0 < 1); 390#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 384#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 385#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 400#L372-6 assume true; 403#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 402#L372-2 assume !cstrcspn_#t~short210; 401#L372-4 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 388#L372-7 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 389#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 382#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 383#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 387#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 378#L372-6 [2018-11-18 15:11:34,508 INFO L796 eck$LassoCheckResult]: Loop: 378#L372-6 assume true; 379#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 394#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 398#L372-4 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 378#L372-6 [2018-11-18 15:11:34,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1714078621, now seen corresponding path program 1 times [2018-11-18 15:11:34,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:34,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:34,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:34,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:34,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 2 times [2018-11-18 15:11:34,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:34,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:34,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash -94928371, now seen corresponding path program 1 times [2018-11-18 15:11:34,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:34,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:34,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:34,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:11:34,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:11:34,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:34,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d75d2c77-9c2b-45fa-bf69-ffedaabab8dc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:11:34,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:34,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:34,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:11:34,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 15:11:34,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:11:34,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 15:11:34,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2018-11-18 15:11:34,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:11:34,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 15:11:34,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:11:34,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:11:34,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:11:34,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 15:11:34,718 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2018-11-18 15:11:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:11:34,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:11:34,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-11-18 15:11:34,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:11:34,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:11:34,972 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-18 15:11:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:35,118 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2018-11-18 15:11:35,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:11:35,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 82 transitions. [2018-11-18 15:11:35,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:11:35,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 51 states and 61 transitions. [2018-11-18 15:11:35,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 15:11:35,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 15:11:35,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2018-11-18 15:11:35,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:11:35,122 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-11-18 15:11:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2018-11-18 15:11:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-11-18 15:11:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 15:11:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-18 15:11:35,126 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 15:11:35,126 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 15:11:35,126 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:11:35,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-18 15:11:35,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:11:35,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:11:35,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:11:35,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:35,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:11:35,129 INFO L794 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 568#L382 assume !(main_~length1~0 < 1); 569#L382-2 assume !(main_~length2~0 < 1); 566#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 562#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 563#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 581#L372-6 assume true; 582#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 574#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 575#L372-4 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 560#L372-7 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 561#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 558#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 559#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 565#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 554#L372-6 [2018-11-18 15:11:35,129 INFO L796 eck$LassoCheckResult]: Loop: 554#L372-6 assume true; 555#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 570#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 573#L372-4 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 554#L372-6 [2018-11-18 15:11:35,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash 805881313, now seen corresponding path program 2 times [2018-11-18 15:11:35,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:35,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:35,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:35,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:35,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:35,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:35,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 3 times [2018-11-18 15:11:35,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:35,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:35,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:35,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:11:35,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:35,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash -795992949, now seen corresponding path program 1 times [2018-11-18 15:11:35,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:11:35,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:11:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:35,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:11:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:11:35,644 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 129 [2018-11-18 15:11:36,172 WARN L180 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 105 [2018-11-18 15:11:36,174 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:11:36,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:11:36,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:11:36,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:11:36,174 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:11:36,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:11:36,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:11:36,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:11:36,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 15:11:36,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:11:36,175 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:11:36,179 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-18 15:11:36,187 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-18 15:11:36,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:11:36,189 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-18 15:11:36,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:11:36,191 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-18 15:11:36,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:11:36,194 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-18 15:11:36,196 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-18 15:11:36,310 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:11:36,665 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2018-11-18 15:11:36,737 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-18 15:11:36,739 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-18 15:11:36,739 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-18 15:11:36,740 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-18 15:11:36,741 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-18 15:11:36,742 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-18 15:11:36,743 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-18 15:11:36,745 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-18 15:11:36,746 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-18 15:11:37,311 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-18 15:11:37,417 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-18 15:11:37,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:11:37,506 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:11:37,506 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-18 15:11:37,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:37,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:37,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:37,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,509 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-18 15:11:37,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:37,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:37,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:37,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,510 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-18 15:11:37,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:37,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:37,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:37,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:37,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:37,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,522 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-18 15:11:37,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:37,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:37,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:37,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,523 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-18 15:11:37,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:37,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:37,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:37,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:37,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:11:37,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:11:37,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:11:37,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,527 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-18 15:11:37,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:37,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,530 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-18 15:11:37,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:37,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,539 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-18 15:11:37,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,539 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:11:37,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,541 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:11:37,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:37,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:37,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:37,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:37,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:37,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:37,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:37,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:37,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:37,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,557 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-11-18 15:11:37,557 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-18 15:11:37,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,587 INFO L402 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2018-11-18 15:11:37,587 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-18 15:11:37,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,726 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-18 15:11:37,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,727 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:11:37,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,728 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:11:37,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:11:37,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:11:37,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:11:37,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:11:37,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:11:37,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:11:37,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:11:37,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:11:37,746 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:11:37,750 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:11:37,751 INFO L444 ModelExtractionUtils]: 46 out of 49 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 15:11:37,751 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:11:37,752 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:11:37,752 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:11:37,752 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2018-11-18 15:11:37,844 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 15:11:37,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:37,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:37,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:37,893 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-18 15:11:37,893 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-18 15:11:37,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 15:11:37,918 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 55 states and 67 transitions. Complement of second has 7 states. [2018-11-18 15:11:37,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:11:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:11:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 15:11:37,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 15:11:37,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:37,920 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:11:37,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:37,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:37,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:37,966 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-18 15:11:37,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 15:11:37,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 15:11:37,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 55 states and 67 transitions. Complement of second has 7 states. [2018-11-18 15:11:37,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:11:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:11:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 15:11:37,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 15:11:37,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:37,991 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:11:38,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:38,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:38,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:38,042 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-18 15:11:38,042 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 15:11:38,042 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 15:11:38,068 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 57 states and 72 transitions. Complement of second has 6 states. [2018-11-18 15:11:38,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:11:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:11:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-18 15:11:38,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 15:11:38,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:38,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 15:11:38,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:38,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 15:11:38,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:11:38,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2018-11-18 15:11:38,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:11:38,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 0 states and 0 transitions. [2018-11-18 15:11:38,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:11:38,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:11:38,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:11:38,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:11:38,075 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:11:38,075 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:11:38,075 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:11:38,075 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:11:38,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:11:38,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:11:38,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:11:38,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:11:38 BoogieIcfgContainer [2018-11-18 15:11:38,086 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:11:38,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:11:38,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:11:38,086 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:11:38,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:11:31" (3/4) ... [2018-11-18 15:11:38,090 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:11:38,090 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:11:38,091 INFO L168 Benchmark]: Toolchain (without parser) took 7583.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 376.4 MB). Free memory was 951.8 MB in the beginning and 1.2 GB in the end (delta: -247.4 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:38,092 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:11:38,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 951.8 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:38,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.22 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: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:38,093 INFO L168 Benchmark]: Boogie Preprocessor took 18.42 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-18 15:11:38,094 INFO L168 Benchmark]: RCFGBuilder took 232.65 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:38,094 INFO L168 Benchmark]: BuchiAutomizer took 6886.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.9 MB). Peak memory consumption was 130.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:38,095 INFO L168 Benchmark]: Witness Printer took 4.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:11:38,098 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 951.8 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.22 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: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.42 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 232.65 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6886.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.9 MB). Peak memory consumption was 130.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + length2 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.1s. Construction of modules took 0.1s. 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, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 125 SDtfs, 161 SDslu, 110 SDs, 0 SdLazy, 131 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital361 mio100 ax100 hnf99 lsp92 ukn73 mio100 lsp40 div115 bol100 ite100 ukn100 eq183 hnf83 smp91 dnf870 smp24 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 169ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...