./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/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 2f11210fb32f4d3c697b29c6d0c40652627e6e63 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:57:05,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:57:05,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:57:05,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:57:05,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:57:05,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:57:05,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:57:05,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:57:05,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:57:05,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:57:05,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:57:05,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:57:05,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:57:05,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:57:05,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:57:05,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:57:05,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:57:05,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:57:05,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:57:05,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:57:05,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:57:05,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:57:05,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:57:05,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:57:05,180 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:57:05,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:57:05,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:57:05,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:57:05,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:57:05,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:57:05,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:57:05,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:57:05,183 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:57:05,183 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:57:05,184 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:57:05,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:57:05,184 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 14:57:05,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:57:05,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:57:05,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:57:05,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:57:05,193 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:57:05,193 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 14:57:05,193 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 14:57:05,193 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 14:57:05,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 14:57:05,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:57:05,195 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 14:57:05,195 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:57:05,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 14:57:05,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:57:05,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:57:05,195 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 14:57:05,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:57:05,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 14:57:05,195 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 14:57:05,196 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 14:57:05,196 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_2300d3e8-995d-4c82-b33a-7b888496dd31/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 -> 2f11210fb32f4d3c697b29c6d0c40652627e6e63 [2018-12-02 14:57:05,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:57:05,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:57:05,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:57:05,222 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:57:05,222 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:57:05,222 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i [2018-12-02 14:57:05,255 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/data/83802d989/cc9fff2d20ac4ccd87e0a8930c89b708/FLAG616e29424 [2018-12-02 14:57:05,754 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:57:05,754 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i [2018-12-02 14:57:05,759 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/data/83802d989/cc9fff2d20ac4ccd87e0a8930c89b708/FLAG616e29424 [2018-12-02 14:57:06,240 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/bin-2019/uautomizer/data/83802d989/cc9fff2d20ac4ccd87e0a8930c89b708 [2018-12-02 14:57:06,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:57:06,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:57:06,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:57:06,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:57:06,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:57:06,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75dc6678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06, skipping insertion in model container [2018-12-02 14:57:06,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:57:06,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:57:06,417 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:57:06,424 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:57:06,489 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:57:06,515 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:57:06,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06 WrapperNode [2018-12-02 14:57:06,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:57:06,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:57:06,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:57:06,516 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:57:06,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:57:06,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:57:06,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:57:06,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:57:06,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... [2018-12-02 14:57:06,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:57:06,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:57:06,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:57:06,557 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:57:06,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2300d3e8-995d-4c82-b33a-7b888496dd31/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-12-02 14:57:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:57:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 14:57:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:57:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:57:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:57:06,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:57:06,714 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:57:06,714 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 14:57:06,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:57:06 BoogieIcfgContainer [2018-12-02 14:57:06,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:57:06,715 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 14:57:06,715 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 14:57:06,717 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 14:57:06,718 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:57:06,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:57:06" (1/3) ... [2018-12-02 14:57:06,719 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a1f810c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:57:06, skipping insertion in model container [2018-12-02 14:57:06,719 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:57:06,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:57:06" (2/3) ... [2018-12-02 14:57:06,719 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a1f810c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:57:06, skipping insertion in model container [2018-12-02 14:57:06,719 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:57:06,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:57:06" (3/3) ... [2018-12-02 14:57:06,720 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_reverse_alloca_true-termination.c.i [2018-12-02 14:57:06,753 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:57:06,754 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 14:57:06,754 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 14:57:06,754 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 14:57:06,754 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:57:06,754 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:57:06,754 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 14:57:06,754 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:57:06,754 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 14:57:06,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 14:57:06,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 14:57:06,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:57:06,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:57:06,780 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 14:57:06,780 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 14:57:06,781 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 14:57:06,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 14:57:06,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 14:57:06,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:57:06,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:57:06,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 14:57:06,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 14:57:06,787 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 6#L369-4true [2018-12-02 14:57:06,787 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-12-02 14:57:06,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 14:57:06,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:06,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:06,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-02 14:57:06,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:06,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:06,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:57:06,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:57:06,901 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:57:06,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 14:57:06,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 14:57:06,910 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-02 14:57:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:06,914 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-02 14:57:06,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 14:57:06,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-02 14:57:06,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 14:57:06,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-02 14:57:06,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 14:57:06,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 14:57:06,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-02 14:57:06,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:57:06,920 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 14:57:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-02 14:57:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 14:57:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 14:57:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-02 14:57:06,936 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 14:57:06,936 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 14:57:06,936 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 14:57:06,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-02 14:57:06,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 14:57:06,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:57:06,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:57:06,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 14:57:06,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:06,937 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 47#L369-4 [2018-12-02 14:57:06,937 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2018-12-02 14:57:06,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 14:57:06,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:06,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:06,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:06,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:06,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-02 14:57:06,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:06,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:06,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:57:06,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:06,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:06,972 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-02 14:57:06,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:06,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:07,120 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-02 14:57:07,270 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-02 14:57:07,433 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-12-02 14:57:07,496 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:57:07,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:57:07,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:57:07,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:57:07,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:57:07,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:57:07,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:57:07,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:57:07,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 14:57:07,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:57:07,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:57:07,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:07,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:57:08,158 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:57:08,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:08,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:08,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:08,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:08,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:08,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:08,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:08,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:08,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:08,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,200 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:57:08,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,202 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:57:08,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:08,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:08,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:08,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:08,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:08,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:08,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:08,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:08,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:08,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:57:08,262 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 14:57:08,262 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 14:57:08,264 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:57:08,265 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:57:08,265 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:57:08,265 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 2*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1 Supporting invariants [] [2018-12-02 14:57:08,284 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 14:57:08,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:08,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:08,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:08,344 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-12-02 14:57:08,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 14:57:08,365 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-02 14:57:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 14:57:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:57:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-02 14:57:08,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 14:57:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-02 14:57:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-02 14:57:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:08,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-02 14:57:08,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 14:57:08,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-02 14:57:08,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 14:57:08,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 14:57:08,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-02 14:57:08,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:57:08,370 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 14:57:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-02 14:57:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 14:57:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 14:57:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-02 14:57:08,371 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 14:57:08,371 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 14:57:08,371 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 14:57:08,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-02 14:57:08,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 14:57:08,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:57:08,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:57:08,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:08,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 14:57:08,372 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 177#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 189#L372-5 [2018-12-02 14:57:08,372 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 184#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 185#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 189#L372-5 [2018-12-02 14:57:08,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-02 14:57:08,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:08,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:08,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:08,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-02 14:57:08,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:08,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:08,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:08,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:08,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:08,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:08,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-02 14:57:08,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:08,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:08,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:08,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:08,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:08,694 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2018-12-02 14:57:08,759 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:57:08,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:57:08,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:57:08,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:57:08,759 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:57:08,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:57:08,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:57:08,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:57:08,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 14:57:08,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:57:08,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:57:08,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,930 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-12-02 14:57:08,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:08,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:09,325 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-02 14:57:09,375 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:57:09,376 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:57:09,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:09,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:09,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:09,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:09,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:09,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:09,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:09,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:09,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:09,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,406 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:57:09,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,408 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:57:09,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:09,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:09,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:09,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:09,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:09,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:09,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:09,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:09,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:09,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:09,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:09,465 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:57:09,477 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 14:57:09,477 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 14:57:09,477 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:57:09,478 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:57:09,478 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:57:09,478 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1 Supporting invariants [] [2018-12-02 14:57:09,516 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-12-02 14:57:09,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:09,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:09,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:09,546 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-12-02 14:57:09,546 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 14:57:09,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2018-12-02 14:57:09,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 14:57:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:57:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-02 14:57:09,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 14:57:09,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:09,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 14:57:09,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:09,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 14:57:09,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:09,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-02 14:57:09,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 14:57:09,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-02 14:57:09,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 14:57:09,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 14:57:09,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-02 14:57:09,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:57:09,563 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-02 14:57:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-02 14:57:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-02 14:57:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 14:57:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-02 14:57:09,565 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 14:57:09,565 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 14:57:09,565 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 14:57:09,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-02 14:57:09,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 14:57:09,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:57:09,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:57:09,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:09,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 14:57:09,566 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 355#L382 assume !(main_~length1~0 < 1); 356#L382-2 assume !(main_~length2~0 < 1); 353#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 349#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 350#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 363#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 359#L372-1 assume !cstrpbrk_#t~short210; 360#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 345#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 346#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 347#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 348#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 352#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 362#L372-5 [2018-12-02 14:57:09,566 INFO L796 eck$LassoCheckResult]: Loop: 362#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 357#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 358#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 362#L372-5 [2018-12-02 14:57:09,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-02 14:57:09,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:09,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:09,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:09,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:57:09,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:57:09,600 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:57:09,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-02 14:57:09,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:09,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:09,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:09,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:57:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:57:09,707 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 14:57:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:09,751 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-12-02 14:57:09,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:57:09,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-12-02 14:57:09,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 14:57:09,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-12-02 14:57:09,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 14:57:09,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 14:57:09,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-02 14:57:09,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:57:09,753 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 14:57:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-02 14:57:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-02 14:57:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 14:57:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-02 14:57:09,755 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-02 14:57:09,755 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-02 14:57:09,755 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 14:57:09,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-12-02 14:57:09,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 14:57:09,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:57:09,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:57:09,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:09,756 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 14:57:09,756 INFO L794 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 426#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 427#L382 assume !(main_~length1~0 < 1); 428#L382-2 assume !(main_~length2~0 < 1); 425#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 421#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 422#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 440#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 439#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 438#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 417#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 418#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 419#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 420#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 423#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 434#L372-5 [2018-12-02 14:57:09,756 INFO L796 eck$LassoCheckResult]: Loop: 434#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 429#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 430#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 434#L372-5 [2018-12-02 14:57:09,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-02 14:57:09,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:09,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:57:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:09,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:09,770 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-02 14:57:09,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:09,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:09,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:57:09,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:09,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-02 14:57:09,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:57:09,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:57:09,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:57:09,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:10,234 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 136 [2018-12-02 14:57:10,763 WARN L180 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-12-02 14:57:10,765 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:57:10,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:57:10,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:57:10,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:57:10,765 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:57:10,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:57:10,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:57:10,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:57:10,765 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 14:57:10,765 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:57:10,765 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:57:10,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:10,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:10,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:10,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:10,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:10,918 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:57:11,291 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2018-12-02 14:57:11,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:57:11,618 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2018-12-02 14:57:11,685 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:57:13,918 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 137 DAG size of output: 84 [2018-12-02 14:57:14,208 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-02 14:57:14,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:57:14,223 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:57:14,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:14,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:14,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:14,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:14,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:14,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:14,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:14,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:14,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:14,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:14,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:14,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:14,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:14,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:14,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:14,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:14,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:14,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:14,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:14,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:14,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:14,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:14,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:14,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:14,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:14,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:14,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:14,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:14,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:14,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:57:14,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:14,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:14,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:14,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:57:14,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:57:14,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:14,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:14,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:14,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:14,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:14,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:14,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:14,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:14,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:14,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:14,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:14,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:14,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:14,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:14,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:14,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:14,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:57:14,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:57:14,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:57:14,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:57:14,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:57:14,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:57:14,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:57:14,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:57:14,248 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:57:14,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 14:57:14,253 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 14:57:14,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:57:14,254 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:57:14,254 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:57:14,254 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1 Supporting invariants [] [2018-12-02 14:57:14,355 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2018-12-02 14:57:14,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:14,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:14,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:14,382 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-12-02 14:57:14,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-02 14:57:14,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2018-12-02 14:57:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 14:57:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:57:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-02 14:57:14,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 14:57:14,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:14,395 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:57:14,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:14,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:14,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:14,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 14:57:14,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-02 14:57:14,434 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2018-12-02 14:57:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 14:57:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:57:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-02 14:57:14,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 14:57:14,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:14,435 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:57:14,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:14,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:14,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:14,470 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 14:57:14,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-02 14:57:14,480 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2018-12-02 14:57:14,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 14:57:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:57:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-12-02 14:57:14,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 14:57:14,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:14,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 14:57:14,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:14,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 14:57:14,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:57:14,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-02 14:57:14,482 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 14:57:14,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-02 14:57:14,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 14:57:14,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 14:57:14,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 14:57:14,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:57:14,483 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:57:14,483 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:57:14,483 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:57:14,483 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 14:57:14,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:57:14,483 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 14:57:14,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 14:57:14,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:57:14 BoogieIcfgContainer [2018-12-02 14:57:14,487 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 14:57:14,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:57:14,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:57:14,487 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:57:14,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:57:06" (3/4) ... [2018-12-02 14:57:14,489 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 14:57:14,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:57:14,490 INFO L168 Benchmark]: Toolchain (without parser) took 8247.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 376.4 MB). Free memory was 956.0 MB in the beginning and 1.3 GB in the end (delta: -363.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:14,490 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:57:14,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:14,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:57:14,491 INFO L168 Benchmark]: Boogie Preprocessor took 14.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:14,491 INFO L168 Benchmark]: RCFGBuilder took 157.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:14,492 INFO L168 Benchmark]: BuchiAutomizer took 7771.82 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 257.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -243.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:14,492 INFO L168 Benchmark]: Witness Printer took 2.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:57:14,494 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7771.82 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 257.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -243.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 120 SDtfs, 120 SDslu, 58 SDs, 0 SdLazy, 78 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital367 mio100 ax100 hnf99 lsp92 ukn73 mio100 lsp63 div102 bol100 ite100 ukn100 eq192 hnf88 smp79 dnf1409 smp30 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...