./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-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_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/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 a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:02:03,402 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:02:03,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:02:03,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:02:03,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:02:03,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:02:03,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:02:03,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:02:03,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:02:03,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:02:03,415 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:02:03,415 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:02:03,416 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:02:03,416 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:02:03,417 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:02:03,418 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:02:03,419 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:02:03,420 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:02:03,421 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:02:03,422 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:02:03,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:02:03,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:02:03,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:02:03,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:02:03,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:02:03,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:02:03,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:02:03,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:02:03,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:02:03,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:02:03,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:02:03,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:02:03,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:02:03,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:02:03,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:02:03,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:02:03,429 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 02:02:03,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:02:03,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:02:03,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:02:03,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:02:03,439 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:02:03,439 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:02:03,439 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:02:03,440 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:02:03,440 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:02:03,440 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:02:03,440 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:02:03,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:02:03,440 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:02:03,440 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:02:03,440 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:02:03,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:02:03,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:02:03,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:02:03,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:02:03,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:02:03,441 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:02:03,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:02:03,442 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:02:03,442 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:02:03,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:02:03,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:02:03,442 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:02:03,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:02:03,442 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:02:03,442 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:02:03,443 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:02:03,443 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_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/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 -> a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 [2018-11-10 02:02:03,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:02:03,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:02:03,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:02:03,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:02:03,480 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:02:03,480 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-10 02:02:03,516 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/data/f949f375a/a85b83b6f55f46f0a8457a4e48101fe9/FLAG1b221539e [2018-11-10 02:02:03,947 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:02:03,947 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-10 02:02:03,954 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/data/f949f375a/a85b83b6f55f46f0a8457a4e48101fe9/FLAG1b221539e [2018-11-10 02:02:03,963 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/data/f949f375a/a85b83b6f55f46f0a8457a4e48101fe9 [2018-11-10 02:02:03,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:02:03,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:02:03,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:02:03,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:02:03,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:02:03,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:02:03" (1/1) ... [2018-11-10 02:02:03,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8e72be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:03, skipping insertion in model container [2018-11-10 02:02:03,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:02:03" (1/1) ... [2018-11-10 02:02:03,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:02:04,006 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:02:04,192 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:02:04,199 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:02:04,227 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:02:04,258 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:02:04,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04 WrapperNode [2018-11-10 02:02:04,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:02:04,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:02:04,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:02:04,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:02:04,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:02:04,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:02:04,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:02:04,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:02:04,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... [2018-11-10 02:02:04,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:02:04,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:02:04,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:02:04,365 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:02:04,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:02:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 02:02:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 02:02:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:02:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:02:04,696 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:02:04,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:02:04 BoogieIcfgContainer [2018-11-10 02:02:04,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:02:04,697 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:02:04,697 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:02:04,701 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:02:04,702 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:02:04,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:02:03" (1/3) ... [2018-11-10 02:02:04,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59955573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:02:04, skipping insertion in model container [2018-11-10 02:02:04,703 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:02:04,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:02:04" (2/3) ... [2018-11-10 02:02:04,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59955573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:02:04, skipping insertion in model container [2018-11-10 02:02:04,703 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:02:04,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:02:04" (3/3) ... [2018-11-10 02:02:04,705 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-10 02:02:04,742 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:02:04,742 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:02:04,742 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:02:04,742 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:02:04,742 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:02:04,743 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:02:04,743 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:02:04,743 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:02:04,743 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:02:04,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-11-10 02:02:04,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-10 02:02:04,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:02:04,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:02:04,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:04,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:02:04,777 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:02:04,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-11-10 02:02:04,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-10 02:02:04,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:02:04,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:02:04,780 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:04,780 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:02:04,785 INFO L793 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 21#L581true assume !(main_~length1~0 < 1); 5#L581-2true assume !(main_~length2~0 < 1); 42#L584-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~malloc22.base, main_#t~malloc22.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~malloc22.base, main_#t~malloc22.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~malloc23.base, main_#t~malloc23.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~malloc23.base, main_#t~malloc23.offset; 26#L589true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L589 27#L589-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L589-1 4#L590true assume { :begin_inline_cstrstr } true;cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, cstrstr_#t~post13.offset + 1; 9#L566true SUMMARY for call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1); srcloc: L566 12#L566-1true cstrstr_~c~0 := cstrstr_#t~mem14; 33#L566-2true assume cstrstr_~c~0 != 0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 46#L544-5true [2018-11-10 02:02:04,785 INFO L795 eck$LassoCheckResult]: Loop: 46#L544-5true assume true; 14#L544-1true SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 36#L544-2true assume !!(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 45#L544-4true cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 46#L544-5true [2018-11-10 02:02:04,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2052448971, now seen corresponding path program 1 times [2018-11-10 02:02:04,791 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:04,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:04,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:04,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:04,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:04,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1755844, now seen corresponding path program 1 times [2018-11-10 02:02:04,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:04,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:04,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:04,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1009895282, now seen corresponding path program 1 times [2018-11-10 02:02:04,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:04,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:05,317 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2018-11-10 02:02:05,436 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-10 02:02:05,450 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:02:05,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:02:05,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:02:05,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:02:05,452 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:02:05,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:02:05,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:02:05,453 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:02:05,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 02:02:05,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:02:05,453 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:02:05,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,835 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 97 [2018-11-10 02:02:05,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:05,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:06,293 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:02:06,298 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:02:06,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:06,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:06,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:06,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:06,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:06,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:06,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:06,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:06,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:06,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:06,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:06,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:06,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,337 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:06,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,343 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:06,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,371 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:06,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,374 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:06,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:06,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:06,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:06,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:06,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:06,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:06,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,409 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:06,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,410 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:06,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:06,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:06,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:06,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:06,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:06,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:06,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:06,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:06,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:02:06,469 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:02:06,469 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:02:06,471 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:02:06,472 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:02:06,473 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:02:06,473 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrlen_~s~0.base)_1, ULTIMATE.start_cstrlen_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrlen_~s~0.base)_1 - 1*ULTIMATE.start_cstrlen_~s~0.offset Supporting invariants [] [2018-11-10 02:02:06,533 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-10 02:02:06,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:02:06,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:06,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:06,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:06,603 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:02:06,604 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states. Second operand 4 states. [2018-11-10 02:02:06,672 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states.. Second operand 4 states. Result 120 states and 151 transitions. Complement of second has 7 states. [2018-11-10 02:02:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:02:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:02:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2018-11-10 02:02:06,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-10 02:02:06,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:06,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-10 02:02:06,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:06,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 02:02:06,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:06,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 151 transitions. [2018-11-10 02:02:06,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-10 02:02:06,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 44 states and 53 transitions. [2018-11-10 02:02:06,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 02:02:06,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 02:02:06,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 53 transitions. [2018-11-10 02:02:06,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:02:06,686 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-10 02:02:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 53 transitions. [2018-11-10 02:02:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 02:02:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 02:02:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-10 02:02:06,704 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-10 02:02:06,704 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-10 02:02:06,704 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:02:06,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 53 transitions. [2018-11-10 02:02:06,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-10 02:02:06,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:02:06,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:02:06,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:06,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:06,706 INFO L793 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 312#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 313#L581 assume !(main_~length1~0 < 1); 295#L581-2 assume !(main_~length2~0 < 1); 296#L584-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~malloc22.base, main_#t~malloc22.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~malloc22.base, main_#t~malloc22.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~malloc23.base, main_#t~malloc23.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~malloc23.base, main_#t~malloc23.offset; 322#L589 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L589 323#L589-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L589-1 293#L590 assume { :begin_inline_cstrstr } true;cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, cstrstr_#t~post13.offset + 1; 294#L566 SUMMARY for call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1); srcloc: L566 303#L566-1 cstrstr_~c~0 := cstrstr_#t~mem14; 306#L566-2 assume cstrstr_~c~0 != 0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 327#L544-5 assume true; 308#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 309#L544-2 assume !(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 329#L544-6 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 != 0 then (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 + 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 298#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 299#L568-4 [2018-11-10 02:02:06,706 INFO L795 eck$LassoCheckResult]: Loop: 299#L568-4 assume true; 321#L569-3 assume true;cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, cstrstr_#t~post17.offset + 1; 318#L570 SUMMARY for call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1); srcloc: L570 291#L570-1 cstrstr_~sc~0 := cstrstr_#t~mem18; 292#L570-2 assume !(cstrstr_~sc~0 == 0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 297#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 300#L568-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 301#L551 assume cstrncmp_~n % 4294967296 == 0;cstrncmp_#res := 0; 319#L559 cstrstr_#t~ret16 := cstrncmp_#res;assume { :end_inline_cstrncmp } true; 302#L568-2 assume !!(cstrstr_#t~ret16 != 0);havoc cstrstr_#t~ret16; 299#L568-4 [2018-11-10 02:02:06,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1241984427, now seen corresponding path program 1 times [2018-11-10 02:02:06,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:06,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:06,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:06,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 498817970, now seen corresponding path program 1 times [2018-11-10 02:02:06,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:06,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:06,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:02:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:02:06,786 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:02:06,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:02:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:02:06,790 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-10 02:02:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:02:06,830 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-10 02:02:06,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:02:06,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2018-11-10 02:02:06,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 02:02:06,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 43 states and 49 transitions. [2018-11-10 02:02:06,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 02:02:06,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-10 02:02:06,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2018-11-10 02:02:06,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:02:06,833 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 02:02:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2018-11-10 02:02:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 02:02:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 02:02:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-10 02:02:06,835 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 02:02:06,835 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 02:02:06,835 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:02:06,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2018-11-10 02:02:06,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 02:02:06,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:02:06,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:02:06,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:06,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:06,837 INFO L793 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 412#L581 assume !(main_~length1~0 < 1); 394#L581-2 assume !(main_~length2~0 < 1); 395#L584-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~malloc22.base, main_#t~malloc22.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~malloc22.base, main_#t~malloc22.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~malloc23.base, main_#t~malloc23.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~malloc23.base, main_#t~malloc23.offset; 420#L589 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L589 421#L589-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L589-1 392#L590 assume { :begin_inline_cstrstr } true;cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, cstrstr_#t~post13.offset + 1; 393#L566 SUMMARY for call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1); srcloc: L566 402#L566-1 cstrstr_~c~0 := cstrstr_#t~mem14; 405#L566-2 assume cstrstr_~c~0 != 0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 425#L544-5 assume true; 407#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 408#L544-2 assume !(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 427#L544-6 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 != 0 then (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 + 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 397#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 398#L568-4 [2018-11-10 02:02:06,837 INFO L795 eck$LassoCheckResult]: Loop: 398#L568-4 assume true; 419#L569-3 assume true;cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, cstrstr_#t~post17.offset + 1; 417#L570 SUMMARY for call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1); srcloc: L570 390#L570-1 cstrstr_~sc~0 := cstrstr_#t~mem18; 391#L570-2 assume !(cstrstr_~sc~0 == 0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 396#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 399#L568-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 400#L551 assume !(cstrncmp_~n % 4294967296 == 0); 431#L553-4 assume true; 424#L554 SUMMARY for call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L554 413#L554-1 cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset + 1; 414#L554-2 SUMMARY for call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); srcloc: L554-2 415#L554-3 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset; 403#L555 SUMMARY for call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L555 404#L555-1 cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1; 406#L555-2 SUMMARY for call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1); srcloc: L555-2 426#L555-3 cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem9; 418#L559 cstrstr_#t~ret16 := cstrncmp_#res;assume { :end_inline_cstrncmp } true; 401#L568-2 assume !!(cstrstr_#t~ret16 != 0);havoc cstrstr_#t~ret16; 398#L568-4 [2018-11-10 02:02:06,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1241984427, now seen corresponding path program 2 times [2018-11-10 02:02:06,837 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:06,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:06,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1229137607, now seen corresponding path program 1 times [2018-11-10 02:02:06,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:06,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:06,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:02:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:06,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash -482382861, now seen corresponding path program 1 times [2018-11-10 02:02:06,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:06,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:06,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:02:06,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:02:07,178 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 110 [2018-11-10 02:02:07,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:02:07,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:02:07,224 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 02:02:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:02:07,304 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-10 02:02:07,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:02:07,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 64 transitions. [2018-11-10 02:02:07,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-10 02:02:07,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 56 states and 62 transitions. [2018-11-10 02:02:07,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 02:02:07,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 02:02:07,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2018-11-10 02:02:07,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:02:07,306 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-10 02:02:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2018-11-10 02:02:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-11-10 02:02:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 02:02:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-10 02:02:07,308 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-10 02:02:07,308 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-10 02:02:07,308 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:02:07,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2018-11-10 02:02:07,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-10 02:02:07,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:02:07,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:02:07,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:07,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:02:07,310 INFO L793 eck$LassoCheckResult]: Stem: 551#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 531#L581 assume !(main_~length1~0 < 1); 512#L581-2 assume !(main_~length2~0 < 1); 513#L584-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~malloc22.base, main_#t~malloc22.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~malloc22.base, main_#t~malloc22.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~malloc23.base, main_#t~malloc23.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~malloc23.base, main_#t~malloc23.offset; 540#L589 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L589 541#L589-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L589-1 510#L590 assume { :begin_inline_cstrstr } true;cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, cstrstr_#t~post13.offset + 1; 511#L566 SUMMARY for call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1); srcloc: L566 519#L566-1 cstrstr_~c~0 := cstrstr_#t~mem14; 524#L566-2 assume cstrstr_~c~0 != 0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 546#L544-5 assume true; 526#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 527#L544-2 assume !(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 560#L544-6 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 != 0 then (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 + 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 515#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 516#L568-4 assume true; 539#L569-3 [2018-11-10 02:02:07,310 INFO L795 eck$LassoCheckResult]: Loop: 539#L569-3 assume true;cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, cstrstr_#t~post17.offset + 1; 543#L570 SUMMARY for call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1); srcloc: L570 508#L570-1 cstrstr_~sc~0 := cstrstr_#t~mem18; 509#L570-2 assume !(cstrstr_~sc~0 == 0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 514#L569-1 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 539#L569-3 [2018-11-10 02:02:07,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 153188472, now seen corresponding path program 1 times [2018-11-10 02:02:07,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:07,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:07,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:07,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash 75422039, now seen corresponding path program 1 times [2018-11-10 02:02:07,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:07,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:07,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:07,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 412685120, now seen corresponding path program 1 times [2018-11-10 02:02:07,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:07,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:07,793 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 135 [2018-11-10 02:02:08,141 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-11-10 02:02:08,142 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:02:08,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:02:08,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:02:08,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:02:08,143 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:02:08,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:02:08,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:02:08,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:02:08,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 02:02:08,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:02:08,143 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:02:08,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:08,489 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 111 [2018-11-10 02:02:08,800 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-11-10 02:02:09,055 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:02:09,055 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:02:09,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:09,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:09,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:09,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,119 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:09,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,121 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:09,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,129 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:09,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,130 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:09,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:09,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:09,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:09,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:09,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:09,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:09,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:09,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:09,162 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:02:09,178 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:02:09,178 INFO L444 ModelExtractionUtils]: 63 out of 67 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:02:09,179 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:02:09,180 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:02:09,180 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:02:09,180 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2, ULTIMATE.start_cstrstr_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2 - 1*ULTIMATE.start_cstrstr_~s.offset Supporting invariants [] [2018-11-10 02:02:09,250 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 02:02:09,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:02:09,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:09,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:09,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:09,336 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 02:02:09,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 59 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-10 02:02:09,407 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 59 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 84 states and 92 transitions. Complement of second has 8 states. [2018-11-10 02:02:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:02:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 02:02:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-10 02:02:09,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 02:02:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:09,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 22 letters. Loop has 5 letters. [2018-11-10 02:02:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:09,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 17 letters. Loop has 10 letters. [2018-11-10 02:02:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:09,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 92 transitions. [2018-11-10 02:02:09,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 02:02:09,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 58 states and 64 transitions. [2018-11-10 02:02:09,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 02:02:09,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 02:02:09,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 64 transitions. [2018-11-10 02:02:09,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:02:09,412 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-10 02:02:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 64 transitions. [2018-11-10 02:02:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-10 02:02:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 02:02:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-11-10 02:02:09,416 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-10 02:02:09,416 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-10 02:02:09,416 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:02:09,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 64 transitions. [2018-11-10 02:02:09,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 02:02:09,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:02:09,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:02:09,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:09,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:09,418 INFO L793 eck$LassoCheckResult]: Stem: 878#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 853#L581 assume !(main_~length1~0 < 1); 831#L581-2 assume !(main_~length2~0 < 1); 832#L584-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~malloc22.base, main_#t~malloc22.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~malloc22.base, main_#t~malloc22.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~malloc23.base, main_#t~malloc23.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~malloc23.base, main_#t~malloc23.offset; 865#L589 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L589 866#L589-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L589-1 829#L590 assume { :begin_inline_cstrstr } true;cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, cstrstr_#t~post13.offset + 1; 830#L566 SUMMARY for call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1); srcloc: L566 843#L566-1 cstrstr_~c~0 := cstrstr_#t~mem14; 846#L566-2 assume cstrstr_~c~0 != 0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 874#L544-5 assume true; 850#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 851#L544-2 assume !!(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 877#L544-4 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 883#L544-5 assume true; 848#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 849#L544-2 assume !(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 876#L544-6 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 != 0 then (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 + 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 835#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 836#L568-4 assume true; 869#L569-3 assume true;cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, cstrstr_#t~post17.offset + 1; 862#L570 SUMMARY for call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1); srcloc: L570 826#L570-1 cstrstr_~sc~0 := cstrstr_#t~mem18; 828#L570-2 assume !(cstrstr_~sc~0 == 0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 833#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 837#L568-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 838#L551 assume !(cstrncmp_~n % 4294967296 == 0); 881#L553-4 [2018-11-10 02:02:09,418 INFO L795 eck$LassoCheckResult]: Loop: 881#L553-4 assume true; 872#L554 SUMMARY for call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L554 854#L554-1 cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset + 1; 855#L554-2 SUMMARY for call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); srcloc: L554-2 858#L554-3 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset + 1; 860#L556 SUMMARY for call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); srcloc: L556 867#L556-1 assume !(cstrncmp_#t~mem12 == 0);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 870#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 879#L553-2 assume !!(cstrncmp_#t~pre4 % 4294967296 != 0);havoc cstrncmp_#t~pre4; 881#L553-4 [2018-11-10 02:02:09,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash -536108256, now seen corresponding path program 1 times [2018-11-10 02:02:09,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:09,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:09,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1367571938, now seen corresponding path program 1 times [2018-11-10 02:02:09,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:09,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:09,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 45937119, now seen corresponding path program 1 times [2018-11-10 02:02:09,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:09,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:09,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:02:09,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3e41b-ddff-4f63-8c1f-29287d50a4a6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:02:09,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:09,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:09,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:02:09,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-10 02:02:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 02:02:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:02:09,841 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-11-10 02:02:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:02:09,922 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-11-10 02:02:09,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:02:09,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 126 transitions. [2018-11-10 02:02:09,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 02:02:09,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 65 states and 71 transitions. [2018-11-10 02:02:09,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-10 02:02:09,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 02:02:09,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 71 transitions. [2018-11-10 02:02:09,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:02:09,924 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-11-10 02:02:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 71 transitions. [2018-11-10 02:02:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-11-10 02:02:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 02:02:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-11-10 02:02:09,926 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-11-10 02:02:09,926 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-11-10 02:02:09,926 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:02:09,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 68 transitions. [2018-11-10 02:02:09,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 02:02:09,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:02:09,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:02:09,927 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:09,927 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:09,927 INFO L793 eck$LassoCheckResult]: Stem: 1184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1159#L581 assume !(main_~length1~0 < 1); 1137#L581-2 assume !(main_~length2~0 < 1); 1138#L584-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~malloc22.base, main_#t~malloc22.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~malloc22.base, main_#t~malloc22.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~malloc23.base, main_#t~malloc23.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~malloc23.base, main_#t~malloc23.offset; 1171#L589 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L589 1172#L589-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L589-1 1135#L590 assume { :begin_inline_cstrstr } true;cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, cstrstr_#t~post13.offset + 1; 1136#L566 SUMMARY for call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1); srcloc: L566 1149#L566-1 cstrstr_~c~0 := cstrstr_#t~mem14; 1152#L566-2 assume cstrstr_~c~0 != 0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1180#L544-5 assume true; 1191#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 1193#L544-2 assume !!(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 1189#L544-4 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1190#L544-5 assume true; 1156#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 1157#L544-2 assume !!(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 1183#L544-4 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1192#L544-5 assume true; 1154#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 1155#L544-2 assume !(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 1182#L544-6 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 != 0 then (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 + 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1141#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1142#L568-4 assume true; 1175#L569-3 assume true;cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, cstrstr_#t~post17.offset + 1; 1168#L570 SUMMARY for call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1); srcloc: L570 1132#L570-1 cstrstr_~sc~0 := cstrstr_#t~mem18; 1134#L570-2 assume !(cstrstr_~sc~0 == 0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1139#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1143#L568-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1144#L551 assume !(cstrncmp_~n % 4294967296 == 0); 1187#L553-4 [2018-11-10 02:02:09,927 INFO L795 eck$LassoCheckResult]: Loop: 1187#L553-4 assume true; 1178#L554 SUMMARY for call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L554 1160#L554-1 cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset + 1; 1161#L554-2 SUMMARY for call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); srcloc: L554-2 1164#L554-3 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset + 1; 1166#L556 SUMMARY for call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); srcloc: L556 1173#L556-1 assume !(cstrncmp_#t~mem12 == 0);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 1176#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1185#L553-2 assume !!(cstrncmp_#t~pre4 % 4294967296 != 0);havoc cstrncmp_#t~pre4; 1187#L553-4 [2018-11-10 02:02:09,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash -523818051, now seen corresponding path program 2 times [2018-11-10 02:02:09,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:09,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1367571938, now seen corresponding path program 2 times [2018-11-10 02:02:09,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:09,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:02:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2038745570, now seen corresponding path program 2 times [2018-11-10 02:02:09,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:09,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:02:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:10,738 WARN L179 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 195 [2018-11-10 02:02:11,266 WARN L179 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 154 [2018-11-10 02:02:11,268 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:02:11,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:02:11,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:02:11,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:02:11,268 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:02:11,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:02:11,268 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:02:11,268 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:02:11,268 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 02:02:11,268 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:02:11,268 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:02:11,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:11,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:12,030 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 157 [2018-11-10 02:02:12,254 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 105 [2018-11-10 02:02:12,661 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2018-11-10 02:02:12,780 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-11-10 02:02:13,107 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-10 02:02:13,164 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:02:13,164 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:02:13,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,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-11-10 02:02:13,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,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-11-10 02:02:13,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,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-11-10 02:02:13,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:13,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:13,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:13,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,248 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:13,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,249 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:13,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,253 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:13,253 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:02:13,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,255 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 02:02:13,255 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 02:02:13,266 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,275 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:13,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,276 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:13,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,288 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:13,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,290 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:13,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,314 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:13,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:13,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:13,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:13,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:13,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:13,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:13,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:13,395 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:02:13,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:02:13,440 INFO L444 ModelExtractionUtils]: 91 out of 97 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 02:02:13,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:02:13,441 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:02:13,441 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:02:13,441 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 Supporting invariants [] [2018-11-10 02:02:13,641 INFO L297 tatePredicateManager]: 57 out of 58 supporting invariants were superfluous and have been removed [2018-11-10 02:02:13,645 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:02:13,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:13,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:13,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:13,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 02:02:13,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 68 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-10 02:02:13,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 68 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 142 states and 156 transitions. Complement of second has 9 states. [2018-11-10 02:02:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:02:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:02:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-10 02:02:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 32 letters. Loop has 9 letters. [2018-11-10 02:02:13,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 41 letters. Loop has 9 letters. [2018-11-10 02:02:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 32 letters. Loop has 18 letters. [2018-11-10 02:02:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:13,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 156 transitions. [2018-11-10 02:02:13,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 02:02:13,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 103 states and 114 transitions. [2018-11-10 02:02:13,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-10 02:02:13,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-10 02:02:13,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 114 transitions. [2018-11-10 02:02:13,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:02:13,780 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-10 02:02:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 114 transitions. [2018-11-10 02:02:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-11-10 02:02:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 02:02:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2018-11-10 02:02:13,784 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 96 transitions. [2018-11-10 02:02:13,784 INFO L608 BuchiCegarLoop]: Abstraction has 87 states and 96 transitions. [2018-11-10 02:02:13,785 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:02:13,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 96 transitions. [2018-11-10 02:02:13,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 02:02:13,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:02:13,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:02:13,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:13,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:02:13,787 INFO L793 eck$LassoCheckResult]: Stem: 1784#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1754#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1755#L581 assume !(main_~length1~0 < 1); 1731#L581-2 assume !(main_~length2~0 < 1); 1732#L584-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~malloc22.base, main_#t~malloc22.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~malloc22.base, main_#t~malloc22.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~malloc23.base, main_#t~malloc23.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~malloc23.base, main_#t~malloc23.offset; 1767#L589 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L589 1768#L589-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L589-1 1729#L590 assume { :begin_inline_cstrstr } true;cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, cstrstr_#t~post13.offset + 1; 1730#L566 SUMMARY for call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1); srcloc: L566 1743#L566-1 cstrstr_~c~0 := cstrstr_#t~mem14; 1748#L566-2 assume cstrstr_~c~0 != 0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1779#L544-5 assume true; 1752#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 1753#L544-2 assume !!(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 1798#L544-4 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1792#L544-5 assume true; 1793#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 1782#L544-2 assume !!(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 1783#L544-4 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, cstrlen_~s~0.offset + 1;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1791#L544-5 assume true; 1750#L544-1 SUMMARY for call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); srcloc: L544-1 1751#L544-2 assume !(cstrlen_#t~mem3 != 0);havoc cstrlen_#t~mem3; 1781#L544-6 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 != 0 then (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 + 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1737#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1738#L568-4 assume true; 1773#L569-3 assume true;cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, cstrstr_#t~post17.offset + 1; 1774#L570 SUMMARY for call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1); srcloc: L570 1727#L570-1 cstrstr_~sc~0 := cstrstr_#t~mem18; 1728#L570-2 assume !(cstrstr_~sc~0 == 0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1800#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1801#L568-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1788#L551 assume !(cstrncmp_~n % 4294967296 == 0); 1789#L553-4 assume true; 1778#L554 SUMMARY for call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L554 1758#L554-1 cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset + 1; 1759#L554-2 SUMMARY for call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); srcloc: L554-2 1761#L554-3 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset; 1746#L555 SUMMARY for call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L555 1747#L555-1 cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1; 1749#L555-2 SUMMARY for call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1); srcloc: L555-2 1780#L555-3 cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem9; 1765#L559 cstrstr_#t~ret16 := cstrncmp_#res;assume { :end_inline_cstrncmp } true; 1744#L568-2 assume !!(cstrstr_#t~ret16 != 0);havoc cstrstr_#t~ret16; 1745#L568-4 assume true; 1766#L569-3 assume true;cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, cstrstr_#t~post17.offset + 1; 1763#L570 SUMMARY for call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1); srcloc: L570 1764#L570-1 cstrstr_~sc~0 := cstrstr_#t~mem18; 1733#L570-2 assume !(cstrstr_~sc~0 == 0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1734#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1739#L568-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1740#L551 assume !(cstrncmp_~n % 4294967296 == 0); 1787#L553-4 [2018-11-10 02:02:13,787 INFO L795 eck$LassoCheckResult]: Loop: 1787#L553-4 assume true; 1777#L554 SUMMARY for call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L554 1756#L554-1 cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset + 1; 1757#L554-2 SUMMARY for call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); srcloc: L554-2 1760#L554-3 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset + 1; 1762#L556 SUMMARY for call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); srcloc: L556 1769#L556-1 assume !(cstrncmp_#t~mem12 == 0);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 1775#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1785#L553-2 assume !!(cstrncmp_#t~pre4 % 4294967296 != 0);havoc cstrncmp_#t~pre4; 1787#L553-4 [2018-11-10 02:02:13,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -868492889, now seen corresponding path program 1 times [2018-11-10 02:02:13,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:13,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:13,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:02:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:13,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1367571938, now seen corresponding path program 3 times [2018-11-10 02:02:13,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:13,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:13,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:13,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:02:13,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:13,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash 488907576, now seen corresponding path program 1 times [2018-11-10 02:02:13,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:02:13,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:02:13,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:13,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:02:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:02:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:15,188 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 343 DAG size of output: 273 [2018-11-10 02:02:15,742 WARN L179 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 162 [2018-11-10 02:02:15,744 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:02:15,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:02:15,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:02:15,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:02:15,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:02:15,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:02:15,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:02:15,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:02:15,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-10 02:02:15,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:02:15,744 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:02:15,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:15,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,688 WARN L179 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 165 [2018-11-10 02:02:16,955 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2018-11-10 02:02:16,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:16,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:02:17,275 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-10 02:02:17,491 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-10 02:02:17,861 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-11-10 02:02:18,106 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-10 02:02:18,197 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:02:18,197 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:02:18,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,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-11-10 02:02:18,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:18,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:18,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:18,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:18,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:18,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,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-11-10 02:02:18,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:18,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,225 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:18,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,226 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:18,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,228 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:18,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:18,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,237 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-10 02:02:18,237 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:02:18,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,242 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-10 02:02:18,242 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 02:02:18,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:18,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:18,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,278 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:18,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,279 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:18,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:18,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:18,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:18,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:18,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:18,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:18,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:18,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:18,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:18,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:18,361 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:02:18,401 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 02:02:18,402 INFO L444 ModelExtractionUtils]: 93 out of 100 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 02:02:18,402 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:02:18,403 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:02:18,403 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:02:18,403 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_4, ULTIMATE.start_cstrncmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_4 - 1*ULTIMATE.start_cstrncmp_~s2.offset Supporting invariants [] [2018-11-10 02:02:18,776 INFO L297 tatePredicateManager]: 81 out of 82 supporting invariants were superfluous and have been removed [2018-11-10 02:02:18,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 02:02:18,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:02:18,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 02:02:18,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:18,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:18,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:18,858 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-10 02:02:18,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 96 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 02:02:18,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 96 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 106 states and 117 transitions. Complement of second has 10 states. [2018-11-10 02:02:18,921 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-11-10 02:02:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 02:02:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-10 02:02:18,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 51 letters. Loop has 9 letters. [2018-11-10 02:02:18,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:18,922 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:02:18,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:18,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:18,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:19,009 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-10 02:02:19,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 96 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 02:02:19,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 96 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 134 states and 148 transitions. Complement of second has 14 states. [2018-11-10 02:02:19,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 02:02:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 02:02:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-10 02:02:19,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 52 transitions. Stem has 51 letters. Loop has 9 letters. [2018-11-10 02:02:19,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:19,104 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:02:19,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:19,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:19,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:02:19,203 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 3 loop predicates [2018-11-10 02:02:19,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 96 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 02:02:19,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 96 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 123 states and 137 transitions. Complement of second has 9 states. [2018-11-10 02:02:19,275 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-11-10 02:02:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 02:02:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-10 02:02:19,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 51 letters. Loop has 9 letters. [2018-11-10 02:02:19,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:19,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 60 letters. Loop has 9 letters. [2018-11-10 02:02:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 51 letters. Loop has 18 letters. [2018-11-10 02:02:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:19,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 137 transitions. [2018-11-10 02:02:19,279 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:02:19,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2018-11-10 02:02:19,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:02:19,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:02:19,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:02:19,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:02:19,280 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:02:19,280 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:02:19,280 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:02:19,280 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 02:02:19,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:02:19,280 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:02:19,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:02:19,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:02:19 BoogieIcfgContainer [2018-11-10 02:02:19,288 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:02:19,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:02:19,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:02:19,289 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:02:19,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:02:04" (3/4) ... [2018-11-10 02:02:19,297 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:02:19,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:02:19,298 INFO L168 Benchmark]: Toolchain (without parser) took 15332.40 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 554.7 MB). Free memory was 957.5 MB in the beginning and 1.3 GB in the end (delta: -366.8 MB). Peak memory consumption was 187.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:19,299 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:02:19,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.29 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:19,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -222.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:19,300 INFO L168 Benchmark]: Boogie Preprocessor took 27.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:19,301 INFO L168 Benchmark]: RCFGBuilder took 332.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:19,301 INFO L168 Benchmark]: BuchiAutomizer took 14590.96 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.3 MB). Peak memory consumption was 181.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:19,302 INFO L168 Benchmark]: Witness Printer took 8.82 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:02:19,305 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.29 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 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 77.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -222.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14590.96 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.3 MB). Peak memory consumption was 181.7 MB. Max. memory is 11.5 GB. * Witness Printer took 8.82 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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 #length - 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 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s and consists of 6 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[nondetString1] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s2 and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 13.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 87 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 391 SDtfs, 530 SDslu, 813 SDs, 0 SdLazy, 265 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital298 mio100 ax100 hnf99 lsp97 ukn103 mio100 lsp42 div135 bol100 ite100 ukn100 eq179 hnf77 smp96 dnf129 smp87 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 12 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...