./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/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 3c7f8519a8c276dd62400de22bd8a8ed2f8e4176 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:05:54,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:05:54,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:05:54,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:05:54,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:05:54,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:05:54,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:05:54,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:05:54,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:05:54,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:05:54,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:05:54,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:05:54,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:05:54,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:05:54,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:05:54,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:05:54,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:05:54,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:05:54,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:05:54,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:05:54,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:05:54,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:05:54,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:05:54,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:05:54,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:05:54,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:05:54,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:05:54,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:05:54,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:05:54,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:05:54,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:05:54,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:05:54,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:05:54,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:05:54,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:05:54,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:05:54,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:05:54,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:05:54,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:05:54,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:05:54,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:05:54,407 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:05:54,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:05:54,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:05:54,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:05:54,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:05:54,455 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:05:54,455 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:05:54,455 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:05:54,456 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:05:54,456 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:05:54,456 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:05:54,457 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:05:54,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:05:54,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:05:54,457 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:05:54,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:05:54,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:05:54,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:05:54,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:05:54,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:05:54,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:05:54,460 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:05:54,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:05:54,460 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:05:54,460 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:05:54,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:05:54,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:05:54,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:05:54,463 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:05:54,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:05:54,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:05:54,464 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:05:54,466 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:05:54,468 INFO L138 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/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/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 -> 3c7f8519a8c276dd62400de22bd8a8ed2f8e4176 [2019-11-16 00:05:54,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:05:54,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:05:54,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:05:54,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:05:54,533 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:05:54,534 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2019-11-16 00:05:54,604 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/data/9437b1d66/c29697624c874baeb9aada1a9f3e7394/FLAGe9d14e01f [2019-11-16 00:05:55,258 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:05:55,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2019-11-16 00:05:55,284 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/data/9437b1d66/c29697624c874baeb9aada1a9f3e7394/FLAGe9d14e01f [2019-11-16 00:05:55,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/data/9437b1d66/c29697624c874baeb9aada1a9f3e7394 [2019-11-16 00:05:55,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:05:55,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:05:55,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:55,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:05:55,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:05:55,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:55" (1/1) ... [2019-11-16 00:05:55,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ded419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:55, skipping insertion in model container [2019-11-16 00:05:55,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:55" (1/1) ... [2019-11-16 00:05:55,494 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:05:55,573 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:05:56,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:56,139 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:05:56,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:56,356 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:05:56,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56 WrapperNode [2019-11-16 00:05:56,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:56,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:05:56,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:05:56,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:05:56,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:05:56,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:05:56,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:05:56,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:05:56,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... [2019-11-16 00:05:56,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:05:56,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:05:56,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:05:56,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:05:56,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/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 [2019-11-16 00:05:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:05:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:05:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:05:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:05:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:05:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:05:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:05:56,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:05:57,040 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:05:57,041 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-16 00:05:57,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:57 BoogieIcfgContainer [2019-11-16 00:05:57,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:05:57,043 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:05:57,043 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:05:57,048 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:05:57,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:05:57,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:05:55" (1/3) ... [2019-11-16 00:05:57,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fddf201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:05:57, skipping insertion in model container [2019-11-16 00:05:57,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:05:57,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:56" (2/3) ... [2019-11-16 00:05:57,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fddf201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:05:57, skipping insertion in model container [2019-11-16 00:05:57,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:05:57,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:57" (3/3) ... [2019-11-16 00:05:57,058 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18.i [2019-11-16 00:05:57,116 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:05:57,117 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:05:57,117 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:05:57,117 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:05:57,117 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:05:57,118 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:05:57,118 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:05:57,118 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:05:57,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:05:57,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:05:57,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:05:57,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:05:57,181 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:05:57,182 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:05:57,182 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:05:57,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:05:57,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:05:57,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:05:57,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:05:57,186 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:05:57,186 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:05:57,192 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 8#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 18#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 12#L530true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 13#L764true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 11#L768-3true [2019-11-16 00:05:57,193 INFO L793 eck$LassoCheckResult]: Loop: 11#L768-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 4#L527-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 15#L530-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 7#L770true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 9#L768-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 11#L768-3true [2019-11-16 00:05:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-11-16 00:05:57,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:57,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336992176] [2019-11-16 00:05:57,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:57,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:57,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:57,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336992176] [2019-11-16 00:05:57,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:57,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:05:57,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250554275] [2019-11-16 00:05:57,476 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:05:57,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 1 times [2019-11-16 00:05:57,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:57,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314552378] [2019-11-16 00:05:57,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:57,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:57,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:57,548 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:57,841 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:05:57,996 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-16 00:05:57,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:58,026 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-11-16 00:05:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:58,132 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-11-16 00:05:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:05:58,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-16 00:05:58,137 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-16 00:05:58,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 25 transitions. [2019-11-16 00:05:58,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:05:58,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:05:58,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-11-16 00:05:58,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:05:58,143 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:05:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-11-16 00:05:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-11-16 00:05:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:05:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-16 00:05:58,171 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-16 00:05:58,171 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-16 00:05:58,171 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:05:58,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-16 00:05:58,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:05:58,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:05:58,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:05:58,173 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:05:58,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:05:58,173 INFO L791 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 67#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 68#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 71#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 72#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 69#L768-3 [2019-11-16 00:05:58,173 INFO L793 eck$LassoCheckResult]: Loop: 69#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 62#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 63#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 64#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 65#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 69#L768-3 [2019-11-16 00:05:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2019-11-16 00:05:58,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:58,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387412269] [2019-11-16 00:05:58,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:58,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:58,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:58,214 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 2 times [2019-11-16 00:05:58,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:58,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400850988] [2019-11-16 00:05:58,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:58,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:58,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:58,270 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:58,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1232444971, now seen corresponding path program 1 times [2019-11-16 00:05:58,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:58,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507931224] [2019-11-16 00:05:58,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:58,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:58,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:58,392 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:58,676 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:05:58,790 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-16 00:05:59,104 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-11-16 00:05:59,241 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:05:59,257 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:05:59,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:05:59,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:05:59,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:05:59,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:05:59,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:05:59,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:05:59,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:05:59,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration2_Lasso [2019-11-16 00:05:59,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:05:59,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:05:59,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,672 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-16 00:05:59,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:59,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:00,588 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-16 00:06:00,852 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:00,858 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:00,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:00,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:00,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,869 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:00,869 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:00,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:00,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:00,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:00,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:00,877 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:00,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:00,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:00,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:00,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:00,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:00,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:00,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:00,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:00,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,885 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:00,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:00,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,888 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:00,888 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:00,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:00,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:00,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:00,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,900 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:00,901 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:00,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:00,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,910 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:00,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:00,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:00,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,911 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:00,911 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:00,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:00,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:00,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:00,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,917 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:00,917 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:00,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:00,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,930 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:00,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:00,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:00,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,931 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:00,932 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:00,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:00,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:00,934 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:00,935 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-16 00:06:00,935 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:06:00,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:00,958 INFO L400 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-11-16 00:06:00,958 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:06:01,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:01,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:01,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:01,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:01,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:01,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:01,199 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:01,200 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:01,275 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:01,381 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:06:01,381 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:06:01,384 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:01,386 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:06:01,387 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:01,388 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2019-11-16 00:06:01,410 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-16 00:06:01,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:01,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:01,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:01,548 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 [2019-11-16 00:06:01,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:06:01,607 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 6 states. [2019-11-16 00:06:01,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-16 00:06:01,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-16 00:06:01,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:01,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-16 00:06:01,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:01,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:06:01,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:01,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-16 00:06:01,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:06:01,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2019-11-16 00:06:01,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:06:01,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-16 00:06:01,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-16 00:06:01,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:01,619 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-16 00:06:01,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-16 00:06:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-16 00:06:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:06:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-16 00:06:01,622 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-16 00:06:01,622 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-16 00:06:01,622 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:06:01,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-16 00:06:01,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:01,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:01,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:01,624 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:01,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:01,625 INFO L791 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 183#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 184#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 188#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 189#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 187#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 180#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 174#L774-3 [2019-11-16 00:06:01,625 INFO L793 eck$LassoCheckResult]: Loop: 174#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 173#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 174#L774-3 [2019-11-16 00:06:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966489, now seen corresponding path program 1 times [2019-11-16 00:06:01,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:01,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224782254] [2019-11-16 00:06:01,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:01,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224782254] [2019-11-16 00:06:01,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:01,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:01,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010105777] [2019-11-16 00:06:01,673 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:06:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2019-11-16 00:06:01,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:01,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740489912] [2019-11-16 00:06:01,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:01,684 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:01,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:01,719 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-16 00:06:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:01,743 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-11-16 00:06:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:01,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-11-16 00:06:01,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:06:01,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2019-11-16 00:06:01,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:06:01,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:06:01,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-16 00:06:01,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:01,747 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-16 00:06:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-16 00:06:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-11-16 00:06:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:06:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-16 00:06:01,750 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-16 00:06:01,750 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-16 00:06:01,750 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:06:01,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-11-16 00:06:01,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:01,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:01,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:01,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:01,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:01,753 INFO L791 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 234#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 235#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 239#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 240#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 238#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 226#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 227#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 230#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 231#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 225#L774-3 [2019-11-16 00:06:01,753 INFO L793 eck$LassoCheckResult]: Loop: 225#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 224#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 225#L774-3 [2019-11-16 00:06:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1232385447, now seen corresponding path program 1 times [2019-11-16 00:06:01,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:01,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685655101] [2019-11-16 00:06:01,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:01,775 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 2 times [2019-11-16 00:06:01,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:01,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500066657] [2019-11-16 00:06:01,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:01,784 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1088560603, now seen corresponding path program 1 times [2019-11-16 00:06:01,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:01,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519615778] [2019-11-16 00:06:01,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:01,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519615778] [2019-11-16 00:06:01,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:01,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:01,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890892638] [2019-11-16 00:06:01,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:01,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:01,866 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-16 00:06:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:01,908 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-11-16 00:06:01,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:01,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-11-16 00:06:01,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:01,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2019-11-16 00:06:01,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:06:01,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:06:01,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-11-16 00:06:01,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:01,911 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-16 00:06:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-11-16 00:06:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-11-16 00:06:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:06:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-16 00:06:01,914 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-16 00:06:01,914 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-16 00:06:01,914 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:06:01,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-16 00:06:01,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:01,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:01,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:01,916 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:01,917 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:01,917 INFO L791 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 288#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 289#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 293#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 294#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 292#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 282#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 283#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 286#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 287#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 290#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 285#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 279#L774-3 [2019-11-16 00:06:01,917 INFO L793 eck$LassoCheckResult]: Loop: 279#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 278#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 279#L774-3 [2019-11-16 00:06:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1088615463, now seen corresponding path program 1 times [2019-11-16 00:06:01,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:01,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220614504] [2019-11-16 00:06:01,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:01,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220614504] [2019-11-16 00:06:01,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:01,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:01,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156285868] [2019-11-16 00:06:01,952 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:06:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 3 times [2019-11-16 00:06:01,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:01,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549092286] [2019-11-16 00:06:01,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:01,959 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:01,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:01,993 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-16 00:06:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:02,030 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-11-16 00:06:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:02,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-11-16 00:06:02,034 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-16 00:06:02,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2019-11-16 00:06:02,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:06:02,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:06:02,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-11-16 00:06:02,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:02,035 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-16 00:06:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-11-16 00:06:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-16 00:06:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:06:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-16 00:06:02,038 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-16 00:06:02,038 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-16 00:06:02,038 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:06:02,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-16 00:06:02,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:02,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:02,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:02,040 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:02,041 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:02,041 INFO L791 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 341#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 342#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 346#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 347#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 345#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 335#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 336#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 339#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 340#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 343#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 338#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 332#L774-3 [2019-11-16 00:06:02,041 INFO L793 eck$LassoCheckResult]: Loop: 332#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 331#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 332#L774-3 [2019-11-16 00:06:02,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1031357161, now seen corresponding path program 1 times [2019-11-16 00:06:02,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469900857] [2019-11-16 00:06:02,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:02,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469900857] [2019-11-16 00:06:02,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110868119] [2019-11-16 00:06:02,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_971a11f3-46d9-427c-abdf-46e72b87771d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:02,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:02,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:02,227 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:02,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-16 00:06:02,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606279605] [2019-11-16 00:06:02,227 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:06:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 4 times [2019-11-16 00:06:02,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353610365] [2019-11-16 00:06:02,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:02,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:02,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:02,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:02,277 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-16 00:06:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:02,324 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-11-16 00:06:02,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:02,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-16 00:06:02,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:06:02,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2019-11-16 00:06:02,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:06:02,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:06:02,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2019-11-16 00:06:02,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:02,327 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-16 00:06:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2019-11-16 00:06:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-11-16 00:06:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:06:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-16 00:06:02,329 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-16 00:06:02,329 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-16 00:06:02,330 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:06:02,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-11-16 00:06:02,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:02,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:02,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:02,331 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:02,331 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:02,331 INFO L791 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 433#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 434#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 440#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 441#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 437#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 438#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 444#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 443#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 442#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 439#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 425#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 426#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 429#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 430#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 424#L774-3 [2019-11-16 00:06:02,332 INFO L793 eck$LassoCheckResult]: Loop: 424#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 423#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 424#L774-3 [2019-11-16 00:06:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1033365559, now seen corresponding path program 1 times [2019-11-16 00:06:02,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430581853] [2019-11-16 00:06:02,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,366 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 5 times [2019-11-16 00:06:02,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80621981] [2019-11-16 00:06:02,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,388 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -926855349, now seen corresponding path program 1 times [2019-11-16 00:06:02,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908625226] [2019-11-16 00:06:02,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,448 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,375 WARN L191 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2019-11-16 00:06:03,565 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-16 00:06:03,567 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:03,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:03,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:03,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:03,567 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:03,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:03,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:03,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration7_Lasso [2019-11-16 00:06:03,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:03,568 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:03,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,920 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-16 00:06:03,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,597 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-16 00:06:04,708 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:04,709 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:04,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,715 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,718 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,718 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,722 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,723 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,725 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,725 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,726 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,726 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,726 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,729 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,729 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,732 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,733 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,734 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,739 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,739 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,741 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,741 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,741 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,741 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,742 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,742 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,744 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,745 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,745 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,750 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,753 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,753 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,757 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,757 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,760 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,760 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,762 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-11-16 00:06:04,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,765 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-11-16 00:06:04,766 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,785 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,788 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,792 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,792 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,797 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,797 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,805 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,805 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,812 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,815 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,815 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,817 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,817 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,830 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:04,841 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:06:04,841 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:06:04,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:04,843 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:06:04,843 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:04,843 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2019-11-16 00:06:04,870 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-16 00:06:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:04,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:04,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:04,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:04,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:04,948 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 [2019-11-16 00:06:04,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:06:04,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-11-16 00:06:04,959 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 [2019-11-16 00:06:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-16 00:06:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-16 00:06:04,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-16 00:06:04,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-16 00:06:04,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:04,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-16 00:06:04,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:06:04,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-11-16 00:06:04,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:06:04,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:06:04,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:06:04,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:06:04,962 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:04,962 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:04,962 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:04,962 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:06:04,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:06:04,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:06:04,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:06:04,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:06:04 BoogieIcfgContainer [2019-11-16 00:06:04,969 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:06:04,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:06:04,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:06:04,970 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:06:04,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:57" (3/4) ... [2019-11-16 00:06:04,974 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:06:04,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:06:04,976 INFO L168 Benchmark]: Toolchain (without parser) took 9503.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -228.2 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:04,977 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:04,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:04,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:04,979 INFO L168 Benchmark]: Boogie Preprocessor took 41.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:04,980 INFO L168 Benchmark]: RCFGBuilder took 543.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:04,981 INFO L168 Benchmark]: BuchiAutomizer took 7925.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -123.6 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:04,981 INFO L168 Benchmark]: Witness Printer took 5.05 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:04,985 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 882.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 543.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7925.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -123.6 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.05 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 128 SDslu, 119 SDs, 0 SdLazy, 98 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax111 hnf101 lsp83 ukn56 mio100 lsp57 div100 bol100 ite100 ukn100 eq191 hnf90 smp100 dnf190 smp66 tf100 neg94 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 233ms VariablesStem: 7 VariablesLoop: 8 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 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...