./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eec7850a55859668859d25c9503478e74955da1a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:49:08,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:49:08,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:49:08,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:49:08,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:49:08,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:49:08,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:49:08,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:49:08,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:49:08,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:49:08,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:49:08,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:49:08,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:49:08,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:49:08,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:49:08,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:49:08,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:49:08,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:49:08,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:49:08,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:49:08,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:49:08,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:49:08,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:49:08,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:49:08,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:49:08,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:49:08,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:49:08,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:49:08,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:49:08,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:49:08,840 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:49:08,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:49:08,840 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:49:08,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:49:08,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:49:08,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:49:08,842 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:49:08,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:49:08,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:49:08,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:49:08,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:49:08,854 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:49:08,854 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:49:08,855 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:49:08,855 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:49:08,855 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:49:08,855 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:49:08,855 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:49:08,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:49:08,855 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:49:08,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:49:08,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:49:08,856 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:49:08,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:49:08,856 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:49:08,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:49:08,856 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:49:08,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:49:08,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:49:08,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:49:08,857 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:49:08,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:49:08,857 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:49:08,857 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:49:08,858 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:49:08,858 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_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec7850a55859668859d25c9503478e74955da1a [2018-11-10 12:49:08,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:49:08,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:49:08,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:49:08,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:49:08,894 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:49:08,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-11-10 12:49:08,937 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/data/0aac08052/ca6de1999b004a96a7f0a39e1324e398/FLAGaeba8e397 [2018-11-10 12:49:09,346 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:49:09,346 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-11-10 12:49:09,350 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/data/0aac08052/ca6de1999b004a96a7f0a39e1324e398/FLAGaeba8e397 [2018-11-10 12:49:09,360 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/bin-2019/uautomizer/data/0aac08052/ca6de1999b004a96a7f0a39e1324e398 [2018-11-10 12:49:09,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:49:09,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:49:09,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:49:09,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:49:09,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:49:09,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61785316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09, skipping insertion in model container [2018-11-10 12:49:09,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:49:09,389 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:49:09,490 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:49:09,497 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:49:09,508 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:49:09,517 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:49:09,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09 WrapperNode [2018-11-10 12:49:09,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:49:09,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:49:09,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:49:09,518 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:49:09,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:49:09,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:49:09,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:49:09,543 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:49:09,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2018-11-10 12:49:09,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:49:09,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:49:09,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:49:09,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:49:09,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f41cbba-fa8e-4cf8-bd50-ad5185085c98/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 12:49:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:49:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:49:09,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:49:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:49:09,799 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:49:09,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:09 BoogieIcfgContainer [2018-11-10 12:49:09,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:49:09,800 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:49:09,800 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:49:09,802 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:49:09,803 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:49:09,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:49:09" (1/3) ... [2018-11-10 12:49:09,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42d531fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:49:09, skipping insertion in model container [2018-11-10 12:49:09,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:49:09,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (2/3) ... [2018-11-10 12:49:09,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42d531fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:49:09, skipping insertion in model container [2018-11-10 12:49:09,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:49:09,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:09" (3/3) ... [2018-11-10 12:49:09,807 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_true-termination_true-no-overflow.c [2018-11-10 12:49:09,852 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:49:09,852 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:49:09,852 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:49:09,852 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:49:09,852 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:49:09,852 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:49:09,852 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:49:09,853 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:49:09,853 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:49:09,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:49:09,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:49:09,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:09,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:09,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:09,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:09,886 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:49:09,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:49:09,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:49:09,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:09,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:09,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:09,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:09,893 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 19#L14true assume !(build_nondet_String_~length~0 < 1); 16#L14-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 8#L18true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 7#L18-1true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 26#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 14#L14-3true assume !(build_nondet_String_~length~0 < 1); 28#L14-5true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 5#L18-2true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 3#L18-3true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 24#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 4#L31-5true [2018-11-10 12:49:09,894 INFO L795 eck$LassoCheckResult]: Loop: 4#L31-5true assume true; 10#L31-1true SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 9#L31-2true assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 31#L33true SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 30#L33-1true cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 34#L34-9true assume !true; 33#L34-10true SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-10 21#L36true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 6#L31-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 4#L31-5true [2018-11-10 12:49:09,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 1 times [2018-11-10 12:49:09,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:09,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:09,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:09,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:10,004 INFO L82 PathProgramCache]: Analyzing trace with hash 883669989, now seen corresponding path program 1 times [2018-11-10 12:49:10,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:10,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:10,027 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 12:49:10,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:10,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:49:10,032 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:10,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:49:10,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:49:10,042 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-10 12:49:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:10,047 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-10 12:49:10,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:49:10,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-10 12:49:10,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:49:10,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 31 transitions. [2018-11-10 12:49:10,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 12:49:10,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 12:49:10,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-10 12:49:10,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:49:10,054 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-10 12:49:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-10 12:49:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 12:49:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 12:49:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-10 12:49:10,075 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-10 12:49:10,075 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-10 12:49:10,075 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:49:10,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-10 12:49:10,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:49:10,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:10,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:10,077 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:10,077 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:10,077 INFO L793 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 86#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 87#L14 assume !(build_nondet_String_~length~0 < 1); 92#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 80#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 78#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 79#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 89#L14-3 assume !(build_nondet_String_~length~0 < 1); 90#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 76#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 72#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 73#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 74#L31-5 [2018-11-10 12:49:10,078 INFO L795 eck$LassoCheckResult]: Loop: 74#L31-5 assume true; 75#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 81#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 82#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 98#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 95#L34-9 assume true; 91#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 88#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 83#L34-3 assume !cstrpbrk_#t~short7; 84#L34-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 94#L34-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-10 93#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 77#L31-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 74#L31-5 [2018-11-10 12:49:10,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 2 times [2018-11-10 12:49:10,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:10,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:10,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:10,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash 311113554, now seen corresponding path program 1 times [2018-11-10 12:49:10,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:10,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:10,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:10,255 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 12:49:10,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:10,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 12:49:10,256 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:10,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:49:10,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:49:10,257 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 12:49:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:10,471 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-10 12:49:10,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 12:49:10,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2018-11-10 12:49:10,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 12:49:10,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 37 transitions. [2018-11-10 12:49:10,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 12:49:10,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 12:49:10,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-11-10 12:49:10,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:49:10,476 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-10 12:49:10,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-11-10 12:49:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-11-10 12:49:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 12:49:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-10 12:49:10,480 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-10 12:49:10,480 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-10 12:49:10,480 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:49:10,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2018-11-10 12:49:10,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 12:49:10,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:10,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:10,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:10,481 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:10,482 INFO L793 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 180#L14 assume !(build_nondet_String_~length~0 < 1); 185#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 173#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 171#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 172#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 182#L14-3 assume !(build_nondet_String_~length~0 < 1); 183#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 169#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 165#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 166#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 167#L31-5 [2018-11-10 12:49:10,482 INFO L795 eck$LassoCheckResult]: Loop: 167#L31-5 assume true; 168#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 174#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 175#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 190#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 187#L34-9 assume true; 184#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 181#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 176#L34-3 assume cstrpbrk_#t~short7; 178#L34-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-4 188#L34-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 189#L34-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 192#L34-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-10 186#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 170#L31-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 167#L31-5 [2018-11-10 12:49:10,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 3 times [2018-11-10 12:49:10,482 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:10,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1134451409, now seen corresponding path program 1 times [2018-11-10 12:49:10,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:10,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:10,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:10,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:10,528 INFO L82 PathProgramCache]: Analyzing trace with hash 689254914, now seen corresponding path program 1 times [2018-11-10 12:49:10,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:10,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:10,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:10,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:10,696 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-10 12:49:10,847 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-10 12:49:11,104 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2018-11-10 12:49:11,210 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:11,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:11,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:11,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:11,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:11,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:11,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:11,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:11,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-11-10 12:49:11,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:11,211 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:11,228 INFO 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 12:49:11,231 INFO 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 12:49:11,232 INFO 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 12:49:11,233 INFO 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 12:49:11,234 INFO 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 12:49:11,235 INFO 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 12:49:11,237 INFO 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 12:49:11,238 INFO 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 12:49:11,239 INFO 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 12:49:11,240 INFO 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 12:49:11,242 INFO 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 12:49:11,243 INFO 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 12:49:11,244 INFO 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 12:49:11,246 INFO 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 12:49:11,247 INFO 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 12:49:11,248 INFO 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 12:49:11,249 INFO 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 12:49:11,251 INFO 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 12:49:11,462 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-11-10 12:49:11,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:11,953 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:11,957 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:11,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:11,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:11,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:11,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:11,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:11,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:11,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:11,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:11,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:11,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:11,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:11,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:11,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:11,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:11,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:11,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:11,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:11,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:11,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:11,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:11,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:11,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:11,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:11,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:11,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:11,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:11,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:11,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:12,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:12,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:12,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:12,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:12,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:12,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:12,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:12,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:12,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:12,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:12,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:12,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:12,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:12,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:12,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:12,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:12,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:12,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:12,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:12,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:12,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:12,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:12,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:12,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:12,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:12,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:12,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:12,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:12,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:12,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:12,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:12,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:12,016 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:49:12,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,018 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:49:12,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:12,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:12,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:12,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:12,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:12,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:12,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:12,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:12,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:12,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:12,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:12,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:12,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:12,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:12,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:12,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:12,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:12,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:12,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:12,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:12,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:12,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:12,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:12,098 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:49:12,098 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:49:12,099 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:12,100 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:49:12,101 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:12,101 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2018-11-10 12:49:12,143 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 12:49:12,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:49:12,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:12,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:12,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:12,213 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 12:49:12,215 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 12:49:12,216 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 32 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 12:49:12,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 32 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 44 states and 51 transitions. Complement of second has 6 states. [2018-11-10 12:49:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:49:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-10 12:49:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 15 letters. [2018-11-10 12:49:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 27 letters. Loop has 15 letters. [2018-11-10 12:49:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 30 letters. [2018-11-10 12:49:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:12,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2018-11-10 12:49:12,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 12:49:12,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 48 transitions. [2018-11-10 12:49:12,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 12:49:12,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 12:49:12,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2018-11-10 12:49:12,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:12,282 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-10 12:49:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2018-11-10 12:49:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-10 12:49:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 12:49:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-10 12:49:12,285 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-10 12:49:12,285 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-10 12:49:12,285 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:49:12,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2018-11-10 12:49:12,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:49:12,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:12,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:12,286 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 12:49:12,286 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 12:49:12,287 INFO L793 eck$LassoCheckResult]: Stem: 412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 389#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 390#L14 assume !(build_nondet_String_~length~0 < 1); 403#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 384#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 382#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 383#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 399#L14-3 assume !(build_nondet_String_~length~0 < 1); 400#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 380#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 374#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 375#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 376#L31-5 assume true; 378#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 385#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 386#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 410#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 405#L34-9 [2018-11-10 12:49:12,287 INFO L795 eck$LassoCheckResult]: Loop: 405#L34-9 assume true; 401#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 397#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 391#L34-3 assume !cstrpbrk_#t~short7; 392#L34-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 405#L34-9 [2018-11-10 12:49:12,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 1 times [2018-11-10 12:49:12,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:12,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:12,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:12,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:12,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash 66864142, now seen corresponding path program 1 times [2018-11-10 12:49:12,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:12,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:12,327 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 12:49:12,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:12,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:49:12,328 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:12,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:12,328 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 12:49:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:12,338 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-10 12:49:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:12,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2018-11-10 12:49:12,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:49:12,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 44 transitions. [2018-11-10 12:49:12,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 12:49:12,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 12:49:12,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2018-11-10 12:49:12,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:12,341 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-10 12:49:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2018-11-10 12:49:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-10 12:49:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 12:49:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-10 12:49:12,343 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-10 12:49:12,343 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-10 12:49:12,343 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:49:12,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-11-10 12:49:12,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:49:12,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:12,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:12,346 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 12:49:12,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:12,347 INFO L793 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 480#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 481#L14 assume !(build_nondet_String_~length~0 < 1); 488#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 471#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 469#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 470#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 484#L14-3 assume !(build_nondet_String_~length~0 < 1); 485#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 467#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 461#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 462#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 463#L31-5 assume true; 465#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 472#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 473#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 498#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 491#L34-9 [2018-11-10 12:49:12,347 INFO L795 eck$LassoCheckResult]: Loop: 491#L34-9 assume true; 486#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 482#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 476#L34-3 assume cstrpbrk_#t~short7; 477#L34-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-4 495#L34-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 490#L34-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 491#L34-9 [2018-11-10 12:49:12,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 2 times [2018-11-10 12:49:12,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:12,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:12,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:12,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:12,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:12,368 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 1 times [2018-11-10 12:49:12,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:12,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:12,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:12,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:12,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:12,377 INFO L82 PathProgramCache]: Analyzing trace with hash 462232030, now seen corresponding path program 1 times [2018-11-10 12:49:12,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:12,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:12,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:12,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:12,824 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 140 [2018-11-10 12:49:12,915 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:12,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:12,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:12,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:12,915 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:12,915 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:12,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:12,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:12,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration5_Lasso [2018-11-10 12:49:12,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:12,916 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:12,920 INFO 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 12:49:12,923 INFO 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 12:49:12,924 INFO 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 12:49:12,925 INFO 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 12:49:12,926 INFO 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 12:49:12,927 INFO 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 12:49:12,929 INFO 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 12:49:12,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:12,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:12,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:12,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:12,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:12,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:12,937 INFO 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 12:49:12,938 INFO 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 12:49:13,163 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2018-11-10 12:49:13,231 INFO 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 12:49:13,232 INFO 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 12:49:13,233 INFO 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 12:49:13,234 INFO 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 12:49:13,703 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:13,703 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:13,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:13,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:13,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:13,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:13,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:13,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:13,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:13,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:13,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,744 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:49:13,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,746 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:49:13,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,754 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:49:13,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,755 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:49:13,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,772 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:49:13,772 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 12:49:13,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,788 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-10 12:49:13,788 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 12:49:13,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:13,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:13,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:49:13,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:13,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:13,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:13,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:13,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:13,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:13,889 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:13,903 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:49:13,903 INFO L444 ModelExtractionUtils]: 57 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:49:13,904 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:13,904 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:49:13,905 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:13,905 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-10 12:49:13,966 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 12:49:13,968 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:49:13,968 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:49:13,969 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 12:49:13,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:14,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:14,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:14,063 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 12:49:14,063 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 12:49:14,063 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-11-10 12:49:14,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 90 states and 98 transitions. Complement of second has 11 states. [2018-11-10 12:49:14,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:49:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-10 12:49:14,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-10 12:49:14,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:14,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-10 12:49:14,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:14,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-10 12:49:14,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:14,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 98 transitions. [2018-11-10 12:49:14,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:49:14,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 64 states and 70 transitions. [2018-11-10 12:49:14,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 12:49:14,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 12:49:14,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 70 transitions. [2018-11-10 12:49:14,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:14,162 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-11-10 12:49:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 70 transitions. [2018-11-10 12:49:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-11-10 12:49:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 12:49:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-10 12:49:14,165 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 12:49:14,165 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 12:49:14,165 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:49:14,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 61 transitions. [2018-11-10 12:49:14,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:49:14,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:14,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:14,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:14,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:14,171 INFO L793 eck$LassoCheckResult]: Stem: 789#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 770#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 771#L14 assume !(build_nondet_String_~length~0 < 1); 778#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 760#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 758#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 759#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 774#L14-3 assume !(build_nondet_String_~length~0 < 1); 775#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 756#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 749#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 750#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 751#L31-5 assume true; 752#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 763#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 764#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 787#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 788#L34-9 assume true; 777#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 773#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 768#L34-3 assume cstrpbrk_#t~short7; 769#L34-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-4 785#L34-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 782#L34-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 783#L34-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-10 779#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 757#L31-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 753#L31-5 assume true; 755#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 761#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 762#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 786#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 781#L34-9 [2018-11-10 12:49:14,171 INFO L795 eck$LassoCheckResult]: Loop: 781#L34-9 assume true; 776#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 772#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 766#L34-3 assume cstrpbrk_#t~short7; 767#L34-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-4 784#L34-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 780#L34-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 781#L34-9 [2018-11-10 12:49:14,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1822686176, now seen corresponding path program 2 times [2018-11-10 12:49:14,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:14,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:14,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:14,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:14,193 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 2 times [2018-11-10 12:49:14,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:14,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:14,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:14,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:14,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1008039506, now seen corresponding path program 1 times [2018-11-10 12:49:14,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:14,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:14,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:14,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:14,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:14,994 WARN L179 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 176 [2018-11-10 12:49:15,627 WARN L179 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2018-11-10 12:49:15,629 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:15,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:15,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:15,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:15,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:15,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:15,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:15,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:15,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-10 12:49:15,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:15,629 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:15,635 INFO 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 12:49:15,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:15,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:15,643 INFO 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 12:49:15,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:15,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:15,647 INFO 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 12:49:15,647 INFO 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 12:49:15,648 INFO 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 12:49:15,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:15,651 INFO 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 12:49:15,767 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:49:16,317 WARN L179 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 116 [2018-11-10 12:49:16,401 INFO 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 12:49:16,402 INFO 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 12:49:16,403 INFO 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 12:49:16,405 INFO 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 12:49:16,406 INFO 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 12:49:16,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:16,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:16,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:49:16,807 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-10 12:49:17,039 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:17,039 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:17,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:17,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:17,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:17,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:17,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:17,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:17,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:17,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:17,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:17,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:17,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:17,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:17,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:17,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:17,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:17,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:17,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:17,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:17,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:17,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:17,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,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 12:49:17,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:17,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:17,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:17,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:17,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:17,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:17,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:17,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:17,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:17,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:17,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,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 12:49:17,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,064 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-10 12:49:17,064 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 12:49:17,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,081 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-10 12:49:17,082 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 12:49:17,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:17,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:17,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:17,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:17,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,191 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:49:17,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:49:17,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:17,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:17,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:49:17,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:17,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:17,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:17,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:17,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:49:17,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:49:17,215 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:17,227 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:49:17,227 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:49:17,228 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:17,228 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:49:17,229 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:17,229 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 Supporting invariants [] [2018-11-10 12:49:17,314 INFO L297 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 12:49:17,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:49:17,316 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:49:17,317 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 12:49:17,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:17,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:17,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:17,395 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 12:49:17,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 12:49:17,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 12:49:17,471 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 84 states and 90 transitions. Complement of second has 11 states. [2018-11-10 12:49:17,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:49:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-10 12:49:17,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 32 letters. Loop has 7 letters. [2018-11-10 12:49:17,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:17,473 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:49:17,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:17,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:17,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:17,540 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 12:49:17,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 12:49:17,541 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 12:49:17,610 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 84 states and 90 transitions. Complement of second has 11 states. [2018-11-10 12:49:17,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:49:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-10 12:49:17,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 32 letters. Loop has 7 letters. [2018-11-10 12:49:17,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:17,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:49:17,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:17,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:17,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:17,680 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 12:49:17,681 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 12:49:17,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 12:49:17,754 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 89 states and 96 transitions. Complement of second has 10 states. [2018-11-10 12:49:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:49:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2018-11-10 12:49:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 32 letters. Loop has 7 letters. [2018-11-10 12:49:17,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 39 letters. Loop has 7 letters. [2018-11-10 12:49:17,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:17,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 32 letters. Loop has 14 letters. [2018-11-10 12:49:17,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:17,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 96 transitions. [2018-11-10 12:49:17,760 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:49:17,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 0 states and 0 transitions. [2018-11-10 12:49:17,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:49:17,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:49:17,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:49:17,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:49:17,761 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:49:17,761 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:49:17,761 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:49:17,761 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:49:17,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:49:17,761 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:49:17,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:49:17,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:49:17 BoogieIcfgContainer [2018-11-10 12:49:17,768 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:49:17,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:49:17,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:49:17,769 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:49:17,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:09" (3/4) ... [2018-11-10 12:49:17,772 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:49:17,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:49:17,773 INFO L168 Benchmark]: Toolchain (without parser) took 8409.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.9 MB). Free memory was 960.3 MB in the beginning and 828.6 MB in the end (delta: 131.8 MB). Peak memory consumption was 518.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:17,774 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:49:17,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.26 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:17,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.21 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:17,775 INFO L168 Benchmark]: Boogie Preprocessor took 14.89 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:49:17,776 INFO L168 Benchmark]: RCFGBuilder took 242.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:17,776 INFO L168 Benchmark]: BuchiAutomizer took 7967.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.0 MB). Free memory was 1.1 GB in the beginning and 828.6 MB in the end (delta: 286.1 MB). Peak memory consumption was 534.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:17,777 INFO L168 Benchmark]: Witness Printer took 4.17 ms. Allocated memory is still 1.4 GB. Free memory is still 828.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:49:17,779 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.26 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.21 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.89 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 242.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7967.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.0 MB). Free memory was 1.1 GB in the beginning and 828.6 MB in the end (delta: 286.1 MB). Peak memory consumption was 534.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.17 ms. Allocated memory is still 1.4 GB. Free memory is still 828.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 8 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 203 SDtfs, 280 SDslu, 245 SDs, 0 SdLazy, 278 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital384 mio100 ax100 hnf99 lsp91 ukn83 mio100 lsp30 div124 bol100 ite100 ukn100 eq170 hnf82 smp90 dnf632 smp25 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 119ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...