./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_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_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/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 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:40:51,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:40:51,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:40:51,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:40:51,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:40:51,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:40:51,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:40:51,362 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:40:51,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:40:51,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:40:51,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:40:51,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:40:51,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:40:51,366 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:40:51,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:40:51,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:40:51,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:40:51,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:40:51,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:40:51,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:40:51,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:40:51,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:40:51,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:40:51,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:40:51,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:40:51,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:40:51,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:40:51,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:40:51,379 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:40:51,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:40:51,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:40:51,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:40:51,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:40:51,380 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:40:51,381 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:40:51,381 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:40:51,382 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 05:40:51,393 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:40:51,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:40:51,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:40:51,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:40:51,394 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:40:51,394 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 05:40:51,394 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 05:40:51,394 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 05:40:51,395 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 05:40:51,395 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 05:40:51,395 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 05:40:51,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:40:51,395 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:40:51,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:40:51,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:40:51,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 05:40:51,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 05:40:51,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 05:40:51,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:40:51,396 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 05:40:51,396 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:40:51,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 05:40:51,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:40:51,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:40:51,397 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 05:40:51,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:40:51,397 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:40:51,397 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 05:40:51,398 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 05:40:51,398 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_60bcfe59-7972-4025-892b-cd60a9dc692b/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 -> 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca [2018-12-02 05:40:51,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:40:51,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:40:51,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:40:51,430 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:40:51,430 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:40:51,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i [2018-12-02 05:40:51,466 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/data/615cc57b5/15f3aa9dc66745c5a39640efea93dd26/FLAG00c3411f4 [2018-12-02 05:40:51,789 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:40:51,790 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i [2018-12-02 05:40:51,795 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/data/615cc57b5/15f3aa9dc66745c5a39640efea93dd26/FLAG00c3411f4 [2018-12-02 05:40:51,803 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/bin-2019/uautomizer/data/615cc57b5/15f3aa9dc66745c5a39640efea93dd26 [2018-12-02 05:40:51,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:40:51,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:40:51,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:40:51,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:40:51,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:40:51,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:40:51" (1/1) ... [2018-12-02 05:40:51,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5243922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:51, skipping insertion in model container [2018-12-02 05:40:51,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:40:51" (1/1) ... [2018-12-02 05:40:51,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:40:51,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:40:51,982 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:40:51,989 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:40:52,051 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:40:52,086 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:40:52,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52 WrapperNode [2018-12-02 05:40:52,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:40:52,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:40:52,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:40:52,087 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:40:52,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:40:52,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:40:52,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:40:52,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:40:52,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... [2018-12-02 05:40:52,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:40:52,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:40:52,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:40:52,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:40:52,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60bcfe59-7972-4025-892b-cd60a9dc692b/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 05:40:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:40:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 05:40:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:40:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:40:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:40:52,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:40:52,299 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:40:52,300 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 05:40:52,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:40:52 BoogieIcfgContainer [2018-12-02 05:40:52,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:40:52,300 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 05:40:52,300 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 05:40:52,302 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 05:40:52,303 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 05:40:52,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 05:40:51" (1/3) ... [2018-12-02 05:40:52,303 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3abd5a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:40:52, skipping insertion in model container [2018-12-02 05:40:52,304 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 05:40:52,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:40:52" (2/3) ... [2018-12-02 05:40:52,304 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3abd5a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:40:52, skipping insertion in model container [2018-12-02 05:40:52,304 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 05:40:52,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:40:52" (3/3) ... [2018-12-02 05:40:52,305 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_diffterm_alloca_true-termination.c.i [2018-12-02 05:40:52,334 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:40:52,335 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 05:40:52,335 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 05:40:52,335 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 05:40:52,335 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:40:52,335 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:40:52,335 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 05:40:52,335 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:40:52,335 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 05:40:52,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 05:40:52,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 05:40:52,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:40:52,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:40:52,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 05:40:52,362 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 05:40:52,362 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 05:40:52,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 05:40:52,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 05:40:52,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:40:52,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:40:52,363 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 05:40:52,363 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 05:40:52,368 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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, 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; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2018-12-02 05:40:52,368 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2018-12-02 05:40:52,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 05:40:52,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:52,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:52,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:52,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:52,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:52,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-02 05:40:52,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:52,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:52,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:52,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:52,474 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 05:40:52,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:52,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:40:52,478 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:40:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 05:40:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:40:52,488 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-02 05:40:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:52,492 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-02 05:40:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 05:40:52,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-02 05:40:52,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 05:40:52,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-02 05:40:52,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 05:40:52,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 05:40:52,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-02 05:40:52,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:40:52,497 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 05:40:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-02 05:40:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 05:40:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 05:40:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-02 05:40:52,514 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 05:40:52,514 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 05:40:52,514 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 05:40:52,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-02 05:40:52,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 05:40:52,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:40:52,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:40:52,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 05:40:52,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:52,515 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, 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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2018-12-02 05:40:52,515 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2018-12-02 05:40:52,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:52,515 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 05:40:52,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:52,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:52,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:52,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:52,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-02 05:40:52,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:52,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:52,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:40:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:52,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-02 05:40:52,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:52,694 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-02 05:40:52,847 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-02 05:40:52,993 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-12-02 05:40:53,057 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 05:40:53,058 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 05:40:53,058 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 05:40:53,058 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 05:40:53,058 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 05:40:53,058 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 05:40:53,058 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 05:40:53,058 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 05:40:53,058 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 05:40:53,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 05:40:53,059 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 05:40:53,072 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 05:40:53,075 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 05:40:53,078 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 05:40:53,079 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 05:40:53,080 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 05:40:53,083 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 05:40:53,085 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 05:40:53,338 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 05:40:53,339 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 05:40:53,340 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 05:40:53,341 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 05:40:53,345 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 05:40:53,346 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 05:40:53,347 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 05:40:53,348 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 05:40:53,349 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 05:40:53,350 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 05:40:53,351 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 05:40:53,719 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 05:40:53,723 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 05:40:53,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 05:40:53,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:53,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:53,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:53,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:53,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:53,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:53,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:53,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:53,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 05:40:53,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:53,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:53,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:53,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:53,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:53,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:53,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:53,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:53,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:53,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:53,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:53,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:53,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:53,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:53,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:53,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:53,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 05:40:53,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:53,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:53,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:53,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:53,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:53,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:53,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:53,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:53,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:53,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:53,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:53,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:53,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:53,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:53,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:53,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:53,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 05:40:53,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:53,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:53,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:53,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:53,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:53,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:53,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:53,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:53,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:53,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:53,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:53,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:53,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:53,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:53,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:53,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 05:40:53,790 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 05:40:53,790 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 05:40:53,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 05:40:53,792 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 05:40:53,792 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 05:40:53,793 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-12-02 05:40:53,814 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 05:40:53,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 05:40:53,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:53,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:53,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:53,882 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 05:40:53,885 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 05:40:53,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 05:40:53,923 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 05:40:53,923 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 05:40:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 05:40:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-02 05:40:53,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 05:40:53,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:53,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-02 05:40:53,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:53,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-02 05:40:53,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:53,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-02 05:40:53,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 05:40:53,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-02 05:40:53,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 05:40:53,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 05:40:53,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-02 05:40:53,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 05:40:53,927 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 05:40:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-02 05:40:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 05:40:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 05:40:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-02 05:40:53,928 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 05:40:53,928 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 05:40:53,928 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 05:40:53,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-02 05:40:53,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 05:40:53,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:40:53,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:40:53,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:53,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 05:40:53,929 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#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, 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; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 182#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 184#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 194#L372-5 [2018-12-02 05:40:53,929 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 189#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 194#L372-5 [2018-12-02 05:40:53,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-02 05:40:53,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:53,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:53,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:53,943 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-02 05:40:53,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:53,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:53,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:53,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:53,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:53,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-02 05:40:53,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:53,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:53,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:53,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:54,236 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2018-12-02 05:40:54,300 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 05:40:54,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 05:40:54,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 05:40:54,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 05:40:54,300 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 05:40:54,300 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 05:40:54,300 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 05:40:54,300 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 05:40:54,300 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 05:40:54,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 05:40:54,300 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 05:40:54,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:54,304 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 05:40:54,304 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 05:40:54,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:54,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:54,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 05:40:54,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 05:40:54,525 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 05:40:54,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 05:40:54,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 05:40:54,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 05:40:54,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 05:40:54,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 05:40:54,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 05:40:54,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 05:40:54,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 05:40:54,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 05:40:54,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 05:40:54,901 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-02 05:40:54,931 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 05:40:54,931 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 05:40:54,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:54,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:54,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:54,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:54,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:54,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:54,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:54,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:54,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:54,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:54,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:54,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:54,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:54,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:54,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:54,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:54,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:54,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:54,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:54,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:54,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:54,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:54,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:54,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:54,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:54,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:54,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:54,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,951 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 05:40:54,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,953 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 05:40:54,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:54,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:54,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,962 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 05:40:54,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,963 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 05:40:54,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:54,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:54,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:54,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:54,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:54,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:54,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:54,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:54,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:55,000 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 05:40:55,010 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 05:40:55,010 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 05:40:55,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 05:40:55,011 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 05:40:55,011 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 05:40:55,012 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-12-02 05:40:55,055 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-02 05:40:55,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 05:40:55,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:55,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:55,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:40:55,098 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 05:40:55,098 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-02 05:40:55,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-02 05:40:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 05:40:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 05:40:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 05:40:55,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 05:40:55,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:55,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 05:40:55,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:55,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 05:40:55,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:55,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-02 05:40:55,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 05:40:55,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-02 05:40:55,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 05:40:55,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 05:40:55,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-02 05:40:55,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 05:40:55,130 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-02 05:40:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-02 05:40:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-02 05:40:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 05:40:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-02 05:40:55,132 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 05:40:55,132 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 05:40:55,132 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 05:40:55,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-02 05:40:55,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 05:40:55,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:40:55,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:40:55,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:55,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 05:40:55,133 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#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, 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; 368#L382 assume !(main_~length1~0 < 1); 369#L382-2 assume !(main_~length2~0 < 1); 366#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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 362#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 363#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 376#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 372#L372-1 assume !cstrspn_#t~short210; 373#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 358#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 359#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 360#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 361#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 365#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 375#L372-5 [2018-12-02 05:40:55,133 INFO L796 eck$LassoCheckResult]: Loop: 375#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 370#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 371#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 375#L372-5 [2018-12-02 05:40:55,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-02 05:40:55,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:55,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:55,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:55,169 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 05:40:55,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:55,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:40:55,170 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 05:40:55,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-02 05:40:55,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:40:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:40:55,264 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 05:40:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:55,306 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-12-02 05:40:55,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:40:55,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-12-02 05:40:55,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 05:40:55,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-12-02 05:40:55,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 05:40:55,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 05:40:55,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-02 05:40:55,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 05:40:55,307 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 05:40:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-02 05:40:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-02 05:40:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 05:40:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-02 05:40:55,309 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-02 05:40:55,309 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-02 05:40:55,309 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 05:40:55,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-12-02 05:40:55,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 05:40:55,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:40:55,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:40:55,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:55,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 05:40:55,310 INFO L794 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 439#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, 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; 440#L382 assume !(main_~length1~0 < 1); 441#L382-2 assume !(main_~length2~0 < 1); 438#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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 434#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 435#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 448#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 452#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 451#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 430#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 431#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 432#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 433#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 437#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 447#L372-5 [2018-12-02 05:40:55,310 INFO L796 eck$LassoCheckResult]: Loop: 447#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 443#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 444#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 447#L372-5 [2018-12-02 05:40:55,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-02 05:40:55,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:55,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:40:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:55,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-02 05:40:55,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:55,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:40:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:55,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-02 05:40:55,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:40:55,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:40:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:40:55,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:55,784 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 136 [2018-12-02 05:40:56,883 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2018-12-02 05:40:56,886 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 05:40:56,886 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 05:40:56,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 05:40:56,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 05:40:56,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 05:40:56,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 05:40:56,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 05:40:56,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 05:40:56,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 05:40:56,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 05:40:56,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 05:40:56,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:56,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:56,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:56,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:56,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:56,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:56,907 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 05:40:56,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:57,046 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 05:40:57,469 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2018-12-02 05:40:57,549 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 05:40:57,550 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 05:40:57,551 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 05:40:57,552 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 05:40:57,553 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 05:40:57,554 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 05:40:57,555 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 05:40:57,556 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 05:40:57,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:40:57,558 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 05:40:57,968 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-12-02 05:40:58,072 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-02 05:40:58,195 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 05:40:58,195 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 05:40:58,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 05:40:58,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:58,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:58,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:58,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,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 05:40:58,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:58,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:58,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:58,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 05:40:58,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:58,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:58,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,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 05:40:58,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:58,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:58,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:58,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:58,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:58,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:58,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:58,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 05:40:58,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:58,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:58,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:58,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:58,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:40:58,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:40:58,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:40:58,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 05:40:58,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,207 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-12-02 05:40:58,207 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-12-02 05:40:58,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,237 INFO L402 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2018-12-02 05:40:58,237 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-12-02 05:40:58,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:58,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,334 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 05:40:58,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,335 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 05:40:58,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:58,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:58,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:58,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:58,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:58,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:58,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:58,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:58,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:58,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:58,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:40:58,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 05:40:58,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:40:58,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:40:58,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:40:58,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:40:58,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:40:58,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:40:58,354 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 05:40:58,364 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 05:40:58,365 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 05:40:58,365 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 05:40:58,365 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 05:40:58,365 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 05:40:58,365 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-12-02 05:40:58,457 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-12-02 05:40:58,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 05:40:58,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:58,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:58,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:58,506 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 05:40:58,506 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 05:40:58,506 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 05:40:58,531 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-12-02 05:40:58,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 05:40:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 05:40:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 05:40:58,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 05:40:58,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:58,533 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 05:40:58,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:58,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:58,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:58,579 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 05:40:58,579 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 05:40:58,579 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 05:40:58,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-12-02 05:40:58,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 05:40:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 05:40:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 05:40:58,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 05:40:58,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:58,605 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 05:40:58,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:58,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:58,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:40:58,701 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 05:40:58,702 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 05:40:58,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 05:40:58,739 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-12-02 05:40:58,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 05:40:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 05:40:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-02 05:40:58,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 05:40:58,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:58,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 05:40:58,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:58,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 05:40:58,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:40:58,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-02 05:40:58,742 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 05:40:58,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-02 05:40:58,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 05:40:58,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 05:40:58,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 05:40:58,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:40:58,743 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:40:58,743 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:40:58,743 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:40:58,743 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 05:40:58,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 05:40:58,743 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 05:40:58,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 05:40:58,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 05:40:58 BoogieIcfgContainer [2018-12-02 05:40:58,748 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 05:40:58,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:40:58,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:40:58,749 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:40:58,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:40:52" (3/4) ... [2018-12-02 05:40:58,751 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 05:40:58,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:40:58,752 INFO L168 Benchmark]: Toolchain (without parser) took 6946.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.2 MB). Free memory was 956.0 MB in the beginning and 1.3 GB in the end (delta: -391.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:40:58,752 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 05:40:58,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 05:40:58,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:40:58,753 INFO L168 Benchmark]: Boogie Preprocessor took 20.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:40:58,754 INFO L168 Benchmark]: RCFGBuilder took 158.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:40:58,754 INFO L168 Benchmark]: BuchiAutomizer took 6447.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -263.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:40:58,755 INFO L168 Benchmark]: Witness Printer took 3.03 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 05:40:58,757 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 280.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 158.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6447.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -263.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.03 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -1 * sc1 + unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 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: 105 SDtfs, 118 SDslu, 72 SDs, 0 SdLazy, 103 SolverSat, 25 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 ukn71 mio100 lsp31 div135 bol100 ite100 ukn100 eq165 hnf76 smp93 dnf677 smp32 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 126ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 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...