./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ed241b7ea3188deab01745f11227ce75decf7bc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:02:15,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:02:15,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:02:15,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:02:15,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:02:15,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:02:15,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:02:15,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:02:15,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:02:15,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:02:15,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:02:15,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:02:15,386 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:02:15,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:02:15,387 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:02:15,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:02:15,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:02:15,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:02:15,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:02:15,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:02:15,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:02:15,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:02:15,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:02:15,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:02:15,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:02:15,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:02:15,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:02:15,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:02:15,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:02:15,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:02:15,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:02:15,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:02:15,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:02:15,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:02:15,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:02:15,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:02:15,400 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:02:15,410 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:02:15,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:02:15,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:02:15,411 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:02:15,411 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:02:15,411 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:02:15,412 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:02:15,412 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:02:15,412 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:02:15,412 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:02:15,412 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:02:15,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:02:15,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:02:15,413 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:02:15,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:02:15,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:02:15,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:02:15,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:02:15,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:02:15,413 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:02:15,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:02:15,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:02:15,414 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:02:15,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:02:15,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:02:15,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:02:15,414 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:02:15,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:02:15,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:02:15,415 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:02:15,415 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:02:15,416 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_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ed241b7ea3188deab01745f11227ce75decf7bc [2018-11-10 03:02:15,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:02:15,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:02:15,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:02:15,451 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:02:15,452 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:02:15,452 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:02:15,496 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/data/117140ef7/7a7b8138bcd147b3bb35eefeec747e35/FLAG55a7d4dee [2018-11-10 03:02:15,878 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:02:15,879 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:02:15,887 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/data/117140ef7/7a7b8138bcd147b3bb35eefeec747e35/FLAG55a7d4dee [2018-11-10 03:02:15,895 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/data/117140ef7/7a7b8138bcd147b3bb35eefeec747e35 [2018-11-10 03:02:15,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:02:15,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:02:15,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:02:15,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:02:15,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:02:15,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:02:15" (1/1) ... [2018-11-10 03:02:15,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1039c3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:15, skipping insertion in model container [2018-11-10 03:02:15,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:02:15" (1/1) ... [2018-11-10 03:02:15,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:02:15,942 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:02:16,120 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:02:16,127 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:02:16,154 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:02:16,177 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:02:16,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16 WrapperNode [2018-11-10 03:02:16,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:02:16,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:02:16,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:02:16,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:02:16,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:02:16,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:02:16,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:02:16,247 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:02:16,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... [2018-11-10 03:02:16,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:02:16,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:02:16,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:02:16,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:02:16,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_841a542c-0c03-4f19-bc2b-c22f298c4d72/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:02:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:02:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:02:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:02:16,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:02:16,464 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:02:16,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:02:16 BoogieIcfgContainer [2018-11-10 03:02:16,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:02:16,466 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:02:16,466 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:02:16,469 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:02:16,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:02:16,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:02:15" (1/3) ... [2018-11-10 03:02:16,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@484a8d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:02:16, skipping insertion in model container [2018-11-10 03:02:16,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:02:16,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:16" (2/3) ... [2018-11-10 03:02:16,471 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@484a8d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:02:16, skipping insertion in model container [2018-11-10 03:02:16,471 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:02:16,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:02:16" (3/3) ... [2018-11-10 03:02:16,472 INFO L375 chiAutomizerObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:02:16,513 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:02:16,514 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:02:16,514 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:02:16,514 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:02:16,514 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:02:16,514 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:02:16,514 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:02:16,514 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:02:16,514 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:02:16,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 03:02:16,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 03:02:16,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:02:16,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:02:16,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:02:16,540 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:02:16,541 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:02:16,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 03:02:16,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 03:02:16,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:02:16,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:02:16,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:02:16,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:02:16,549 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 13#L556true assume !(main_~length1~0 < 1); 18#L556-2true assume !(main_~length2~0 < 1); 3#L559-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 20#L564true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L564 23#L564-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L564-1 17#L565true assume { :begin_inline_subseq } true;subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 12#L544-9true [2018-11-10 03:02:16,549 INFO L795 eck$LassoCheckResult]: Loop: 12#L544-9true assume true; 5#L544-1true SUMMARY for call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1); srcloc: L544-1 21#L544-2true subseq_#t~short4 := subseq_#t~mem2 != 0; 24#L544-3true assume !subseq_#t~short4; 11#L544-7true assume !!subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;havoc subseq_#t~short4; 14#L545true SUMMARY for call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1); srcloc: L545 16#L545-1true SUMMARY for call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); srcloc: L545-1 19#L545-2true assume subseq_#t~mem5 == subseq_#t~mem6;havoc subseq_#t~mem6;havoc subseq_#t~mem5;subseq_#t~post7.base, subseq_#t~post7.offset := subseq_~ps~0.base, subseq_~ps~0.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_#t~post7.base, subseq_#t~post7.offset + 1;havoc subseq_#t~post7.base, subseq_#t~post7.offset; 7#L545-4true subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, subseq_#t~post8.offset + 1;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 12#L544-9true [2018-11-10 03:02:16,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:02:16,554 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 03:02:16,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:02:16,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:02:16,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:02:16,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:02:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:02:16,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:02:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash -762847103, now seen corresponding path program 1 times [2018-11-10 03:02:16,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:02:16,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:02:16,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:02:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:02:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:02:16,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:02:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:02:16,685 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:02:16,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:02:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:02:16,696 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-11-10 03:02:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:02:16,713 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-10 03:02:16,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:02:16,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-10 03:02:16,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 03:02:16,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 22 transitions. [2018-11-10 03:02:16,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 03:02:16,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 03:02:16,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 03:02:16,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:02:16,721 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 03:02:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 03:02:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 03:02:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 03:02:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 03:02:16,742 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 03:02:16,742 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 03:02:16,742 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:02:16,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 03:02:16,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 03:02:16,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:02:16,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:02:16,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:02:16,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:02:16,744 INFO L793 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 73#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 66#L556 assume !(main_~length1~0 < 1); 67#L556-2 assume !(main_~length2~0 < 1); 62#L559-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 63#L564 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L564 74#L564-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L564-1 70#L565 assume { :begin_inline_subseq } true;subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 64#L544-9 [2018-11-10 03:02:16,744 INFO L795 eck$LassoCheckResult]: Loop: 64#L544-9 assume true; 65#L544-1 SUMMARY for call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1); srcloc: L544-1 71#L544-2 subseq_#t~short4 := subseq_#t~mem2 != 0; 75#L544-3 assume subseq_#t~short4; 77#L544-4 SUMMARY for call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); srcloc: L544-4 78#L544-5 subseq_#t~short4 := subseq_#t~mem3 != 0; 60#L544-7 assume !!subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;havoc subseq_#t~short4; 61#L545 SUMMARY for call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1); srcloc: L545 68#L545-1 SUMMARY for call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); srcloc: L545-1 69#L545-2 assume subseq_#t~mem5 == subseq_#t~mem6;havoc subseq_#t~mem6;havoc subseq_#t~mem5;subseq_#t~post7.base, subseq_#t~post7.offset := subseq_~ps~0.base, subseq_~ps~0.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_#t~post7.base, subseq_#t~post7.offset + 1;havoc subseq_#t~post7.base, subseq_#t~post7.offset; 72#L545-4 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, subseq_#t~post8.offset + 1;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 64#L544-9 [2018-11-10 03:02:16,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:02:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 03:02:16,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:02:16,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:02:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:02:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:02:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:02:16,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:02:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash -990164860, now seen corresponding path program 1 times [2018-11-10 03:02:16,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:02:16,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:02:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:02:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:02:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:02:16,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:02:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1710917862, now seen corresponding path program 1 times [2018-11-10 03:02:16,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:02:16,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:02:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:02:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:02:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:02:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:02:16,961 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-11-10 03:02:17,202 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-11-10 03:02:17,303 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:02:17,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:02:17,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:02:17,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:02:17,305 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:02:17,305 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:02:17,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:02:17,305 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:02:17,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 03:02:17,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:02:17,306 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:02:17,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,617 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-10 03:02:17,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:17,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:02:18,128 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:02:18,131 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:02:18,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:02:18,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:02:18,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:02:18,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:02:18,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:02:18,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:02:18,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:02:18,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:02:18,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:02:18,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:02:18,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:02:18,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:02:18,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:02:18,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:02:18,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:02:18,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:02:18,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:02:18,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:02:18,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:02:18,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:02:18,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:02:18,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,184 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:02:18,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,187 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:02:18,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:02:18,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:02:18,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,204 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:02:18,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,204 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:02:18,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:02:18,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:02:18,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:02:18,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:02:18,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:02:18,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:02:18,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:02:18,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:02:18,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:02:18,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:02:18,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:02:18,252 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:02:18,281 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:02:18,281 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 03:02:18,283 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:02:18,284 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:02:18,284 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:02:18,284 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_subseq_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 1*ULTIMATE.start_subseq_~pt~0.offset Supporting invariants [] [2018-11-10 03:02:18,339 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 03:02:18,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:02:18,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:02:18,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:02:18,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:02:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:02:18,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:02:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:02:18,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:02:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:02:18,433 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-11-10 03:02:18,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-10 03:02:18,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-11-10 03:02:18,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:02:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:02:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-10 03:02:18,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 11 letters. [2018-11-10 03:02:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:02:18,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 11 letters. [2018-11-10 03:02:18,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:02:18,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 22 letters. [2018-11-10 03:02:18,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:02:18,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-10 03:02:18,479 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:02:18,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-11-10 03:02:18,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:02:18,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:02:18,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:02:18,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:02:18,479 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:02:18,479 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:02:18,479 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:02:18,479 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:02:18,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:02:18,479 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:02:18,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:02:18,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:02:18 BoogieIcfgContainer [2018-11-10 03:02:18,484 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:02:18,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:02:18,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:02:18,484 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:02:18,484 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:02:16" (3/4) ... [2018-11-10 03:02:18,487 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:02:18,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:02:18,488 INFO L168 Benchmark]: Toolchain (without parser) took 2590.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 957.5 MB in the beginning and 1.0 GB in the end (delta: -76.2 MB). Peak memory consumption was 147.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:02:18,489 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:02:18,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.54 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:02:18,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -224.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:02:18,490 INFO L168 Benchmark]: Boogie Preprocessor took 18.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:02:18,490 INFO L168 Benchmark]: RCFGBuilder took 199.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:02:18,491 INFO L168 Benchmark]: BuchiAutomizer took 2018.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.5 MB). Peak memory consumption was 153.2 MB. Max. memory is 11.5 GB. [2018-11-10 03:02:18,491 INFO L168 Benchmark]: Witness Printer took 3.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:02:18,495 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.54 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -224.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 199.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2018.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.5 MB). Peak memory consumption was 153.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * pt and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 44 SDtfs, 18 SDslu, 38 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital229 mio100 ax100 hnf99 lsp97 ukn108 mio100 lsp39 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...