./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/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 4e7f10697bf40be831ee927139b8f7b8ae344247 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 07:57:13,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:57:13,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:57:13,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:57:13,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:57:13,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:57:13,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:57:13,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:57:13,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:57:13,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:57:13,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:57:13,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:57:13,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:57:13,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:57:13,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:57:13,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:57:13,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:57:13,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:57:13,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:57:13,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:57:13,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:57:13,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:57:13,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:57:13,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:57:13,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:57:13,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:57:13,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:57:13,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:57:13,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:57:13,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:57:13,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:57:13,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:57:13,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:57:13,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:57:13,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:57:13,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:57:13,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:57:13,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:57:13,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:57:13,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:57:13,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:57:13,475 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 07:57:13,493 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:57:13,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:57:13,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:57:13,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:57:13,495 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:57:13,496 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 07:57:13,496 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 07:57:13,496 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 07:57:13,497 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 07:57:13,497 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 07:57:13,497 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 07:57:13,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:57:13,498 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:57:13,498 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 07:57:13,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:57:13,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:57:13,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:57:13,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 07:57:13,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 07:57:13,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 07:57:13,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:57:13,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:57:13,500 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 07:57:13,500 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:57:13,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 07:57:13,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:57:13,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:57:13,502 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 07:57:13,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:57:13,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:57:13,502 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 07:57:13,503 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 07:57:13,504 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_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/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 -> 4e7f10697bf40be831ee927139b8f7b8ae344247 [2019-11-20 07:57:13,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:57:13,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:57:13,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:57:13,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:57:13,680 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:57:13,681 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2019-11-20 07:57:13,741 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/data/c6dd53f31/2812d0ccb4934b7fae45656fa3731b30/FLAG0ea08497e [2019-11-20 07:57:14,293 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:57:14,293 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2019-11-20 07:57:14,316 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/data/c6dd53f31/2812d0ccb4934b7fae45656fa3731b30/FLAG0ea08497e [2019-11-20 07:57:14,574 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/data/c6dd53f31/2812d0ccb4934b7fae45656fa3731b30 [2019-11-20 07:57:14,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:57:14,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:57:14,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:57:14,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:57:14,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:57:14,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:57:14" (1/1) ... [2019-11-20 07:57:14,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2662eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:14, skipping insertion in model container [2019-11-20 07:57:14,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:57:14" (1/1) ... [2019-11-20 07:57:14,601 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:57:14,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:57:15,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:57:15,222 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:57:15,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:57:15,450 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:57:15,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15 WrapperNode [2019-11-20 07:57:15,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:57:15,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:57:15,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:57:15,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:57:15,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:57:15,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:57:15,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:57:15,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:57:15,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... [2019-11-20 07:57:15,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:57:15,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:57:15,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:57:15,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:57:15,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/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-20 07:57:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 07:57:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 07:57:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 07:57:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 07:57:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 07:57:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 07:57:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:57:15,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:57:16,026 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:57:16,026 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-20 07:57:16,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:57:16 BoogieIcfgContainer [2019-11-20 07:57:16,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:57:16,028 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 07:57:16,029 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 07:57:16,032 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 07:57:16,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:57:16,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 07:57:14" (1/3) ... [2019-11-20 07:57:16,034 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8100611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 07:57:16, skipping insertion in model container [2019-11-20 07:57:16,034 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:57:16,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:57:15" (2/3) ... [2019-11-20 07:57:16,035 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8100611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 07:57:16, skipping insertion in model container [2019-11-20 07:57:16,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:57:16,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:57:16" (3/3) ... [2019-11-20 07:57:16,037 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2019-11-20 07:57:16,081 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 07:57:16,082 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 07:57:16,082 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 07:57:16,082 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:57:16,082 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:57:16,082 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 07:57:16,082 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:57:16,083 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 07:57:16,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-20 07:57:16,117 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 07:57:16,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:16,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:16,125 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:16,125 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 07:57:16,126 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 07:57:16,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-20 07:57:16,128 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 07:57:16,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:16,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:16,129 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:16,129 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 07:57:16,135 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 11#L-1true havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 26#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 18#L530true entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 12#L788true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 19#L789-3true [2019-11-20 07:57:16,135 INFO L796 eck$LassoCheckResult]: Loop: 19#L789-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 16#L789-2true entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 19#L789-3true [2019-11-20 07:57:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-11-20 07:57:16,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:16,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001939481] [2019-11-20 07:57:16,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:16,345 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-20 07:57:16,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001939481] [2019-11-20 07:57:16,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:57:16,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:57:16,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640984100] [2019-11-20 07:57:16,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:16,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2019-11-20 07:57:16,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:16,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92035880] [2019-11-20 07:57:16,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:16,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:16,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:16,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:57:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:57:16,539 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-11-20 07:57:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:16,628 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-11-20 07:57:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:57:16,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2019-11-20 07:57:16,633 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2019-11-20 07:57:16,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 41 transitions. [2019-11-20 07:57:16,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-20 07:57:16,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-20 07:57:16,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-11-20 07:57:16,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:16,641 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-20 07:57:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-11-20 07:57:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-11-20 07:57:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 07:57:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-20 07:57:16,685 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-20 07:57:16,685 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-20 07:57:16,686 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 07:57:16,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-11-20 07:57:16,690 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 07:57:16,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:16,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:16,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:16,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 07:57:16,691 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 93#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 94#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; 99#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 95#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 96#L789-3 [2019-11-20 07:57:16,692 INFO L796 eck$LassoCheckResult]: Loop: 96#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 98#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 96#L789-3 [2019-11-20 07:57:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2019-11-20 07:57:16,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:16,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033017903] [2019-11-20 07:57:16,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:16,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2019-11-20 07:57:16,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:16,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848399156] [2019-11-20 07:57:16,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:16,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2019-11-20 07:57:16,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:16,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076116421] [2019-11-20 07:57:16,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:16,899 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:17,279 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-11-20 07:57:17,417 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-20 07:57:17,430 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 07:57:17,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 07:57:17,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 07:57:17,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 07:57:17,432 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 07:57:17,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:17,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 07:57:17,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 07:57:17,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2019-11-20 07:57:17,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 07:57:17,433 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 07:57:17,468 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-20 07:57:17,479 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-20 07:57:17,482 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-20 07:57:17,487 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-20 07:57:17,492 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-20 07:57:17,496 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-20 07:57:17,500 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-20 07:57:17,504 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-20 07:57:17,811 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-20 07:57:17,882 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-20 07:57:17,885 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-20 07:57:17,891 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-20 07:57:17,895 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-20 07:57:17,898 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-20 07:57:18,588 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-20 07:57:18,633 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 07:57:18,639 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,650 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-20 07:57:18,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:57:18,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:57:18,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 07:57:18,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:57:18,679 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-20 07:57:18,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:57:18,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:57:18,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,700 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-20 07:57:18,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:57:18,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:57:18,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:57:18,722 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-20 07:57:18,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:57:18,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,746 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-20 07:57:18,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:57:18,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:57:18,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,766 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-20 07:57:18,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:57:18,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:57:18,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:57:18,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-20 07:57:18,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:57:18,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:57:18,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,866 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-20 07:57:18,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:57:18,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:57:18,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,894 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-20 07:57:18,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:57:18,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:57:18,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 07:57:18,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:18,914 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-20 07:57:18,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:57:18,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:57:18,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:57:18,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:57:18,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:57:18,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:57:18,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 07:57:19,047 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-20 07:57:19,048 INFO L444 ModelExtractionUtils]: 18 out of 31 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:57:19,068 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:57:19,073 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 07:57:19,073 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 07:57:19,074 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1, ULTIMATE.start_entry_point_~i~2) = 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1 - 2*ULTIMATE.start_entry_point_~i~2 Supporting invariants [-2*ULTIMATE.start_entry_point_~len~0 + 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1 >= 0] [2019-11-20 07:57:19,110 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-11-20 07:57:19,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 07:57:19,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:19,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:57:19,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:19,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 07:57:19,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:57:19,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:57:19,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:57:19,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-11-20 07:57:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:19,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:57:19,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:19,367 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-20 07:57:19,370 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-20 07:57:19,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-20 07:57:19,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 34 states and 44 transitions. Complement of second has 9 states. [2019-11-20 07:57:19,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 07:57:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 07:57:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-11-20 07:57:19,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-20 07:57:19,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:57:19,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-20 07:57:19,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:57:19,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-20 07:57:19,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:57:19,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2019-11-20 07:57:19,545 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 07:57:19,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 34 transitions. [2019-11-20 07:57:19,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-20 07:57:19,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-20 07:57:19,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-20 07:57:19,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:19,549 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-20 07:57:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-20 07:57:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-11-20 07:57:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 07:57:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-20 07:57:19,554 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-20 07:57:19,554 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-20 07:57:19,554 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 07:57:19,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-20 07:57:19,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:19,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:19,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:19,557 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:19,558 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:19,558 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 237#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 238#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; 245#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 239#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 240#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 244#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 246#L765-3 [2019-11-20 07:57:19,558 INFO L796 eck$LassoCheckResult]: Loop: 246#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 227#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; 228#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 234#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 236#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 246#L765-3 [2019-11-20 07:57:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2019-11-20 07:57:19,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:19,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649246509] [2019-11-20 07:57:19,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:19,629 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-20 07:57:19,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649246509] [2019-11-20 07:57:19,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:57:19,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:57:19,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617833611] [2019-11-20 07:57:19,630 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2019-11-20 07:57:19,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:19,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285384926] [2019-11-20 07:57:19,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:19,676 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:19,900 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:20,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:20,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:57:20,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:57:20,002 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-20 07:57:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:20,027 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-20 07:57:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:57:20,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2019-11-20 07:57:20,030 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:20,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2019-11-20 07:57:20,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:20,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:20,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-11-20 07:57:20,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:20,032 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-20 07:57:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-11-20 07:57:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-20 07:57:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 07:57:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-20 07:57:20,034 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-20 07:57:20,035 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-20 07:57:20,035 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 07:57:20,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-20 07:57:20,036 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:20,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:20,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:20,036 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:20,036 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:20,037 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 291#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 292#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; 296#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 289#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 290#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 293#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 294#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 297#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 298#L765-3 [2019-11-20 07:57:20,037 INFO L796 eck$LassoCheckResult]: Loop: 298#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 279#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; 280#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 286#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 288#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 298#L765-3 [2019-11-20 07:57:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2019-11-20 07:57:20,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:20,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221640170] [2019-11-20 07:57:20,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:20,118 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-20 07:57:20,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221640170] [2019-11-20 07:57:20,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854706731] [2019-11-20 07:57:20,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:20,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 07:57:20,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:20,222 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-20 07:57:20,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:20,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-20 07:57:20,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750740167] [2019-11-20 07:57:20,223 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2019-11-20 07:57:20,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:20,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606901839] [2019-11-20 07:57:20,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:20,262 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:20,497 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:20,612 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-20 07:57:20,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:57:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:57:20,613 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-20 07:57:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:20,650 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-11-20 07:57:20,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:57:20,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2019-11-20 07:57:20,653 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:20,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2019-11-20 07:57:20,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:20,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:20,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2019-11-20 07:57:20,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:20,654 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-20 07:57:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2019-11-20 07:57:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-20 07:57:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 07:57:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-11-20 07:57:20,657 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-20 07:57:20,657 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-20 07:57:20,657 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 07:57:20,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2019-11-20 07:57:20,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:20,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:20,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:20,659 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:20,659 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:20,659 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 370#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 371#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; 377#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 372#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 373#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 375#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 376#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 378#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 381#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 379#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 380#L765-3 [2019-11-20 07:57:20,660 INFO L796 eck$LassoCheckResult]: Loop: 380#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 360#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; 361#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 367#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 369#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 380#L765-3 [2019-11-20 07:57:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash 447769425, now seen corresponding path program 2 times [2019-11-20 07:57:20,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:20,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362507462] [2019-11-20 07:57:20,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:20,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362507462] [2019-11-20 07:57:20,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002700655] [2019-11-20 07:57:20,740 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:20,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 07:57:20,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:57:20,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:57:20,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:20,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:20,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-20 07:57:20,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818084051] [2019-11-20 07:57:20,910 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:20,911 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2019-11-20 07:57:20,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:20,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198312549] [2019-11-20 07:57:20,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:20,950 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:21,110 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:21,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 07:57:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:57:21,191 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand 9 states. [2019-11-20 07:57:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:21,242 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-11-20 07:57:21,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:57:21,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-11-20 07:57:21,245 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:21,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-11-20 07:57:21,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:21,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:21,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-11-20 07:57:21,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:21,246 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-20 07:57:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-11-20 07:57:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-20 07:57:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 07:57:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-11-20 07:57:21,249 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-20 07:57:21,249 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-20 07:57:21,250 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 07:57:21,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2019-11-20 07:57:21,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:21,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:21,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:21,251 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:21,251 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:21,252 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 463#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 464#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; 470#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 465#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 466#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 471#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 476#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 468#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 469#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 472#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 475#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 473#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 474#L765-3 [2019-11-20 07:57:21,252 INFO L796 eck$LassoCheckResult]: Loop: 474#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 453#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; 454#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 460#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 462#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 474#L765-3 [2019-11-20 07:57:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash 809744147, now seen corresponding path program 3 times [2019-11-20 07:57:21,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:21,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021282455] [2019-11-20 07:57:21,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:21,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021282455] [2019-11-20 07:57:21,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773964721] [2019-11-20 07:57:21,325 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:21,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 07:57:21,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:57:21,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:57:21,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:21,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:21,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-20 07:57:21,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190516919] [2019-11-20 07:57:21,460 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2019-11-20 07:57:21,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:21,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017680686] [2019-11-20 07:57:21,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:21,487 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:21,699 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:21,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 07:57:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2019-11-20 07:57:21,767 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 9 Second operand 11 states. [2019-11-20 07:57:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:21,813 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-11-20 07:57:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 07:57:21,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-11-20 07:57:21,816 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:21,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2019-11-20 07:57:21,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:21,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:21,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2019-11-20 07:57:21,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:21,818 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-20 07:57:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2019-11-20 07:57:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-20 07:57:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 07:57:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-20 07:57:21,822 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-20 07:57:21,822 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-20 07:57:21,822 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 07:57:21,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-11-20 07:57:21,823 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:21,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:21,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:21,824 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:21,824 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:21,824 INFO L794 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 568#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 569#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; 575#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 570#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 571#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 576#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 577#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 573#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 574#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 583#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 582#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 581#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 580#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 578#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 579#L765-3 [2019-11-20 07:57:21,824 INFO L796 eck$LassoCheckResult]: Loop: 579#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 558#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; 559#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 565#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 567#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 579#L765-3 [2019-11-20 07:57:21,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 4 times [2019-11-20 07:57:21,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:21,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063758129] [2019-11-20 07:57:21,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:21,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063758129] [2019-11-20 07:57:21,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177066518] [2019-11-20 07:57:21,910 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:21,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 07:57:21,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:57:21,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 07:57:21,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:22,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:22,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-20 07:57:22,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027998475] [2019-11-20 07:57:22,085 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:22,086 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 5 times [2019-11-20 07:57:22,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:22,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478394569] [2019-11-20 07:57:22,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:22,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:22,302 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:22,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 07:57:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-20 07:57:22,366 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-20 07:57:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:22,410 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-11-20 07:57:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 07:57:22,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-11-20 07:57:22,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:22,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2019-11-20 07:57:22,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:22,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:22,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2019-11-20 07:57:22,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:22,416 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-20 07:57:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2019-11-20 07:57:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-20 07:57:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 07:57:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-20 07:57:22,420 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-20 07:57:22,420 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-20 07:57:22,420 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 07:57:22,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2019-11-20 07:57:22,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:22,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:22,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:22,423 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:22,424 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:22,424 INFO L794 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 685#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 686#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; 692#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 687#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 688#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 693#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 694#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 690#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 691#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 702#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 701#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 700#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 699#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 698#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 697#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 695#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 696#L765-3 [2019-11-20 07:57:22,424 INFO L796 eck$LassoCheckResult]: Loop: 696#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 675#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; 676#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 682#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 684#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 696#L765-3 [2019-11-20 07:57:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1842787607, now seen corresponding path program 5 times [2019-11-20 07:57:22,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:22,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944190663] [2019-11-20 07:57:22,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:22,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944190663] [2019-11-20 07:57:22,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739932694] [2019-11-20 07:57:22,513 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:22,605 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-20 07:57:22,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:57:22,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:57:22,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:22,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:22,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-20 07:57:22,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996237164] [2019-11-20 07:57:22,703 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 6 times [2019-11-20 07:57:22,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:22,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106351958] [2019-11-20 07:57:22,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:22,718 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:22,882 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:22,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:22,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 07:57:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-11-20 07:57:22,973 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 9 Second operand 15 states. [2019-11-20 07:57:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:23,045 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-11-20 07:57:23,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:57:23,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2019-11-20 07:57:23,047 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:23,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2019-11-20 07:57:23,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:23,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:23,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2019-11-20 07:57:23,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:23,049 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-20 07:57:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2019-11-20 07:57:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-20 07:57:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 07:57:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-20 07:57:23,052 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-20 07:57:23,052 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-20 07:57:23,052 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 07:57:23,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2019-11-20 07:57:23,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:23,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:23,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:23,053 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:23,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:23,054 INFO L794 eck$LassoCheckResult]: Stem: 818#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 814#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 815#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; 821#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 816#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 817#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 822#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 823#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 819#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 820#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 833#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 832#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 831#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 830#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 829#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 828#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 827#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 826#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 824#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 825#L765-3 [2019-11-20 07:57:23,054 INFO L796 eck$LassoCheckResult]: Loop: 825#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 804#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; 805#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 811#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 813#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 825#L765-3 [2019-11-20 07:57:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1392420697, now seen corresponding path program 6 times [2019-11-20 07:57:23,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:23,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703007509] [2019-11-20 07:57:23,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:23,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703007509] [2019-11-20 07:57:23,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669524202] [2019-11-20 07:57:23,147 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:23,251 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-20 07:57:23,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:57:23,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 07:57:23,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:23,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:23,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-20 07:57:23,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987654037] [2019-11-20 07:57:23,337 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 7 times [2019-11-20 07:57:23,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:23,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81571309] [2019-11-20 07:57:23,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:23,350 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:23,512 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:23,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:23,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 07:57:23,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-20 07:57:23,577 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 9 Second operand 17 states. [2019-11-20 07:57:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:23,684 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-20 07:57:23,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 07:57:23,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2019-11-20 07:57:23,685 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:23,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 40 transitions. [2019-11-20 07:57:23,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:23,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:23,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-11-20 07:57:23,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:23,686 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-20 07:57:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-11-20 07:57:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-20 07:57:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 07:57:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-11-20 07:57:23,689 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-20 07:57:23,694 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-20 07:57:23,694 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 07:57:23,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2019-11-20 07:57:23,695 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:23,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:23,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:23,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:23,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:23,698 INFO L794 eck$LassoCheckResult]: Stem: 959#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 955#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 956#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; 962#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 957#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 958#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 963#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 964#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 960#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 961#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 976#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 975#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 974#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 973#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 972#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 971#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 970#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 969#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 968#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 967#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 965#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 966#L765-3 [2019-11-20 07:57:23,699 INFO L796 eck$LassoCheckResult]: Loop: 966#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 945#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; 946#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 952#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 954#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 966#L765-3 [2019-11-20 07:57:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1913450213, now seen corresponding path program 7 times [2019-11-20 07:57:23,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:23,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520564498] [2019-11-20 07:57:23,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:23,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520564498] [2019-11-20 07:57:23,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679262994] [2019-11-20 07:57:23,835 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:23,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 07:57:23,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:24,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:24,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-20 07:57:24,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897130842] [2019-11-20 07:57:24,037 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 8 times [2019-11-20 07:57:24,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:24,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347803362] [2019-11-20 07:57:24,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:24,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:24,297 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:24,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 07:57:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-11-20 07:57:24,370 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 9 Second operand 19 states. [2019-11-20 07:57:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:24,453 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-11-20 07:57:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 07:57:24,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2019-11-20 07:57:24,454 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:24,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2019-11-20 07:57:24,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:24,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:24,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2019-11-20 07:57:24,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:24,456 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-20 07:57:24,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2019-11-20 07:57:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-20 07:57:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 07:57:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-20 07:57:24,459 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-20 07:57:24,459 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-20 07:57:24,459 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 07:57:24,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2019-11-20 07:57:24,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:24,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:24,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:24,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:24,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:24,461 INFO L794 eck$LassoCheckResult]: Stem: 1112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 1108#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1109#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; 1115#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1110#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1111#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1116#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1117#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1113#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1114#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1131#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1130#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1129#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1128#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1127#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1126#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1125#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1124#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1123#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1122#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1121#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1120#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1118#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1119#L765-3 [2019-11-20 07:57:24,461 INFO L796 eck$LassoCheckResult]: Loop: 1119#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1098#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; 1099#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1105#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1107#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1119#L765-3 [2019-11-20 07:57:24,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:24,461 INFO L82 PathProgramCache]: Analyzing trace with hash -579595683, now seen corresponding path program 8 times [2019-11-20 07:57:24,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:24,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93258978] [2019-11-20 07:57:24,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:24,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93258978] [2019-11-20 07:57:24,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216272500] [2019-11-20 07:57:24,590 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:24,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 07:57:24,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:57:24,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 07:57:24,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:24,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:24,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-11-20 07:57:24,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689608608] [2019-11-20 07:57:24,802 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 9 times [2019-11-20 07:57:24,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:24,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081117462] [2019-11-20 07:57:24,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:24,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:25,020 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:25,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 07:57:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-11-20 07:57:25,105 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 9 Second operand 21 states. [2019-11-20 07:57:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:25,215 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-11-20 07:57:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 07:57:25,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2019-11-20 07:57:25,218 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:25,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2019-11-20 07:57:25,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:25,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:25,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2019-11-20 07:57:25,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:25,219 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-20 07:57:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2019-11-20 07:57:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-11-20 07:57:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 07:57:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-11-20 07:57:25,228 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-20 07:57:25,228 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-20 07:57:25,229 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 07:57:25,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2019-11-20 07:57:25,229 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:25,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:25,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:25,231 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:25,231 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:25,231 INFO L794 eck$LassoCheckResult]: Stem: 1277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 1273#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1274#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; 1280#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1275#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1276#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1281#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1282#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1278#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1279#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1298#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1297#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1296#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1295#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1294#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1293#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1292#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1291#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1290#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1289#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1288#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1287#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1286#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1285#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1283#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1284#L765-3 [2019-11-20 07:57:25,232 INFO L796 eck$LassoCheckResult]: Loop: 1284#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1263#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; 1264#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1270#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1272#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1284#L765-3 [2019-11-20 07:57:25,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:25,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1354353439, now seen corresponding path program 9 times [2019-11-20 07:57:25,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:25,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822793872] [2019-11-20 07:57:25,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:57:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:25,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822793872] [2019-11-20 07:57:25,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858471841] [2019-11-20 07:57:25,421 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:57:26,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-20 07:57:26,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:57:26,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 07:57:26,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:57:26,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:57:26,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-11-20 07:57:26,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350031600] [2019-11-20 07:57:26,272 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:57:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 10 times [2019-11-20 07:57:26,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:26,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467632300] [2019-11-20 07:57:26,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:26,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:26,429 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:57:26,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:57:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 07:57:26,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2019-11-20 07:57:26,488 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 23 states. [2019-11-20 07:57:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:26,587 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-20 07:57:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 07:57:26,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2019-11-20 07:57:26,589 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:26,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2019-11-20 07:57:26,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 07:57:26,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 07:57:26,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2019-11-20 07:57:26,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:57:26,591 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-20 07:57:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2019-11-20 07:57:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-20 07:57:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 07:57:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-20 07:57:26,593 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-20 07:57:26,595 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-20 07:57:26,596 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 07:57:26,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2019-11-20 07:57:26,596 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 07:57:26,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:57:26,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:57:26,597 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:26,597 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 07:57:26,598 INFO L794 eck$LassoCheckResult]: Stem: 1458#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 1452#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1453#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; 1461#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1454#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1455#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1459#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1460#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1456#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1457#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1479#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1478#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1477#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1476#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1475#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1474#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1473#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1472#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1471#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1470#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1469#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1468#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1467#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1466#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1465#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1464#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1462#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1463#L765-3 [2019-11-20 07:57:26,598 INFO L796 eck$LassoCheckResult]: Loop: 1463#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1442#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; 1443#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1449#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1451#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1463#L765-3 [2019-11-20 07:57:26,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 10 times [2019-11-20 07:57:26,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:26,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082961640] [2019-11-20 07:57:26,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:26,649 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:26,650 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 11 times [2019-11-20 07:57:26,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:26,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751771390] [2019-11-20 07:57:26,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:26,662 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:26,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2019-11-20 07:57:26,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:57:26,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791777426] [2019-11-20 07:57:26,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:57:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:57:26,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:57:26,893 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 07:59:15,257 WARN L191 SmtUtils]: Spent 1.80 m on a formula simplification. DAG size of input: 372 DAG size of output: 304 [2019-11-20 07:59:15,395 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:23,792 WARN L191 SmtUtils]: Spent 8.40 s on a formula simplification that was a NOOP. DAG size: 191 [2019-11-20 07:59:23,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:23,857 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:31,820 WARN L191 SmtUtils]: Spent 7.96 s on a formula simplification that was a NOOP. DAG size: 187 [2019-11-20 07:59:31,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:31,877 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:38,646 WARN L191 SmtUtils]: Spent 6.77 s on a formula simplification that was a NOOP. DAG size: 183 [2019-11-20 07:59:38,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:38,720 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:44,799 WARN L191 SmtUtils]: Spent 6.08 s on a formula simplification that was a NOOP. DAG size: 179 [2019-11-20 07:59:44,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:44,841 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:49,812 WARN L191 SmtUtils]: Spent 4.97 s on a formula simplification that was a NOOP. DAG size: 175 [2019-11-20 07:59:49,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:49,859 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:53,856 WARN L191 SmtUtils]: Spent 4.00 s on a formula simplification that was a NOOP. DAG size: 171 [2019-11-20 07:59:53,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:53,873 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:56,302 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 167 [2019-11-20 07:59:56,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:56,335 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:57,687 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 163 [2019-11-20 07:59:57,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:57,716 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:58,836 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 159 [2019-11-20 07:59:58,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:59:58,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-20 07:59:58,841 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:561, output treesize:413 [2019-11-20 08:00:00,106 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 159 [2019-11-20 08:00:00,109 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 08:00:00,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 08:00:00,110 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 08:00:00,110 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 08:00:00,110 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 08:00:00,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:00,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 08:00:00,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 08:00:00,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration13_Lasso [2019-11-20 08:00:00,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 08:00:00,110 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 08:00:00,116 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-20 08:00:00,123 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-20 08:00:00,125 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-20 08:00:00,128 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-20 08:00:00,131 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-20 08:00:00,133 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-20 08:00:00,135 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-20 08:00:00,137 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-20 08:00:00,139 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-20 08:00:00,693 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-20 08:00:00,795 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-20 08:00:00,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-20 08:00:00,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-20 08:00:00,801 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-20 08:00:00,803 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-20 08:00:00,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-20 08:00:00,808 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-20 08:00:00,810 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-20 08:00:00,812 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-20 08:00:00,814 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-20 08:00:00,816 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-20 08:00:00,820 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-20 08:00:01,051 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-20 08:00:01,313 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-20 08:00:01,550 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 08:00:01,551 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,556 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-20 08:00:01,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:00:01,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:00:01,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:00:01,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,569 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-20 08:00:01,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:00:01,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:00:01,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:00:01,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,580 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-20 08:00:01,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:00:01,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:00:01,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,594 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-20 08:00:01,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:00:01,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:00:01,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,610 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-20 08:00:01,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:00:01,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:00:01,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:00:01,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,620 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-20 08:00:01,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:00:01,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:00:01,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:00:01,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,630 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-20 08:00:01,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:00:01,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:00:01,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:00:01,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,642 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-20 08:00:01,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:00:01,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:00:01,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,659 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-20 08:00:01,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,662 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-20 08:00:01,662 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-20 08:00:01,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,690 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-20 08:00:01,690 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-20 08:00:01,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,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-20 08:00:01,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:00:01,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:00:01,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:00:01,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:00:01,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:00:01,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:00:01,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 08:00:01,822 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-20 08:00:01,822 INFO L444 ModelExtractionUtils]: 26 out of 55 variables were initially zero. Simplification set additionally 24 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:00:01,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 08:00:01,829 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 08:00:01,829 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 08:00:01,829 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0) = -2*ULTIMATE.start_alloc_17_~i~0 + 19 Supporting invariants [-1*ULTIMATE.start_alloc_17_~len + 10 >= 0] [2019-11-20 08:00:01,859 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-11-20 08:00:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:00:01,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:00:01,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:00:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:00:01,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:00:01,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:00:01,959 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-20 08:00:01,960 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 08:00:01,960 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-20 08:00:02,010 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 59 states and 71 transitions. Complement of second has 7 states. [2019-11-20 08:00:02,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 08:00:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 08:00:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-11-20 08:00:02,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 27 letters. Loop has 5 letters. [2019-11-20 08:00:02,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:00:02,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 32 letters. Loop has 5 letters. [2019-11-20 08:00:02,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:00:02,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 27 letters. Loop has 10 letters. [2019-11-20 08:00:02,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:00:02,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2019-11-20 08:00:02,018 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-20 08:00:02,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 55 transitions. [2019-11-20 08:00:02,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 08:00:02,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-20 08:00:02,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2019-11-20 08:00:02,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 08:00:02,020 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-11-20 08:00:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2019-11-20 08:00:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-11-20 08:00:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 08:00:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-20 08:00:02,024 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-20 08:00:02,024 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-20 08:00:02,024 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-20 08:00:02,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2019-11-20 08:00:02,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:00:02,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:00:02,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:00:02,027 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:00:02,027 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 08:00:02,027 INFO L794 eck$LassoCheckResult]: Stem: 1717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 1713#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1714#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; 1720#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1715#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1716#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1718#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1719#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1721#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1741#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1740#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1739#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1738#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1737#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1736#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1735#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1734#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1733#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1732#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1731#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1730#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1729#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1728#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1727#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1726#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1725#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1722#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1723#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1698#L765-4 alloc_17_#res := 0; 1699#L776 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1708#L780-3 [2019-11-20 08:00:02,028 INFO L796 eck$LassoCheckResult]: Loop: 1708#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1707#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1708#L780-3 [2019-11-20 08:00:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2019-11-20 08:00:02,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055893041] [2019-11-20 08:00:02,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:00:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 08:00:02,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055893041] [2019-11-20 08:00:02,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:00:02,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:00:02,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237800930] [2019-11-20 08:00:02,089 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 08:00:02,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2019-11-20 08:00:02,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615561410] [2019-11-20 08:00:02,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,096 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:00:02,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:00:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:00:02,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:00:02,134 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-20 08:00:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:00:02,160 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-11-20 08:00:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:00:02,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2019-11-20 08:00:02,162 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-20 08:00:02,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2019-11-20 08:00:02,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-20 08:00:02,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-20 08:00:02,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2019-11-20 08:00:02,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 08:00:02,163 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-11-20 08:00:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2019-11-20 08:00:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2019-11-20 08:00:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 08:00:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-20 08:00:02,167 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-20 08:00:02,167 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-20 08:00:02,167 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-20 08:00:02,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2019-11-20 08:00:02,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:00:02,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:00:02,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:00:02,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:00:02,169 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 08:00:02,170 INFO L794 eck$LassoCheckResult]: Stem: 1826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 1822#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1823#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; 1829#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1824#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1825#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1827#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1828#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1830#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1850#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1849#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1848#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1847#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1846#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1845#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1844#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1843#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1842#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1841#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1840#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1839#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1838#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1837#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1836#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1835#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1834#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1831#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1832#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1809#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1810#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1818#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1819#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1814#L772-3 [2019-11-20 08:00:02,170 INFO L796 eck$LassoCheckResult]: Loop: 1814#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1813#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1814#L772-3 [2019-11-20 08:00:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2019-11-20 08:00:02,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272699251] [2019-11-20 08:00:02,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:00:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2019-11-20 08:00:02,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227158301] [2019-11-20 08:00:02,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,218 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:00:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2019-11-20 08:00:02,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788401051] [2019-11-20 08:00:02,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:00:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 08:00:02,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788401051] [2019-11-20 08:00:02,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:00:02,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:00:02,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403849278] [2019-11-20 08:00:02,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:00:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:00:02,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:00:02,389 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-20 08:00:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:00:02,415 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-20 08:00:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:00:02,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 69 transitions. [2019-11-20 08:00:02,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-20 08:00:02,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 69 transitions. [2019-11-20 08:00:02,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-20 08:00:02,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-20 08:00:02,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2019-11-20 08:00:02,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 08:00:02,418 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-11-20 08:00:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2019-11-20 08:00:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2019-11-20 08:00:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 08:00:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-20 08:00:02,422 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-20 08:00:02,422 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-20 08:00:02,422 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-20 08:00:02,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2019-11-20 08:00:02,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:00:02,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:00:02,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:00:02,424 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:00:02,424 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 08:00:02,425 INFO L794 eck$LassoCheckResult]: Stem: 1942#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 1938#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1939#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; 1945#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1940#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1941#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1943#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1944#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1946#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1970#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1969#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1968#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1967#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1966#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1965#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1964#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1963#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1962#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1961#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1960#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1959#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1958#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1957#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1956#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1955#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1954#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1947#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1948#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1926#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1927#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1936#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1937#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1950#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1922#L765-4 alloc_17_#res := 0; 1923#L776 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1933#L780-3 [2019-11-20 08:00:02,425 INFO L796 eck$LassoCheckResult]: Loop: 1933#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1932#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1933#L780-3 [2019-11-20 08:00:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash -93871603, now seen corresponding path program 1 times [2019-11-20 08:00:02,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449374113] [2019-11-20 08:00:02,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:00:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 08:00:02,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449374113] [2019-11-20 08:00:02,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:00:02,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:00:02,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984712898] [2019-11-20 08:00:02,507 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 08:00:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2019-11-20 08:00:02,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216674718] [2019-11-20 08:00:02,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,512 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:00:02,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:00:02,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:00:02,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:00:02,559 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-20 08:00:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:00:02,597 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-11-20 08:00:02,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:00:02,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 75 transitions. [2019-11-20 08:00:02,599 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-20 08:00:02,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 73 transitions. [2019-11-20 08:00:02,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-20 08:00:02,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-20 08:00:02,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 73 transitions. [2019-11-20 08:00:02,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 08:00:02,600 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-11-20 08:00:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 73 transitions. [2019-11-20 08:00:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2019-11-20 08:00:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 08:00:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-11-20 08:00:02,612 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-11-20 08:00:02,612 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-11-20 08:00:02,612 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-20 08:00:02,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2019-11-20 08:00:02,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:00:02,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:00:02,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:00:02,620 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:00:02,620 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 08:00:02,620 INFO L794 eck$LassoCheckResult]: Stem: 2067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 2063#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 2064#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; 2070#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2065#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2066#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2068#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2069#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2071#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2092#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2091#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2090#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2089#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2088#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2087#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2086#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2085#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2084#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2083#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2082#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2081#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2080#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2079#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2078#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2077#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2076#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2072#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 2073#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 2049#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2050#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2059#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2060#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2055#L772-3 assume !(alloc_17_~j~0 >= 0); 2056#L772-4 alloc_17_#res := 3; 2048#L776 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 2058#L780-3 [2019-11-20 08:00:02,621 INFO L796 eck$LassoCheckResult]: Loop: 2058#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 2057#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 2058#L780-3 [2019-11-20 08:00:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,621 INFO L82 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2019-11-20 08:00:02,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030112103] [2019-11-20 08:00:02,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,673 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:00:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,677 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 3 times [2019-11-20 08:00:02,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115353626] [2019-11-20 08:00:02,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,683 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:00:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:00:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2019-11-20 08:00:02,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:00:02,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39934240] [2019-11-20 08:00:02,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:00:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:00:02,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:01:57,301 WARN L191 SmtUtils]: Spent 1.91 m on a formula simplification. DAG size of input: 412 DAG size of output: 340 [2019-11-20 08:01:57,456 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:08,468 WARN L191 SmtUtils]: Spent 11.01 s on a formula simplification that was a NOOP. DAG size: 214 [2019-11-20 08:02:08,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:08,508 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:17,164 WARN L191 SmtUtils]: Spent 8.66 s on a formula simplification that was a NOOP. DAG size: 210 [2019-11-20 08:02:17,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:17,260 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:24,738 WARN L191 SmtUtils]: Spent 7.48 s on a formula simplification that was a NOOP. DAG size: 206 [2019-11-20 08:02:24,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:24,808 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:31,769 WARN L191 SmtUtils]: Spent 6.96 s on a formula simplification that was a NOOP. DAG size: 202 [2019-11-20 08:02:31,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:31,811 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:37,004 WARN L191 SmtUtils]: Spent 5.19 s on a formula simplification that was a NOOP. DAG size: 198 [2019-11-20 08:02:37,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:37,025 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:40,044 WARN L191 SmtUtils]: Spent 3.02 s on a formula simplification that was a NOOP. DAG size: 194 [2019-11-20 08:02:40,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:40,058 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:42,408 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 190 [2019-11-20 08:02:42,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:42,429 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:44,319 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 186 [2019-11-20 08:02:44,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:44,340 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:45,747 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 182 [2019-11-20 08:02:45,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:02:45,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-20 08:02:45,749 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:610, output treesize:457 [2019-11-20 08:02:47,194 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 182 [2019-11-20 08:02:47,197 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 08:02:47,198 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 08:02:47,198 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 08:02:47,198 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 08:02:47,198 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 08:02:47,198 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:47,198 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 08:02:47,198 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 08:02:47,198 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration17_Lasso [2019-11-20 08:02:47,198 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 08:02:47,198 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 08:02:47,202 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-20 08:02:47,204 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-20 08:02:47,206 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-20 08:02:47,209 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-20 08:02:47,212 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-20 08:02:47,215 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-20 08:02:47,218 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-20 08:02:47,690 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-11-20 08:02:47,749 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-20 08:02:47,751 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-20 08:02:47,754 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-20 08:02:47,756 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-20 08:02:47,759 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-20 08:02:47,762 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-20 08:02:47,767 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-20 08:02:47,768 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-20 08:02:47,771 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-20 08:02:47,773 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-20 08:02:47,779 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-20 08:02:47,782 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-20 08:02:47,784 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-20 08:02:47,786 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-20 08:02:47,788 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-20 08:02:47,790 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-20 08:02:47,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-20 08:02:47,798 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-20 08:02:47,800 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-20 08:02:47,802 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-20 08:02:47,804 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-20 08:02:47,807 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-20 08:02:47,808 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-20 08:02:47,814 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-20 08:02:48,038 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 08:02:48,419 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-20 08:02:48,490 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 08:02:48,490 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,495 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-20 08:02:48,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:02:48,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:02:48,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:02:48,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,506 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-20 08:02:48,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:02:48,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:02:48,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:02:48,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,515 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-20 08:02:48,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,528 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-20 08:02:48,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,547 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-20 08:02:48,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,569 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-20 08:02:48,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:02:48,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:02:48,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:02:48,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,590 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-20 08:02:48,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,618 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-20 08:02:48,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,647 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-20 08:02:48,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,665 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-20 08:02:48,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,681 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-20 08:02:48,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,693 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-20 08:02:48,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:02:48,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:02:48,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:02:48,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,704 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-20 08:02:48,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:02:48,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:02:48,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:02:48,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,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-20 08:02:48,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:02:48,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:02:48,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:02:48,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,730 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-20 08:02:48,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,747 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-20 08:02:48,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:02:48,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:02:48,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:02:48,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:02:48,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:02:48,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:02:48,787 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 08:02:48,828 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-20 08:02:48,828 INFO L444 ModelExtractionUtils]: 35 out of 49 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:02:48,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 08:02:48,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 08:02:48,842 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 08:02:48,842 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2019-11-20 08:02:48,889 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-20 08:02:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:02:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:02:48,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:02:48,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:02:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:02:48,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:02:48,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:02:49,002 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-20 08:02:49,003 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-20 08:02:49,003 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-20 08:02:49,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 51 states and 59 transitions. Complement of second has 4 states. [2019-11-20 08:02:49,018 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-20 08:02:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 08:02:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-20 08:02:49,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 2 letters. [2019-11-20 08:02:49,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:02:49,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 37 letters. Loop has 2 letters. [2019-11-20 08:02:49,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:02:49,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 4 letters. [2019-11-20 08:02:49,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:02:49,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2019-11-20 08:02:49,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 08:02:49,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 42 transitions. [2019-11-20 08:02:49,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 08:02:49,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 08:02:49,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2019-11-20 08:02:49,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 08:02:49,022 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-20 08:02:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2019-11-20 08:02:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-20 08:02:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 08:02:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-20 08:02:49,024 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-20 08:02:49,024 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-20 08:02:49,024 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-20 08:02:49,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2019-11-20 08:02:49,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 08:02:49,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:02:49,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:02:49,031 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:02:49,031 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 08:02:49,032 INFO L794 eck$LassoCheckResult]: Stem: 2320#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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); 2316#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 2317#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; 2323#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2318#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2319#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2324#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2325#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2321#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2322#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2344#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2343#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2342#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2341#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2340#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2339#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2338#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2337#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2336#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2335#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2334#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2333#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2332#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2331#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2330#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2329#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2326#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 2327#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 2308#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; 2309#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2314#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 2315#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2328#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 2306#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2307#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2312#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2313#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2311#L772-3 [2019-11-20 08:02:49,032 INFO L796 eck$LassoCheckResult]: Loop: 2311#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 2310#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2311#L772-3 [2019-11-20 08:02:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:02:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash -694922329, now seen corresponding path program 1 times [2019-11-20 08:02:49,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:02:49,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111767239] [2019-11-20 08:02:49,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:02:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:02:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:02:49,087 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:02:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:02:49,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 2 times [2019-11-20 08:02:49,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:02:49,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146143582] [2019-11-20 08:02:49,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:02:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:02:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:02:49,097 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:02:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:02:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2100425303, now seen corresponding path program 1 times [2019-11-20 08:02:49,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:02:49,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560605945] [2019-11-20 08:02:49,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:02:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:02:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:02:49,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:05:53,693 WARN L191 SmtUtils]: Spent 3.07 m on a formula simplification. DAG size of input: 458 DAG size of output: 370 [2019-11-20 08:05:53,757 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:05:59,557 WARN L191 SmtUtils]: Spent 5.80 s on a formula simplification that was a NOOP. DAG size: 214 [2019-11-20 08:05:59,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:05:59,583 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:04,435 WARN L191 SmtUtils]: Spent 4.85 s on a formula simplification that was a NOOP. DAG size: 210 [2019-11-20 08:06:04,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:04,465 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:08,914 WARN L191 SmtUtils]: Spent 4.45 s on a formula simplification that was a NOOP. DAG size: 206 [2019-11-20 08:06:08,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:08,934 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:12,602 WARN L191 SmtUtils]: Spent 3.67 s on a formula simplification that was a NOOP. DAG size: 202 [2019-11-20 08:06:12,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:12,618 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:15,844 WARN L191 SmtUtils]: Spent 3.23 s on a formula simplification that was a NOOP. DAG size: 198 [2019-11-20 08:06:15,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:15,855 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:18,621 WARN L191 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 194 [2019-11-20 08:06:18,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:18,651 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:21,392 WARN L191 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 191 [2019-11-20 08:06:21,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:21,411 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:23,323 WARN L191 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 187 [2019-11-20 08:06:23,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:23,337 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:25,099 WARN L191 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 183 [2019-11-20 08:06:25,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:25,105 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:25,947 WARN L191 SmtUtils]: Spent 841.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-11-20 08:06:25,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:06:25,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 10 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-20 08:06:25,949 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:710, output treesize:630 [2019-11-20 08:06:26,766 WARN L191 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-11-20 08:06:26,769 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 08:06:26,769 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 08:06:26,769 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 08:06:26,769 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 08:06:26,769 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 08:06:26,770 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:26,770 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 08:06:26,770 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 08:06:26,770 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration18_Lasso [2019-11-20 08:06:26,770 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 08:06:26,770 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 08:06:26,773 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-20 08:06:26,782 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-20 08:06:26,783 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-20 08:06:26,785 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-20 08:06:26,786 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-20 08:06:26,788 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-20 08:06:26,790 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-20 08:06:26,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-20 08:06:26,796 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-20 08:06:26,800 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-20 08:06:26,804 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-20 08:06:26,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-20 08:06:26,807 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-20 08:06:26,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-20 08:06:26,810 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-20 08:06:26,812 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-20 08:06:26,814 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-20 08:06:26,815 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-20 08:06:27,325 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-11-20 08:06:27,399 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-20 08:06:27,401 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-20 08:06:27,402 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-20 08:06:27,405 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-20 08:06:27,406 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-20 08:06:27,407 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-20 08:06:27,409 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-20 08:06:27,986 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-11-20 08:06:28,015 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 08:06:28,016 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,019 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-20 08:06:28,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,026 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-20 08:06:28,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,034 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-20 08:06:28,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,042 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-20 08:06:28,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,053 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-20 08:06:28,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,064 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-20 08:06:28,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,073 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-20 08:06:28,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 08:06:28,106 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-20 08:06:28,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 08:06:28,130 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-20 08:06:28,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,154 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-20 08:06:28,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,167 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-20 08:06:28,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,175 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-20 08:06:28,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,186 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-20 08:06:28,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,194 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-20 08:06:28,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,203 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-20 08:06:28,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,213 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-20 08:06:28,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,222 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-20 08:06:28,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,235 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-20 08:06:28,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,245 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-20 08:06:28,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,255 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-20 08:06:28,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,263 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-20 08:06:28,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,273 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-20 08:06:28,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:06:28,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:06:28,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:06:28,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,280 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-20 08:06:28,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,297 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-20 08:06:28,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:06:28,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:06:28,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:06:28,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:06:28,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:06:28,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:06:28,321 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 08:06:28,339 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-20 08:06:28,339 INFO L444 ModelExtractionUtils]: 19 out of 40 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e7d72e-ff8b-4434-be7e-e4e4824bc0b6/bin/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:06:28,346 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 08:06:28,348 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 08:06:28,348 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 08:06:28,348 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2019-11-20 08:06:28,372 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-20 08:06:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:28,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:06:28,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:06:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:28,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:06:28,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:06:28,430 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-20 08:06:28,431 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-20 08:06:28,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-20 08:06:28,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 41 states and 45 transitions. Complement of second has 4 states. [2019-11-20 08:06:28,438 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-20 08:06:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 08:06:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-20 08:06:28,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 37 letters. Loop has 2 letters. [2019-11-20 08:06:28,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:06:28,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 39 letters. Loop has 2 letters. [2019-11-20 08:06:28,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:06:28,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 37 letters. Loop has 4 letters. [2019-11-20 08:06:28,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:06:28,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2019-11-20 08:06:28,440 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 08:06:28,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-20 08:06:28,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 08:06:28,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 08:06:28,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 08:06:28,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 08:06:28,441 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:06:28,441 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:06:28,441 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:06:28,441 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-20 08:06:28,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 08:06:28,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 08:06:28,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 08:06:28,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 08:06:28 BoogieIcfgContainer [2019-11-20 08:06:28,446 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 08:06:28,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:06:28,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:06:28,447 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:06:28,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:57:16" (3/4) ... [2019-11-20 08:06:28,449 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 08:06:28,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:06:28,450 INFO L168 Benchmark]: Toolchain (without parser) took 553872.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -81.2 MB). Peak memory consumption was 128.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:06:28,450 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:06:28,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:06:28,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:06:28,451 INFO L168 Benchmark]: Boogie Preprocessor took 36.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:06:28,451 INFO L168 Benchmark]: RCFGBuilder took 479.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-11-20 08:06:28,451 INFO L168 Benchmark]: BuchiAutomizer took 552417.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.9 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. [2019-11-20 08:06:28,452 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:06:28,453 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 865.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 479.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 552417.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.9 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (14 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[malloc(size)] + -2 * i and consists of 6 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 552.3s and 19 iterations. TraceHistogramMax:10. Analysis of lassos took 550.3s. Construction of modules took 0.6s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 71 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 404 SDtfs, 528 SDslu, 1097 SDs, 0 SdLazy, 510 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU13 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital495 mio100 ax107 hnf100 lsp88 ukn38 mio100 lsp53 div100 bol100 ite100 ukn100 eq186 hnf89 smp95 dnf105 smp96 tf100 neg98 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 76ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...