./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/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 32bit --witnessprinter.graph.data.programhash 1f6e8c8b965f85c3429105401e9fda59f9f060cb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:12:19,483 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:19,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:19,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:19,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:19,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:19,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:19,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:19,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:19,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:19,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:19,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:19,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:19,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:19,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:19,503 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:19,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:19,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:19,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:19,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:19,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:19,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:19,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:19,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:19,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:19,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:19,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:19,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:19,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:19,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:19,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:19,516 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:19,516 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:19,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:19,517 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:19,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:19,519 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:12:19,529 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:19,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:19,530 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:12:19,531 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:12:19,531 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:12:19,531 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:12:19,531 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:12:19,531 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:12:19,531 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:12:19,531 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:12:19,532 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:12:19,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:19,532 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:12:19,532 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:12:19,532 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:19,532 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:12:19,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:19,532 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:12:19,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:12:19,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:12:19,533 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:12:19,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:19,533 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:12:19,533 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:12:19,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:19,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:19,536 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:12:19,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:19,536 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:12:19,536 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:12:19,537 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:12:19,537 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_a6a422b4-c289-4682-a2d8-bc1633c2c30e/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-10-27 06:12:19,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:19,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:19,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:19,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:19,578 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:19,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:12:19,623 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/data/9d568d257/09e5e47cbfaa41148a0d168b50d16ca7/FLAGbce79ddd2 [2018-10-27 06:12:20,040 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:20,040 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:12:20,050 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/data/9d568d257/09e5e47cbfaa41148a0d168b50d16ca7/FLAGbce79ddd2 [2018-10-27 06:12:20,063 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/bin-2019/uautomizer/data/9d568d257/09e5e47cbfaa41148a0d168b50d16ca7 [2018-10-27 06:12:20,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:20,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:20,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:20,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:20,075 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:20,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db5b40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20, skipping insertion in model container [2018-10-27 06:12:20,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:20,117 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:20,334 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:20,342 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:20,375 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:20,427 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:20,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20 WrapperNode [2018-10-27 06:12:20,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:20,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:20,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:20,428 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:20,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:20,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:20,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:20,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:20,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... [2018-10-27 06:12:20,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:20,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:20,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:20,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:20,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6a422b4-c289-4682-a2d8-bc1633c2c30e/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-10-27 06:12:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:12:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:12:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:21,033 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:21,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:21 BoogieIcfgContainer [2018-10-27 06:12:21,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:21,034 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:21,034 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:21,038 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:21,039 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:21,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:20" (1/3) ... [2018-10-27 06:12:21,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@96f568c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:21, skipping insertion in model container [2018-10-27 06:12:21,040 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:21,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:20" (2/3) ... [2018-10-27 06:12:21,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@96f568c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:21, skipping insertion in model container [2018-10-27 06:12:21,041 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:21,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:21" (3/3) ... [2018-10-27 06:12:21,043 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:12:21,100 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:21,101 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:21,102 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:21,102 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:21,102 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:21,102 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:21,102 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:21,102 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:21,102 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:21,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:12:21,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:21,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:21,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:21,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:21,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:21,154 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:21,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:12:21,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:21,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:21,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:21,158 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:21,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:21,165 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 19#L558true assume !(main_~length1~0 < 1); 23#L558-2true assume !(main_~length2~0 < 1); 17#L561-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 7#L566true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 9#L566-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 22#L567true assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 13#L545-5true [2018-10-27 06:12:21,168 INFO L795 eck$LassoCheckResult]: Loop: 13#L545-5true assume true; 24#L545-1true SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 25#L545-2true assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 20#L547true SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 21#L547-1true cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 29#L548-9true assume !true; 30#L548-10true SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-10 15#L550true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 12#L545-4true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 13#L545-5true [2018-10-27 06:12:21,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:12:21,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:21,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:21,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:21,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:21,318 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-10-27 06:12:21,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:21,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:21,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:21,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:12:21,351 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:12:21,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:12:21,365 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 06:12:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:21,371 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 06:12:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:12:21,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-10-27 06:12:21,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:21,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-10-27 06:12:21,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:12:21,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:12:21,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:12:21,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:21,379 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:12:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:12:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:12:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:12:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:12:21,402 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:12:21,402 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:12:21,403 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:21,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:12:21,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:21,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:21,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:21,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:21,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:21,404 INFO L793 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 64#L558 assume !(main_~length1~0 < 1); 65#L558-2 assume !(main_~length2~0 < 1); 74#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 77#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 78#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 72#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 73#L545-5 [2018-10-27 06:12:21,405 INFO L795 eck$LassoCheckResult]: Loop: 73#L545-5 assume true; 79#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 80#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 66#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 67#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 70#L548-9 assume true; 68#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 69#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 71#L548-3 assume !cstrspn_#t~short7; 76#L548-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 84#L548-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-10 86#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 85#L545-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 73#L545-5 [2018-10-27 06:12:21,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:21,405 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:12:21,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:21,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:21,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:21,439 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-10-27 06:12:21,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:21,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:21,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:21,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:21,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:21,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:21,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:12:21,738 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:21,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:12:21,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:12:21,738 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-10-27 06:12:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:22,466 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-10-27 06:12:22,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:12:22,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-10-27 06:12:22,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:12:22,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-10-27 06:12:22,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-10-27 06:12:22,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:12:22,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-10-27 06:12:22,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:22,471 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-10-27 06:12:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-10-27 06:12:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-27 06:12:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:12:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-27 06:12:22,475 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:12:22,475 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:12:22,475 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:22,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-10-27 06:12:22,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:12:22,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:22,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:22,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:22,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:22,477 INFO L793 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 149#L558 assume !(main_~length1~0 < 1); 150#L558-2 assume !(main_~length2~0 < 1); 159#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 162#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 163#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 157#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 158#L545-5 [2018-10-27 06:12:22,477 INFO L795 eck$LassoCheckResult]: Loop: 158#L545-5 assume true; 164#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 165#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 151#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 152#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 155#L548-9 assume true; 153#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 154#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 156#L548-3 assume cstrspn_#t~short7; 160#L548-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-4 166#L548-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 167#L548-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 172#L548-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-10 171#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 170#L545-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 158#L545-5 [2018-10-27 06:12:22,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-10-27 06:12:22,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:22,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:22,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-10-27 06:12:22,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:22,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:22,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-10-27 06:12:22,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:22,968 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-10-27 06:12:23,183 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-27 06:12:23,440 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-10-27 06:12:23,539 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:23,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:23,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:23,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:23,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:23,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:23,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:23,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:23,541 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-10-27 06:12:23,541 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:23,542 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:23,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:23,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:23,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:23,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:23,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:23,922 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-10-27 06:12:24,086 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-10-27 06:12:24,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:24,621 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:24,626 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:24,627 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-10-27 06:12:24,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:24,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:24,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:24,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:24,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:24,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:24,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:24,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:24,634 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-10-27 06:12:24,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:24,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:24,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:24,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:24,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:24,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:24,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:24,640 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-10-27 06:12:24,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:24,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:24,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:24,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:24,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:24,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:24,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:24,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:24,643 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-10-27 06:12:24,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:24,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:24,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:24,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:24,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:24,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:24,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:24,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:24,645 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-10-27 06:12:24,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:24,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:24,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:24,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:24,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:24,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:24,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:24,650 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-10-27 06:12:24,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:24,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:24,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:24,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:24,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:24,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:24,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:24,678 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-10-27 06:12:24,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:24,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:24,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:24,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:24,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:24,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:24,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:24,684 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-10-27 06:12:24,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:24,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:24,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:24,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:24,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:24,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:24,725 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:24,768 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:12:24,768 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:12:24,770 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:24,771 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:24,772 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:24,772 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-10-27 06:12:24,860 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:12:24,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:24,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:24,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:24,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:24,930 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-10-27 06:12:24,930 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:12:25,006 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 40 states and 47 transitions. Complement of second has 6 states. [2018-10-27 06:12:25,007 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-10-27 06:12:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-10-27 06:12:25,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-10-27 06:12:25,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:25,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-10-27 06:12:25,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:25,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-10-27 06:12:25,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:25,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-10-27 06:12:25,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:12:25,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-10-27 06:12:25,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:12:25,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:12:25,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-10-27 06:12:25,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:25,013 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-10-27 06:12:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-10-27 06:12:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-27 06:12:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:12:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-10-27 06:12:25,015 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:12:25,016 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:12:25,016 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:12:25,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-10-27 06:12:25,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:25,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:25,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:25,017 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:25,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:25,017 INFO L793 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 341#L558 assume !(main_~length1~0 < 1); 342#L558-2 assume !(main_~length2~0 < 1); 357#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 362#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 363#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 355#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 356#L545-5 assume true; 366#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 367#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 347#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 348#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 353#L548-9 [2018-10-27 06:12:25,017 INFO L795 eck$LassoCheckResult]: Loop: 353#L548-9 assume true; 343#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 344#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 351#L548-3 assume !cstrspn_#t~short7; 359#L548-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 353#L548-9 [2018-10-27 06:12:25,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-10-27 06:12:25,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-10-27 06:12:25,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:25,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:25,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:12:25,098 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:25,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:25,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:25,099 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:12:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:25,112 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-10-27 06:12:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:25,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-10-27 06:12:25,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:25,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-10-27 06:12:25,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:12:25,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:12:25,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-10-27 06:12:25,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:25,116 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:12:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-10-27 06:12:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 06:12:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:12:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 06:12:25,118 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:12:25,118 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:12:25,118 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:12:25,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-10-27 06:12:25,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:25,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:25,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:25,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:25,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:25,120 INFO L793 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 420#L558 assume !(main_~length1~0 < 1); 421#L558-2 assume !(main_~length2~0 < 1); 436#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 439#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 440#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 434#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 435#L545-5 assume true; 441#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 442#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 422#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 423#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 430#L548-9 [2018-10-27 06:12:25,120 INFO L795 eck$LassoCheckResult]: Loop: 430#L548-9 assume true; 426#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 427#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 432#L548-3 assume cstrspn_#t~short7; 437#L548-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-4 445#L548-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 447#L548-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 430#L548-9 [2018-10-27 06:12:25,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-10-27 06:12:25,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-10-27 06:12:25,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:25,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-10-27 06:12:25,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:25,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:25,582 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-10-27 06:12:25,750 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:12:25,760 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:25,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:25,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:25,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:25,761 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:25,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:25,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:25,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:25,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-10-27 06:12:25,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:25,761 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:25,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:25,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:26,203 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2018-10-27 06:12:26,404 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-10-27 06:12:26,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:26,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:26,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:26,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:26,652 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-10-27 06:12:26,835 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:12:26,981 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:26,982 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:26,982 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-10-27 06:12:26,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:26,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:26,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:26,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:26,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:26,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:26,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:26,984 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-10-27 06:12:26,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:26,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:26,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:26,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:26,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:26,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:26,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:26,986 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-10-27 06:12:26,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:26,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:26,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:26,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:26,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:26,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:26,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:26,988 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-10-27 06:12:26,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:26,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:26,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:26,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:26,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:26,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:26,991 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-10-27 06:12:26,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:26,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:26,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:26,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:26,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:26,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:26,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:26,993 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-10-27 06:12:26,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:26,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:26,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:26,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:26,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:26,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:26,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:26,995 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-10-27 06:12:26,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:26,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:26,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:26,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:26,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:26,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:26,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:26,997 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-10-27 06:12:26,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:26,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:26,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:26,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:26,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:26,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:26,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:26,999 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-10-27 06:12:26,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:26,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:27,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:27,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:27,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,001 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-10-27 06:12:27,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,004 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-10-27 06:12:27,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:27,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:27,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:27,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,006 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-10-27 06:12:27,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:27,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:27,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:27,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,008 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-10-27 06:12:27,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:27,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:27,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:27,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,010 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-10-27 06:12:27,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,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-10-27 06:12:27,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,019 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-10-27 06:12:27,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,022 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-10-27 06:12:27,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,026 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-10-27 06:12:27,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,031 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-10-27 06:12:27,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,036 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-10-27 06:12:27,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,037 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:27,037 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-10-27 06:12:27,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,063 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-10-27 06:12:27,063 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-10-27 06:12:27,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,188 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-10-27 06:12:27,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,189 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:27,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:27,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,201 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-10-27 06:12:27,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,208 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-10-27 06:12:27,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,209 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:27,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,214 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:27,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,220 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-10-27 06:12:27,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:27,226 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-10-27 06:12:27,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:27,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:27,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:27,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:27,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:27,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:27,256 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:27,279 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:12:27,279 INFO L444 ModelExtractionUtils]: 58 out of 64 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:12:27,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:27,280 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:27,280 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:27,280 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-10-27 06:12:27,588 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-10-27 06:12:27,590 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:27,591 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:27,591 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:12:27,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:27,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:27,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:27,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:12:27,873 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-10-27 06:12:27,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 86 states and 94 transitions. Complement of second has 10 states. [2018-10-27 06:12:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:12:27,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:12:27,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:27,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-10-27 06:12:27,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:27,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-10-27 06:12:27,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:27,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-10-27 06:12:27,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:27,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-10-27 06:12:27,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:12:27,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:12:27,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-10-27 06:12:27,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:27,949 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-10-27 06:12:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-10-27 06:12:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-10-27 06:12:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:12:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-27 06:12:27,952 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:12:27,952 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:12:27,952 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:12:27,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-10-27 06:12:27,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:12:27,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:27,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:27,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:27,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:27,957 INFO L793 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 739#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 708#L558 assume !(main_~length1~0 < 1); 709#L558-2 assume !(main_~length2~0 < 1); 725#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 728#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 729#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 723#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 724#L545-5 assume true; 745#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 738#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 716#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 717#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 722#L548-9 assume true; 712#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 713#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 756#L548-3 assume cstrspn_#t~short7; 754#L548-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-4 752#L548-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 741#L548-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 742#L548-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-10 746#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 743#L545-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 744#L545-5 assume true; 732#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 733#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 714#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 715#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 721#L548-9 [2018-10-27 06:12:27,957 INFO L795 eck$LassoCheckResult]: Loop: 721#L548-9 assume true; 710#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 711#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 718#L548-3 assume cstrspn_#t~short7; 726#L548-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-4 730#L548-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 736#L548-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 721#L548-9 [2018-10-27 06:12:27,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-10-27 06:12:27,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:27,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:27,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-10-27 06:12:27,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:27,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-10-27 06:12:27,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:27,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:28,267 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:12:28,780 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 149 [2018-10-27 06:12:29,588 WARN L179 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 119 [2018-10-27 06:12:29,590 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:29,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:29,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:29,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:29,590 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:29,590 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:29,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:29,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:29,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-10-27 06:12:29,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:29,591 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:29,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:29,801 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:12:30,556 WARN L179 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 119 [2018-10-27 06:12:30,690 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-10-27 06:12:30,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:30,999 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 06:12:31,543 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-10-27 06:12:31,646 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:12:31,650 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:31,650 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:31,650 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-10-27 06:12:31,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,652 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-10-27 06:12:31,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,662 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-10-27 06:12:31,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,663 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-10-27 06:12:31,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,665 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-10-27 06:12:31,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,666 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-10-27 06:12:31,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,668 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-10-27 06:12:31,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,669 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-10-27 06:12:31,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,671 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-10-27 06:12:31,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,673 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-10-27 06:12:31,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,674 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-10-27 06:12:31,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,676 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-10-27 06:12:31,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,677 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-10-27 06:12:31,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,678 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-10-27 06:12:31,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,680 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-10-27 06:12:31,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,681 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-10-27 06:12:31,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:31,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:31,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:31,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,682 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-10-27 06:12:31,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,686 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-10-27 06:12:31,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,688 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-10-27 06:12:31,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,688 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:31,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,689 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:31,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,694 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-10-27 06:12:31,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,697 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-10-27 06:12:31,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,700 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-10-27 06:12:31,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,703 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-10-27 06:12:31,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,707 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-10-27 06:12:31,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:31,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:31,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:31,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:31,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:31,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:31,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:31,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:31,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:31,749 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:12:31,749 INFO L444 ModelExtractionUtils]: 66 out of 70 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:12:31,750 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:31,750 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:31,751 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:31,751 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-10-27 06:12:32,335 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-10-27 06:12:32,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:32,337 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:32,337 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:12:32,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:32,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:32,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:32,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:12:32,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:12:32,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-10-27 06:12:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:12:32,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:12:32,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:32,542 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:12:32,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:32,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:32,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:32,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:12:32,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:12:32,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-10-27 06:12:32,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:12:32,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:12:32,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:32,663 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:12:32,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:32,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:32,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:32,797 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:12:32,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:12:32,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 85 states and 92 transitions. Complement of second has 9 states. [2018-10-27 06:12:32,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-10-27 06:12:32,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:12:32,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:32,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:12:32,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:32,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-10-27 06:12:32,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:32,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-10-27 06:12:32,862 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:32,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-10-27 06:12:32,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:32,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:32,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:32,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:32,862 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:32,862 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:32,862 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:32,862 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:12:32,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:32,863 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:32,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:12:32,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:32 BoogieIcfgContainer [2018-10-27 06:12:32,872 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:32,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:32,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:32,873 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:32,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:21" (3/4) ... [2018-10-27 06:12:32,876 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:12:32,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:32,877 INFO L168 Benchmark]: Toolchain (without parser) took 12810.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.1 MB). Free memory was 953.1 MB in the beginning and 922.6 MB in the end (delta: 30.5 MB). Peak memory consumption was 388.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:32,877 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:32,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.17 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 931.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:32,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 931.6 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:32,879 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:32,879 INFO L168 Benchmark]: RCFGBuilder took 473.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:32,879 INFO L168 Benchmark]: BuchiAutomizer took 11838.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.1 GB in the beginning and 922.6 MB in the end (delta: 177.3 MB). Peak memory consumption was 399.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:32,880 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 922.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:32,883 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.17 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 931.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 931.6 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 473.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11838.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.1 GB in the beginning and 922.6 MB in the end (delta: 177.3 MB). Peak memory consumption was 399.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 922.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.8s. Construction of modules took 0.4s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 190 SDtfs, 238 SDslu, 225 SDs, 0 SdLazy, 213 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf99 lsp91 ukn87 mio100 lsp30 div122 bol100 ite100 ukn100 eq173 hnf83 smp95 dnf525 smp25 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 151ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...