./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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 5be2e30df948ebd6000c3afde848283ab7f83dcc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:17:03,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:17:03,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:17:03,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:17:03,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:17:03,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:17:03,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:17:03,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:17:03,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:17:03,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:17:03,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:17:03,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:17:03,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:17:03,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:17:03,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:17:03,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:17:03,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:17:03,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:17:03,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:17:03,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:17:03,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:17:03,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:17:03,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:17:03,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:17:03,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:17:03,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:17:03,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:17:03,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:17:03,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:17:03,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:17:03,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:17:03,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:17:03,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:17:03,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:17:03,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:17:03,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:17:03,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:17:03,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:17:03,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:17:03,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:17:03,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:17:03,409 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 13:17:03,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:17:03,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:17:03,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:17:03,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:17:03,420 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:17:03,421 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 13:17:03,421 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 13:17:03,421 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 13:17:03,421 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 13:17:03,421 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 13:17:03,421 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 13:17:03,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:17:03,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:17:03,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:17:03,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:17:03,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 13:17:03,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:17:03,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:17:03,423 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 13:17:03,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:17:03,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:17:03,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:17:03,423 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 13:17:03,424 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 13:17:03,424 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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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 -> 5be2e30df948ebd6000c3afde848283ab7f83dcc [2019-12-07 13:17:03,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:17:03,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:17:03,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:17:03,535 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:17:03,536 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:17:03,536 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2019-12-07 13:17:03,579 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/data/f57b9d45f/eeb1629cf94643429a77e6dac8aa54a9/FLAGf171a0f91 [2019-12-07 13:17:03,951 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:17:03,952 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2019-12-07 13:17:03,964 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/data/f57b9d45f/eeb1629cf94643429a77e6dac8aa54a9/FLAGf171a0f91 [2019-12-07 13:17:03,974 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/data/f57b9d45f/eeb1629cf94643429a77e6dac8aa54a9 [2019-12-07 13:17:03,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:17:03,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:17:03,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:17:03,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:17:03,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:17:03,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:17:03" (1/1) ... [2019-12-07 13:17:03,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382632cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:03, skipping insertion in model container [2019-12-07 13:17:03,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:17:03" (1/1) ... [2019-12-07 13:17:03,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:17:04,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:17:04,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:17:04,303 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:17:04,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:17:04,393 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:17:04,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04 WrapperNode [2019-12-07 13:17:04,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:17:04,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:17:04,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:17:04,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:17:04,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:17:04,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:17:04,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:17:04,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:17:04,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... [2019-12-07 13:17:04,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:17:04,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:17:04,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:17:04,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:17:04,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:17:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:17:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:17:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:17:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:17:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 13:17:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:17:04,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:17:04,677 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:17:04,677 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-12-07 13:17:04,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:04 BoogieIcfgContainer [2019-12-07 13:17:04,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:17:04,679 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 13:17:04,679 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 13:17:04,681 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 13:17:04,681 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 13:17:04,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 01:17:03" (1/3) ... [2019-12-07 13:17:04,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@802f66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 01:17:04, skipping insertion in model container [2019-12-07 13:17:04,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 13:17:04,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:04" (2/3) ... [2019-12-07 13:17:04,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@802f66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 01:17:04, skipping insertion in model container [2019-12-07 13:17:04,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 13:17:04,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:04" (3/3) ... [2019-12-07 13:17:04,684 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2019-12-07 13:17:04,712 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 13:17:04,712 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 13:17:04,712 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 13:17:04,712 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:17:04,712 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:17:04,712 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 13:17:04,712 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:17:04,712 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 13:17:04,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-12-07 13:17:04,735 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 13:17:04,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:04,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:04,739 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:04,740 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:17:04,740 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 13:17:04,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-12-07 13:17:04,741 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 13:17:04,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:04,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:04,742 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:04,742 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:17:04,745 INFO L794 eck$LassoCheckResult]: Stem: 14#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); 10#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; 4#L526true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 21#L529true 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; 15#L787true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 22#L788-3true [2019-12-07 13:17:04,745 INFO L796 eck$LassoCheckResult]: Loop: 22#L788-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); 18#L788-2true entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 22#L788-3true [2019-12-07 13:17:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-12-07 13:17:04,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:04,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034612963] [2019-12-07 13:17:04,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:04,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034612963] [2019-12-07 13:17:04,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:04,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:04,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488754145] [2019-12-07 13:17:04,872 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2019-12-07 13:17:04,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:04,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590152716] [2019-12-07 13:17:04,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:04,903 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:04,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:04,969 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-12-07 13:17:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:05,011 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-12-07 13:17:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:17:05,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2019-12-07 13:17:05,014 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2019-12-07 13:17:05,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 41 transitions. [2019-12-07 13:17:05,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-12-07 13:17:05,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-12-07 13:17:05,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-12-07 13:17:05,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:05,019 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-12-07 13:17:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-12-07 13:17:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-12-07 13:17:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 13:17:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-12-07 13:17:05,037 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-12-07 13:17:05,037 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-12-07 13:17:05,037 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 13:17:05,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-12-07 13:17:05,038 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 13:17:05,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:05,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:05,039 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:05,039 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:17:05,039 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); 91#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; 84#L526 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; 85#L529 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; 98#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 99#L788-3 [2019-12-07 13:17:05,040 INFO L796 eck$LassoCheckResult]: Loop: 99#L788-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); 100#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 99#L788-3 [2019-12-07 13:17:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2019-12-07 13:17:05,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:05,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929045140] [2019-12-07 13:17:05,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:05,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:05,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:05,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2019-12-07 13:17:05,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:05,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232832891] [2019-12-07 13:17:05,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:05,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:05,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:05,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2019-12-07 13:17:05,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:05,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626080638] [2019-12-07 13:17:05,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:05,119 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:05,305 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-12-07 13:17:05,378 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 13:17:05,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 13:17:05,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 13:17:05,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 13:17:05,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 13:17:05,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:17:05,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 13:17:05,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 13:17:05,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2019-12-07 13:17:05,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 13:17:05,380 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 13:17:05,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-12-07 13:17:05,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,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-12-07 13:17:05,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-12-07 13:17:05,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,569 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-12-07 13:17:05,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:17:05,931 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 13:17:05,935 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:05,939 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-12-07 13:17:05,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:05,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:17:05,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:05,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:05,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:05,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:17:05,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:17:05,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:17:05,950 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-12-07 13:17:05,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:05,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:17:05,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:05,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:05,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:05,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:17:05,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:17:05,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:05,958 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-12-07 13:17:05,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:05,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:05,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:05,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:05,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:17:05,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:17:05,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:17:05,969 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-12-07 13:17:05,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:05,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:05,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:05,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:05,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:17:05,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:17:05,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:05,980 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-12-07 13:17:05,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:05,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:05,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:05,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:05,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:17:05,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:17:05,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:05,991 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-12-07 13:17:05,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:05,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:05,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:05,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:05,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:17:05,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:17:05,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:17:06,003 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-12-07 13:17:06,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:06,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:06,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:06,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:06,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:17:06,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:17:06,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:06,015 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-12-07 13:17:06,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:06,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:06,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:06,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:06,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:17:06,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:17:06,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:06,029 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-12-07 13:17:06,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:06,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:17:06,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:06,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:06,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:06,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:17:06,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:17:06,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:06,037 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-12-07 13:17:06,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:17:06,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:17:06,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:17:06,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:17:06,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:17:06,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:17:06,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 13:17:06,083 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-12-07 13:17:06,084 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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:17:06,089 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 13:17:06,098 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 13:17:06,099 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 13:17:06,099 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~2, v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1) = -2*ULTIMATE.start_entry_point_~i~2 + 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1 Supporting invariants [-2*ULTIMATE.start_entry_point_~len~0 + 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1 >= 0] [2019-12-07 13:17:06,123 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-12-07 13:17:06,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 13:17:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:06,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:17:06,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:06,205 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-12-07 13:17:06,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:17:06,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:17:06,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:17:06,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-12-07 13:17:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:06,228 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:17:06,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:06,242 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-12-07 13:17:06,243 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-12-07 13:17:06,329 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-12-07 13:17:06,329 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-12-07 13:17:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-12-07 13:17:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-12-07 13:17:06,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2019-12-07 13:17:06,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:17:06,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2019-12-07 13:17:06,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:17:06,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-12-07 13:17:06,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:17:06,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2019-12-07 13:17:06,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 13:17:06,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 34 transitions. [2019-12-07 13:17:06,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-12-07 13:17:06,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-12-07 13:17:06,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-12-07 13:17:06,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:06,335 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-12-07 13:17:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-12-07 13:17:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-12-07 13:17:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:17:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-12-07 13:17:06,337 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-12-07 13:17:06,337 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-12-07 13:17:06,337 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 13:17:06,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-12-07 13:17:06,337 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:06,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:06,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:06,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:06,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:06,338 INFO L794 eck$LassoCheckResult]: Stem: 241#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); 235#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; 228#L526 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; 229#L529 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; 242#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 243#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 246#L788-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; 225#L764-3 [2019-12-07 13:17:06,338 INFO L796 eck$LassoCheckResult]: Loop: 225#L764-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#L526-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; 231#L529-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; 238#L766 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); 240#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 225#L764-3 [2019-12-07 13:17:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2019-12-07 13:17:06,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:06,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905286693] [2019-12-07 13:17:06,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:06,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905286693] [2019-12-07 13:17:06,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:06,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:17:06,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131721116] [2019-12-07 13:17:06,364 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:06,364 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2019-12-07 13:17:06,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:06,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748332279] [2019-12-07 13:17:06,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:06,378 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:06,483 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-12-07 13:17:06,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:06,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:06,527 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-12-07 13:17:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:06,539 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-12-07 13:17:06,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:17:06,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2019-12-07 13:17:06,540 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:06,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2019-12-07 13:17:06,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:06,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:06,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-12-07 13:17:06,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:06,541 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-12-07 13:17:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-12-07 13:17:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-12-07 13:17:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:17:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-12-07 13:17:06,542 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-12-07 13:17:06,542 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-12-07 13:17:06,543 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 13:17:06,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-12-07 13:17:06,543 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:06,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:06,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:06,544 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:06,544 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:06,544 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); 287#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; 280#L526 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; 281#L529 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; 293#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 294#L788-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); 296#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 297#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 298#L788-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; 277#L764-3 [2019-12-07 13:17:06,544 INFO L796 eck$LassoCheckResult]: Loop: 277#L764-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#L526-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; 283#L529-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; 290#L766 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); 292#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 277#L764-3 [2019-12-07 13:17:06,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2019-12-07 13:17:06,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:06,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792663754] [2019-12-07 13:17:06,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:06,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792663754] [2019-12-07 13:17:06,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129459154] [2019-12-07 13:17:06,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:06,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:17:06,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:06,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:06,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 13:17:06,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915236995] [2019-12-07 13:17:06,623 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2019-12-07 13:17:06,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:06,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392277118] [2019-12-07 13:17:06,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:06,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:06,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:06,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:17:06,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:17:06,784 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-12-07 13:17:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:06,801 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-12-07 13:17:06,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:17:06,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2019-12-07 13:17:06,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:06,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2019-12-07 13:17:06,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:06,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:06,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2019-12-07 13:17:06,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:06,803 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-12-07 13:17:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2019-12-07 13:17:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-12-07 13:17:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:17:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-12-07 13:17:06,804 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-12-07 13:17:06,804 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-12-07 13:17:06,804 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 13:17:06,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2019-12-07 13:17:06,805 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:06,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:06,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:06,805 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:06,805 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:06,806 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); 368#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; 361#L526 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; 362#L529 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; 375#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 376#L788-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); 377#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 378#L788-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); 379#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 381#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 380#L788-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; 358#L764-3 [2019-12-07 13:17:06,806 INFO L796 eck$LassoCheckResult]: Loop: 358#L764-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#L526-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; 364#L529-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; 371#L766 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); 373#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 358#L764-3 [2019-12-07 13:17:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash 447769425, now seen corresponding path program 2 times [2019-12-07 13:17:06,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:06,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562354680] [2019-12-07 13:17:06,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:06,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562354680] [2019-12-07 13:17:06,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629235740] [2019-12-07 13:17:06,837 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:06,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:17:06,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:17:06,872 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:17:06,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:06,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:06,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-12-07 13:17:06,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373049380] [2019-12-07 13:17:06,894 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2019-12-07 13:17:06,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:06,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559525176] [2019-12-07 13:17:06,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:06,908 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:07,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:07,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:17:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:17:07,055 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand 9 states. [2019-12-07 13:17:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:07,081 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-12-07 13:17:07,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:17:07,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-12-07 13:17:07,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:07,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-12-07 13:17:07,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:07,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:07,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-12-07 13:17:07,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:07,082 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 13:17:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-12-07 13:17:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-12-07 13:17:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 13:17:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-12-07 13:17:07,084 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-12-07 13:17:07,084 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-12-07 13:17:07,084 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 13:17:07,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2019-12-07 13:17:07,085 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:07,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:07,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:07,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:07,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:07,085 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); 461#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; 454#L526 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; 455#L529 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; 468#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 469#L788-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); 470#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 471#L788-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); 476#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 472#L788-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); 473#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 475#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 474#L788-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; 451#L764-3 [2019-12-07 13:17:07,085 INFO L796 eck$LassoCheckResult]: Loop: 451#L764-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#L526-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; 457#L529-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; 464#L766 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); 466#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 451#L764-3 [2019-12-07 13:17:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash 809744147, now seen corresponding path program 3 times [2019-12-07 13:17:07,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:07,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919712025] [2019-12-07 13:17:07,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:07,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919712025] [2019-12-07 13:17:07,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471286910] [2019-12-07 13:17:07,121 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:07,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 13:17:07,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:17:07,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:17:07,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:07,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:07,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-12-07 13:17:07,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491705829] [2019-12-07 13:17:07,188 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2019-12-07 13:17:07,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:07,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827980182] [2019-12-07 13:17:07,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:07,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:07,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:17:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:17:07,333 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 9 Second operand 11 states. [2019-12-07 13:17:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:07,362 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-12-07 13:17:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:17:07,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-12-07 13:17:07,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:07,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2019-12-07 13:17:07,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:07,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:07,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2019-12-07 13:17:07,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:07,363 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-12-07 13:17:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2019-12-07 13:17:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-12-07 13:17:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 13:17:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-12-07 13:17:07,365 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-12-07 13:17:07,365 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-12-07 13:17:07,365 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 13:17:07,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-12-07 13:17:07,365 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:07,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:07,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:07,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:07,366 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:07,366 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); 566#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; 559#L526 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; 560#L529 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; 573#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 574#L788-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); 577#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 578#L788-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); 575#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 576#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 582#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 580#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 579#L788-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; 556#L764-3 [2019-12-07 13:17:07,366 INFO L796 eck$LassoCheckResult]: Loop: 556#L764-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#L526-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; 562#L529-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; 569#L766 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); 571#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 556#L764-3 [2019-12-07 13:17:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 4 times [2019-12-07 13:17:07,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:07,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697656896] [2019-12-07 13:17:07,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:07,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697656896] [2019-12-07 13:17:07,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606269373] [2019-12-07 13:17:07,426 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:07,459 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:17:07,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:17:07,460 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:17:07,461 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:07,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:07,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-12-07 13:17:07,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367398946] [2019-12-07 13:17:07,499 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:07,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:07,499 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 5 times [2019-12-07 13:17:07,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:07,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648927215] [2019-12-07 13:17:07,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:07,507 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:07,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:07,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:17:07,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:17:07,641 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-12-07 13:17:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:07,666 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-12-07 13:17:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:17:07,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-12-07 13:17:07,667 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:07,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2019-12-07 13:17:07,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:07,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:07,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2019-12-07 13:17:07,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:07,668 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-12-07 13:17:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2019-12-07 13:17:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-12-07 13:17:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 13:17:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-12-07 13:17:07,669 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-12-07 13:17:07,669 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-12-07 13:17:07,669 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 13:17:07,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2019-12-07 13:17:07,670 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:07,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:07,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:07,670 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:07,670 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:07,670 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); 683#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; 676#L526 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; 677#L529 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; 690#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 691#L788-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); 694#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 695#L788-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); 692#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 693#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 701#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 699#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 697#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 696#L788-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; 673#L764-3 [2019-12-07 13:17:07,670 INFO L796 eck$LassoCheckResult]: Loop: 673#L764-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#L526-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; 679#L529-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; 686#L766 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); 688#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 673#L764-3 [2019-12-07 13:17:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1842787607, now seen corresponding path program 5 times [2019-12-07 13:17:07,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:07,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821903171] [2019-12-07 13:17:07,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:07,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821903171] [2019-12-07 13:17:07,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105361113] [2019-12-07 13:17:07,720 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:07,776 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 13:17:07,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:17:07,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:17:07,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:07,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:07,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-12-07 13:17:07,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784837381] [2019-12-07 13:17:07,820 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:07,820 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 6 times [2019-12-07 13:17:07,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:07,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849215515] [2019-12-07 13:17:07,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:07,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:07,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:17:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:17:07,959 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 9 Second operand 15 states. [2019-12-07 13:17:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:07,992 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-12-07 13:17:07,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:17:07,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2019-12-07 13:17:07,993 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:07,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2019-12-07 13:17:07,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:07,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:07,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2019-12-07 13:17:07,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:07,994 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-12-07 13:17:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2019-12-07 13:17:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-12-07 13:17:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 13:17:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-12-07 13:17:07,997 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-12-07 13:17:07,997 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-12-07 13:17:07,997 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 13:17:07,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2019-12-07 13:17:07,997 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:07,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:07,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:07,998 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:07,998 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:07,999 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); 812#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; 805#L526 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; 806#L529 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; 819#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 820#L788-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); 823#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 824#L788-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); 821#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 822#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 832#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 830#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 828#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 826#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 825#L788-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; 802#L764-3 [2019-12-07 13:17:07,999 INFO L796 eck$LassoCheckResult]: Loop: 802#L764-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#L526-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; 808#L529-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; 815#L766 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); 817#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 802#L764-3 [2019-12-07 13:17:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1392420697, now seen corresponding path program 6 times [2019-12-07 13:17:07,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:07,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735705562] [2019-12-07 13:17:07,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:08,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735705562] [2019-12-07 13:17:08,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211537230] [2019-12-07 13:17:08,059 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:08,127 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-07 13:17:08,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:17:08,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:17:08,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:08,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:08,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-12-07 13:17:08,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880664044] [2019-12-07 13:17:08,181 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 7 times [2019-12-07 13:17:08,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:08,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708239936] [2019-12-07 13:17:08,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:08,189 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:08,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:08,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 13:17:08,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:17:08,330 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 9 Second operand 17 states. [2019-12-07 13:17:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:08,373 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-12-07 13:17:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:17:08,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2019-12-07 13:17:08,374 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:08,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 40 transitions. [2019-12-07 13:17:08,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:08,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:08,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-12-07 13:17:08,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:08,375 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-12-07 13:17:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-12-07 13:17:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-12-07 13:17:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 13:17:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-12-07 13:17:08,377 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-12-07 13:17:08,377 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-12-07 13:17:08,377 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 13:17:08,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2019-12-07 13:17:08,377 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:08,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:08,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:08,378 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:08,378 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:08,378 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); 953#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; 946#L526 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; 947#L529 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; 960#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 961#L788-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); 964#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 965#L788-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); 962#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 963#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 975#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 973#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 971#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 969#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 967#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 966#L788-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; 943#L764-3 [2019-12-07 13:17:08,378 INFO L796 eck$LassoCheckResult]: Loop: 943#L764-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#L526-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; 949#L529-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; 956#L766 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); 958#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 943#L764-3 [2019-12-07 13:17:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1913450213, now seen corresponding path program 7 times [2019-12-07 13:17:08,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:08,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49984500] [2019-12-07 13:17:08,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:08,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49984500] [2019-12-07 13:17:08,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957074015] [2019-12-07 13:17:08,441 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:08,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 13:17:08,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:08,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:08,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-12-07 13:17:08,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689044401] [2019-12-07 13:17:08,541 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 8 times [2019-12-07 13:17:08,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:08,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164134591] [2019-12-07 13:17:08,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:08,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:08,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:08,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 13:17:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:17:08,693 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 9 Second operand 19 states. [2019-12-07 13:17:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:08,746 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-12-07 13:17:08,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:17:08,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2019-12-07 13:17:08,747 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:08,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2019-12-07 13:17:08,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:08,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:08,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2019-12-07 13:17:08,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:08,747 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-12-07 13:17:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2019-12-07 13:17:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-12-07 13:17:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 13:17:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-12-07 13:17:08,749 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-12-07 13:17:08,749 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-12-07 13:17:08,749 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 13:17:08,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2019-12-07 13:17:08,749 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:08,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:08,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:08,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:08,750 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:08,750 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); 1106#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; 1099#L526 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; 1100#L529 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; 1113#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1114#L788-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); 1117#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1118#L788-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); 1115#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1116#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1130#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1128#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1126#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1124#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1122#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1120#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1119#L788-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; 1096#L764-3 [2019-12-07 13:17:08,750 INFO L796 eck$LassoCheckResult]: Loop: 1096#L764-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#L526-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; 1102#L529-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; 1109#L766 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); 1111#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1096#L764-3 [2019-12-07 13:17:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:08,751 INFO L82 PathProgramCache]: Analyzing trace with hash -579595683, now seen corresponding path program 8 times [2019-12-07 13:17:08,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:08,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849848013] [2019-12-07 13:17:08,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:08,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849848013] [2019-12-07 13:17:08,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742329263] [2019-12-07 13:17:08,812 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:08,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:17:08,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:17:08,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:17:08,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:08,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:08,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-12-07 13:17:08,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518858091] [2019-12-07 13:17:08,925 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:08,925 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 9 times [2019-12-07 13:17:08,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:08,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266855801] [2019-12-07 13:17:08,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:08,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:09,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:09,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 13:17:09,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:17:09,060 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 9 Second operand 21 states. [2019-12-07 13:17:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:09,106 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-12-07 13:17:09,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:17:09,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2019-12-07 13:17:09,107 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:09,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2019-12-07 13:17:09,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:09,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:09,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2019-12-07 13:17:09,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:09,108 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-12-07 13:17:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2019-12-07 13:17:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-12-07 13:17:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 13:17:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-12-07 13:17:09,109 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-12-07 13:17:09,109 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-12-07 13:17:09,110 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 13:17:09,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2019-12-07 13:17:09,110 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:09,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:09,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:09,111 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:09,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:09,111 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); 1271#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; 1264#L526 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; 1265#L529 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; 1278#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1279#L788-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); 1282#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1283#L788-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); 1280#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1281#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1297#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1295#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1293#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1291#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1289#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1287#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1285#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1284#L788-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; 1261#L764-3 [2019-12-07 13:17:09,111 INFO L796 eck$LassoCheckResult]: Loop: 1261#L764-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#L526-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; 1267#L529-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; 1274#L766 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); 1276#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1261#L764-3 [2019-12-07 13:17:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1354353439, now seen corresponding path program 9 times [2019-12-07 13:17:09,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:09,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352387588] [2019-12-07 13:17:09,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:09,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352387588] [2019-12-07 13:17:09,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484159809] [2019-12-07 13:17:09,196 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:17:09,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 13:17:09,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:17:09,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:17:09,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:17:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:09,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:17:09,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-12-07 13:17:09,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533986849] [2019-12-07 13:17:09,696 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:17:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 10 times [2019-12-07 13:17:09,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:09,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667820420] [2019-12-07 13:17:09,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:09,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:09,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:09,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 13:17:09,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2019-12-07 13:17:09,835 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 23 states. [2019-12-07 13:17:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:09,884 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-12-07 13:17:09,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:17:09,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2019-12-07 13:17:09,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:09,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2019-12-07 13:17:09,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:17:09,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 13:17:09,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2019-12-07 13:17:09,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:17:09,886 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-12-07 13:17:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2019-12-07 13:17:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-12-07 13:17:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 13:17:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-12-07 13:17:09,887 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-12-07 13:17:09,887 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-12-07 13:17:09,887 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 13:17:09,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2019-12-07 13:17:09,888 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 13:17:09,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:17:09,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:17:09,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:09,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 13:17:09,888 INFO L794 eck$LassoCheckResult]: Stem: 1456#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); 1450#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; 1443#L526 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; 1444#L529 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; 1457#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1458#L788-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); 1461#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1462#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1460#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1478#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1476#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1474#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1472#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1470#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1468#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1466#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1464#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1463#L788-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; 1440#L764-3 [2019-12-07 13:17:09,888 INFO L796 eck$LassoCheckResult]: Loop: 1440#L764-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#L526-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; 1446#L529-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; 1453#L766 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); 1455#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1440#L764-3 [2019-12-07 13:17:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 10 times [2019-12-07 13:17:09,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:09,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302232933] [2019-12-07 13:17:09,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:09,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 11 times [2019-12-07 13:17:09,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:09,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621485966] [2019-12-07 13:17:09,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:09,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2019-12-07 13:17:09,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:09,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137654952] [2019-12-07 13:17:09,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:09,951 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:18:29,076 WARN L192 SmtUtils]: Spent 1.32 m on a formula simplification. DAG size of input: 372 DAG size of output: 304 [2019-12-07 13:18:29,179 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:18:35,319 WARN L192 SmtUtils]: Spent 6.14 s on a formula simplification that was a NOOP. DAG size: 191 [2019-12-07 13:18:35,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:18:35,370 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:18:41,474 WARN L192 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 13:18:41,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:18:41,507 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:18:46,826 WARN L192 SmtUtils]: Spent 5.32 s on a formula simplification that was a NOOP. DAG size: 183 [2019-12-07 13:18:46,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:18:46,879 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:18:51,593 WARN L192 SmtUtils]: Spent 4.71 s on a formula simplification that was a NOOP. DAG size: 179 [2019-12-07 13:18:51,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:18:51,629 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:18:55,797 WARN L192 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 175 [2019-12-07 13:18:55,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:18:55,826 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:18:58,908 WARN L192 SmtUtils]: Spent 3.08 s on a formula simplification that was a NOOP. DAG size: 171 [2019-12-07 13:18:58,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:18:58,923 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:19:00,911 WARN L192 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 167 [2019-12-07 13:19:00,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:19:00,923 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:19:01,891 WARN L192 SmtUtils]: Spent 967.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-12-07 13:19:01,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:19:01,910 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:19:02,747 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-12-07 13:19:02,747 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:19:02,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 13:19:02,749 INFO L239 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:561, output treesize:413 [2019-12-07 13:19:03,585 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-12-07 13:19:03,588 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 13:19:03,588 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 13:19:03,588 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 13:19:03,588 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 13:19:03,589 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 13:19:03,589 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:19:03,589 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 13:19:03,589 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 13:19:03,589 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration13_Lasso [2019-12-07 13:19:03,589 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 13:19:03,589 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 13:19:03,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:03,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:03,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:03,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:03,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:03,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:03,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:03,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:03,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,015 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-07 13:19:04,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:19:04,529 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 13:19:04,529 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,535 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-12-07 13:19:04,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:19:04,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:19:04,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:19:04,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,543 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-12-07 13:19:04,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:19:04,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:19:04,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:19:04,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,549 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-12-07 13:19:04,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:19:04,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:19:04,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,558 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-12-07 13:19:04,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:19:04,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:19:04,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,568 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-12-07 13:19:04,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:19:04,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:19:04,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:19:04,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,575 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-12-07 13:19:04,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:19:04,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:19:04,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:19:04,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,582 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-12-07 13:19:04,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:19:04,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:19:04,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:19:04,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,588 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-12-07 13:19:04,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:19:04,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:19:04,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,598 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-12-07 13:19:04,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,599 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-12-07 13:19:04,599 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-12-07 13:19:04,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,608 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-12-07 13:19:04,608 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-12-07 13:19:04,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,637 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-12-07 13:19:04,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:19:04,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:19:04,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:19:04,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:19:04,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:19:04,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:19:04,664 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 13:19:04,686 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-12-07 13:19:04,686 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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:19:04,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 13:19:04,690 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 13:19:04,690 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 13:19:04,691 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-12-07 13:19:04,719 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-12-07 13:19:04,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:04,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:19:04,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:19:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:04,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:19:04,768 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:19:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:19:04,778 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-12-07 13:19:04,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-12-07 13:19:04,805 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-12-07 13:19:04,805 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-12-07 13:19:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 13:19:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-12-07 13:19:04,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 27 letters. Loop has 5 letters. [2019-12-07 13:19:04,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:19:04,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 32 letters. Loop has 5 letters. [2019-12-07 13:19:04,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:19:04,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 27 letters. Loop has 10 letters. [2019-12-07 13:19:04,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:19:04,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2019-12-07 13:19:04,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-12-07 13:19:04,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 55 transitions. [2019-12-07 13:19:04,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 13:19:04,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-12-07 13:19:04,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2019-12-07 13:19:04,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 13:19:04,809 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-12-07 13:19:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2019-12-07 13:19:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-12-07 13:19:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 13:19:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-12-07 13:19:04,811 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-12-07 13:19:04,811 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-12-07 13:19:04,811 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 13:19:04,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2019-12-07 13:19:04,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-12-07 13:19:04,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:04,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:04,812 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:19:04,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:19:04,812 INFO L794 eck$LassoCheckResult]: Stem: 1718#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); 1711#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; 1703#L526 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; 1704#L529 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; 1719#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1720#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1722#L788-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); 1723#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1741#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1739#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1737#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1735#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1733#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1731#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1729#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1727#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1725#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1724#L788-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; 1698#L764-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1699#L764-4 alloc_17_#res := 0; 1705#L775 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; 1713#L779-3 [2019-12-07 13:19:04,812 INFO L796 eck$LassoCheckResult]: Loop: 1713#L779-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; 1712#L779-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1713#L779-3 [2019-12-07 13:19:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2019-12-07 13:19:04,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:04,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901499082] [2019-12-07 13:19:04,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 13:19:04,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901499082] [2019-12-07 13:19:04,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:19:04,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:19:04,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618175016] [2019-12-07 13:19:04,847 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:19:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2019-12-07 13:19:04,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:04,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854133539] [2019-12-07 13:19:04,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:04,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:04,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:19:04,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:19:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:19:04,871 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-12-07 13:19:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:19:04,886 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-12-07 13:19:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:19:04,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2019-12-07 13:19:04,887 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-12-07 13:19:04,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2019-12-07 13:19:04,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-12-07 13:19:04,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-12-07 13:19:04,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2019-12-07 13:19:04,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 13:19:04,888 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-12-07 13:19:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2019-12-07 13:19:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2019-12-07 13:19:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 13:19:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-12-07 13:19:04,891 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-12-07 13:19:04,891 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-12-07 13:19:04,891 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-12-07 13:19:04,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2019-12-07 13:19:04,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-12-07 13:19:04,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:04,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:04,892 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:19:04,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:19:04,893 INFO L794 eck$LassoCheckResult]: Stem: 1827#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); 1820#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; 1812#L526 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; 1813#L529 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; 1828#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1829#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1831#L788-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); 1832#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1850#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1848#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1846#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1844#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1842#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1840#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1838#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1836#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1834#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1833#L788-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; 1807#L764-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#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1815#L529-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; 1823#L766 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1824#L766-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1818#L771-3 [2019-12-07 13:19:04,893 INFO L796 eck$LassoCheckResult]: Loop: 1818#L771-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); 1817#L771-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1818#L771-3 [2019-12-07 13:19:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:04,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2019-12-07 13:19:04,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:04,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339850420] [2019-12-07 13:19:04,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:04,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:04,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:04,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2019-12-07 13:19:04,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:04,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076316763] [2019-12-07 13:19:04,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:04,927 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2019-12-07 13:19:04,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:04,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466869243] [2019-12-07 13:19:04,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 13:19:04,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466869243] [2019-12-07 13:19:04,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:19:04,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:19:04,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942145939] [2019-12-07 13:19:05,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:19:05,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:19:05,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:19:05,021 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-12-07 13:19:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:19:05,037 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-12-07 13:19:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:19:05,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 69 transitions. [2019-12-07 13:19:05,038 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-12-07 13:19:05,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 69 transitions. [2019-12-07 13:19:05,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-12-07 13:19:05,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-12-07 13:19:05,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2019-12-07 13:19:05,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 13:19:05,039 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-12-07 13:19:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2019-12-07 13:19:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2019-12-07 13:19:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 13:19:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-12-07 13:19:05,041 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-12-07 13:19:05,041 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-12-07 13:19:05,041 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-12-07 13:19:05,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2019-12-07 13:19:05,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-12-07 13:19:05,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:05,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:05,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:19:05,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:19:05,042 INFO L794 eck$LassoCheckResult]: Stem: 1944#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); 1937#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; 1928#L526 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; 1929#L529 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; 1945#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1946#L788-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); 1947#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1948#L788-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); 1949#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1970#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1968#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1966#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1964#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1962#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1960#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1957#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1953#L788-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); 1952#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1951#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1950#L788-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; 1922#L764-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; 1923#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1932#L529-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; 1942#L766 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); 1943#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1925#L764-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1926#L764-4 alloc_17_#res := 0; 1930#L775 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; 1939#L779-3 [2019-12-07 13:19:05,042 INFO L796 eck$LassoCheckResult]: Loop: 1939#L779-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; 1938#L779-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1939#L779-3 [2019-12-07 13:19:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash -93871603, now seen corresponding path program 1 times [2019-12-07 13:19:05,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:05,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554542500] [2019-12-07 13:19:05,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 13:19:05,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554542500] [2019-12-07 13:19:05,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:19:05,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:19:05,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615031403] [2019-12-07 13:19:05,073 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:19:05,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2019-12-07 13:19:05,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:05,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744026198] [2019-12-07 13:19:05,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,076 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:05,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:19:05,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:19:05,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:19:05,099 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-12-07 13:19:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:19:05,116 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-12-07 13:19:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:19:05,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 75 transitions. [2019-12-07 13:19:05,117 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-12-07 13:19:05,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 73 transitions. [2019-12-07 13:19:05,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-12-07 13:19:05,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-12-07 13:19:05,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 73 transitions. [2019-12-07 13:19:05,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 13:19:05,117 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-12-07 13:19:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 73 transitions. [2019-12-07 13:19:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2019-12-07 13:19:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 13:19:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-12-07 13:19:05,119 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-12-07 13:19:05,119 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-12-07 13:19:05,119 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-12-07 13:19:05,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2019-12-07 13:19:05,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-12-07 13:19:05,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:05,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:05,120 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:19:05,120 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:19:05,121 INFO L794 eck$LassoCheckResult]: Stem: 2069#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); 2062#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; 2053#L526 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; 2054#L529 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; 2070#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2071#L788-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); 2072#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2073#L788-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); 2074#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2092#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2090#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2088#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2086#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2084#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2082#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2080#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2078#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2076#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2075#L788-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; 2047#L764-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; 2048#L526-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; 2057#L529-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; 2067#L766 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); 2068#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2050#L764-3 assume !(alloc_17_~i~0 < alloc_17_~len); 2051#L764-4 alloc_17_#res := 0; 2055#L775 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; 2064#L779-3 [2019-12-07 13:19:05,121 INFO L796 eck$LassoCheckResult]: Loop: 2064#L779-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; 2063#L779-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 2064#L779-3 [2019-12-07 13:19:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1868878965, now seen corresponding path program 1 times [2019-12-07 13:19:05,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:05,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667354046] [2019-12-07 13:19:05,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 13:19:05,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667354046] [2019-12-07 13:19:05,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786131327] [2019-12-07 13:19:05,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:19:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:05,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:19:05,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:19:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 13:19:05,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:19:05,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 13:19:05,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624981142] [2019-12-07 13:19:05,222 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 13:19:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 3 times [2019-12-07 13:19:05,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:05,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939127481] [2019-12-07 13:19:05,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:05,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:19:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:19:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:19:05,243 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-12-07 13:19:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:19:05,286 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-12-07 13:19:05,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:19:05,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 82 transitions. [2019-12-07 13:19:05,287 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-12-07 13:19:05,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 82 transitions. [2019-12-07 13:19:05,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-12-07 13:19:05,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-12-07 13:19:05,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 82 transitions. [2019-12-07 13:19:05,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 13:19:05,289 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-12-07 13:19:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 82 transitions. [2019-12-07 13:19:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2019-12-07 13:19:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 13:19:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-12-07 13:19:05,291 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-12-07 13:19:05,291 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-12-07 13:19:05,291 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-12-07 13:19:05,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2019-12-07 13:19:05,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-12-07 13:19:05,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:05,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:05,292 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:19:05,292 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:19:05,293 INFO L794 eck$LassoCheckResult]: Stem: 2305#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); 2298#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; 2288#L526 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; 2289#L529 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; 2306#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2307#L788-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); 2308#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2309#L788-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); 2310#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2333#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2331#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2329#L788-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); 2328#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2327#L788-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); 2326#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2325#L788-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#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2323#L788-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); 2322#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2321#L788-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); 2320#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2319#L788-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); 2316#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2315#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2311#L788-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; 2282#L764-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; 2284#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2335#L529-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; 2301#L766 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2302#L766-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2296#L771-3 assume !(alloc_17_~j~0 >= 0); 2297#L771-4 alloc_17_#res := 3; 2291#L775 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; 2300#L779-3 [2019-12-07 13:19:05,293 INFO L796 eck$LassoCheckResult]: Loop: 2300#L779-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; 2299#L779-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 2300#L779-3 [2019-12-07 13:19:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:05,293 INFO L82 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2019-12-07 13:19:05,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:05,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49531135] [2019-12-07 13:19:05,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,319 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 4 times [2019-12-07 13:19:05,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:05,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021877726] [2019-12-07 13:19:05,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:05,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2019-12-07 13:19:05,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:05,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375863928] [2019-12-07 13:19:05,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:05,355 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:20:41,424 WARN L192 SmtUtils]: Spent 1.60 m on a formula simplification. DAG size of input: 412 DAG size of output: 340 [2019-12-07 13:20:41,488 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:20:49,642 WARN L192 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 214 [2019-12-07 13:20:49,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:20:49,675 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:20:56,897 WARN L192 SmtUtils]: Spent 7.22 s on a formula simplification that was a NOOP. DAG size: 210 [2019-12-07 13:20:56,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:20:56,936 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:21:03,191 WARN L192 SmtUtils]: Spent 6.26 s on a formula simplification that was a NOOP. DAG size: 206 [2019-12-07 13:21:03,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:21:03,226 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:21:09,044 WARN L192 SmtUtils]: Spent 5.82 s on a formula simplification that was a NOOP. DAG size: 202 [2019-12-07 13:21:09,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:21:09,064 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:21:12,778 WARN L192 SmtUtils]: Spent 3.71 s on a formula simplification that was a NOOP. DAG size: 198 [2019-12-07 13:21:12,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:21:12,796 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:21:14,957 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 194 [2019-12-07 13:21:14,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:21:14,973 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:21:16,537 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 190 [2019-12-07 13:21:16,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:21:16,560 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:21:17,931 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 186 [2019-12-07 13:21:17,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:21:17,943 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:21:18,898 WARN L192 SmtUtils]: Spent 955.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-12-07 13:21:18,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:21:18,899 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 13:21:18,900 INFO L239 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:610, output treesize:457 [2019-12-07 13:21:19,862 WARN L192 SmtUtils]: Spent 962.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-12-07 13:21:19,865 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 13:21:19,865 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 13:21:19,865 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 13:21:19,865 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 13:21:19,865 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 13:21:19,865 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:21:19,865 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 13:21:19,865 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 13:21:19,865 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration18_Lasso [2019-12-07 13:21:19,865 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 13:21:19,865 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 13:21:19,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,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-12-07 13:21:19,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,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-12-07 13:21:19,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,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-12-07 13:21:19,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:19,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:20,184 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-07 13:21:20,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-12-07 13:21:20,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:20,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:21:20,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 13:21:20,580 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,584 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-12-07 13:21:20,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,591 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-12-07 13:21:20,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,597 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-12-07 13:21:20,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,607 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-12-07 13:21:20,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,619 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-12-07 13:21:20,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,628 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-12-07 13:21:20,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,635 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-12-07 13:21:20,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,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-12-07 13:21:20,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,651 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-12-07 13:21:20,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,660 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-12-07 13:21:20,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,669 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-12-07 13:21:20,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,678 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-12-07 13:21:20,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,684 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-12-07 13:21:20,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,690 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-12-07 13:21:20,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,698 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-12-07 13:21:20,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,707 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-12-07 13:21:20,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,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-12-07 13:21:20,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,721 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-12-07 13:21:20,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,731 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-12-07 13:21:20,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 13:21:20,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,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-12-07 13:21:20,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,754 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-12-07 13:21:20,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,768 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-12-07 13:21:20,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:21:20,779 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-12-07 13:21:20,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:21:20,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 13:21:20,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,794 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-12-07 13:21:20,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:21:20,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:21:20,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:21:20,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 13:21:20,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,809 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-12-07 13:21:20,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,818 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-12-07 13:21:20,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,829 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-12-07 13:21:20,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,837 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-12-07 13:21:20,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,845 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-12-07 13:21:20,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,852 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-12-07 13:21:20,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:21:20,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:21:20,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:21:20,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:21:20,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:21:20,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:21:20,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 13:21:20,886 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-12-07 13:21:20,886 INFO L444 ModelExtractionUtils]: 9 out of 46 variables were initially zero. Simplification set additionally 34 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:21:20,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 13:21:20,890 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 13:21:20,891 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 13:21:20,891 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-12-07 13:21:20,906 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-12-07 13:21:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:21:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:21:20,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:21:20,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:21:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:21:20,940 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:21:20,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:21:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:21:20,946 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-12-07 13:21:20,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 62 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-12-07 13:21:20,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 62 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 56 states and 65 transitions. Complement of second has 4 states. [2019-12-07 13:21:20,953 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-12-07 13:21:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 13:21:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-12-07 13:21:20,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 2 letters. [2019-12-07 13:21:20,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:21:20,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 37 letters. Loop has 2 letters. [2019-12-07 13:21:20,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:21:20,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 4 letters. [2019-12-07 13:21:20,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:21:20,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 65 transitions. [2019-12-07 13:21:20,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 13:21:20,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 44 states and 48 transitions. [2019-12-07 13:21:20,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-12-07 13:21:20,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-12-07 13:21:20,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2019-12-07 13:21:20,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 13:21:20,955 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-12-07 13:21:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2019-12-07 13:21:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-12-07 13:21:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 13:21:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-12-07 13:21:20,956 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-12-07 13:21:20,956 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-12-07 13:21:20,956 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-12-07 13:21:20,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2019-12-07 13:21:20,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 13:21:20,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:21:20,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:21:20,957 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:21:20,957 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 13:21:20,957 INFO L794 eck$LassoCheckResult]: Stem: 2566#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); 2561#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; 2555#L526 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; 2556#L529 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; 2567#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2568#L788-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); 2569#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2570#L788-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); 2571#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2589#L788-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); 2588#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2587#L788-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); 2586#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2585#L788-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); 2584#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2583#L788-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); 2582#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2581#L788-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); 2580#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2579#L788-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); 2578#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2577#L788-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); 2576#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2575#L788-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); 2574#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2573#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2572#L788-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; 2551#L764-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; 2552#L526-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; 2558#L529-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; 2564#L766 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); 2565#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2553#L764-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; 2554#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2557#L529-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; 2562#L766 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2563#L766-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2560#L771-3 [2019-12-07 13:21:20,957 INFO L796 eck$LassoCheckResult]: Loop: 2560#L771-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); 2559#L771-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2560#L771-3 [2019-12-07 13:21:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:21:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash -694922329, now seen corresponding path program 1 times [2019-12-07 13:21:20,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:21:20,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688947454] [2019-12-07 13:21:20,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:21:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:21:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:21:20,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:21:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:21:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 2 times [2019-12-07 13:21:20,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:21:20,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159094622] [2019-12-07 13:21:20,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:21:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:21:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:21:20,992 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:21:20,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:21:20,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2100425303, now seen corresponding path program 1 times [2019-12-07 13:21:20,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:21:20,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849451609] [2019-12-07 13:21:20,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:21:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:21:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:21:21,021 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:23:25,614 WARN L192 SmtUtils]: Spent 2.08 m on a formula simplification. DAG size of input: 458 DAG size of output: 375 [2019-12-07 13:23:25,679 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:32,648 WARN L192 SmtUtils]: Spent 6.97 s on a formula simplification that was a NOOP. DAG size: 214 [2019-12-07 13:23:32,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:32,688 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:38,961 WARN L192 SmtUtils]: Spent 6.27 s on a formula simplification that was a NOOP. DAG size: 210 [2019-12-07 13:23:38,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:38,981 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:44,408 WARN L192 SmtUtils]: Spent 5.43 s on a formula simplification that was a NOOP. DAG size: 206 [2019-12-07 13:23:44,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:44,425 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:48,803 WARN L192 SmtUtils]: Spent 4.38 s on a formula simplification that was a NOOP. DAG size: 202 [2019-12-07 13:23:48,804 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:48,824 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:52,065 WARN L192 SmtUtils]: Spent 3.24 s on a formula simplification that was a NOOP. DAG size: 198 [2019-12-07 13:23:52,065 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:52,076 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:54,708 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification that was a NOOP. DAG size: 194 [2019-12-07 13:23:54,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:54,722 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:56,932 WARN L192 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 191 [2019-12-07 13:23:56,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:56,952 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:58,765 WARN L192 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 13:23:58,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:58,776 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:59,958 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 183 [2019-12-07 13:23:59,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:59,966 INFO L534 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:24:00,777 WARN L192 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-12-07 13:24:00,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:00,779 INFO L534 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-12-07 13:24:00,779 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:694, output treesize:614 [2019-12-07 13:24:01,678 WARN L192 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-12-07 13:24:01,681 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 13:24:01,682 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 13:24:01,682 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 13:24:01,682 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 13:24:01,682 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 13:24:01,682 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:01,682 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 13:24:01,682 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 13:24:01,682 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration19_Lasso [2019-12-07 13:24:01,682 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 13:24:01,682 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 13:24:01,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:01,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,109 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-12-07 13:24:02,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 13:24:02,529 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-12-07 13:24:02,617 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 13:24:02,617 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:24:02,619 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-12-07 13:24:02,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:24:02,625 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-12-07 13:24:02,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:24:02,632 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-12-07 13:24:02,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:24:02,638 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-12-07 13:24:02,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:24:02,644 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-12-07 13:24:02,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:24:02,652 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-12-07 13:24:02,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/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-12-07 13:24:02,660 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-12-07 13:24:02,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,668 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-12-07 13:24:02,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,676 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-12-07 13:24:02,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,685 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-12-07 13:24:02,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,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-12-07 13:24:02,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,699 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-12-07 13:24:02,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,707 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-12-07 13:24:02,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,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-12-07 13:24:02,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,721 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-12-07 13:24:02,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,729 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-12-07 13:24:02,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 13:24:02,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,738 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-12-07 13:24:02,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,742 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-12-07 13:24:02,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,757 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-12-07 13:24:02,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,765 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-12-07 13:24:02,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,772 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-12-07 13:24:02,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,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_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,781 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-12-07 13:24:02,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 13:24:02,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,797 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-12-07 13:24:02,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 13:24:02,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 13:24:02,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 13:24:02,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,804 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-12-07 13:24:02,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,812 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-12-07 13:24:02,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 13:24:02,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 13:24:02,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 13:24:02,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 13:24:02,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 13:24:02,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 13:24:02,830 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 13:24:02,840 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-12-07 13:24:02,840 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_203db8d8-fd32-4b67-8705-8f82aa6d1ea1/bin/uautomizer/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 13:24:02,843 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 13:24:02,846 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 13:24:02,846 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 13:24:02,846 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-12-07 13:24:02,872 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-12-07 13:24:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:02,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:24:02,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:02,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:24:02,908 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:24:02,914 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-12-07 13:24:02,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-12-07 13:24:02,919 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-12-07 13:24:02,920 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-12-07 13:24:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 13:24:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-12-07 13:24:02,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 37 letters. Loop has 2 letters. [2019-12-07 13:24:02,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:24:02,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 39 letters. Loop has 2 letters. [2019-12-07 13:24:02,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:24:02,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 37 letters. Loop has 4 letters. [2019-12-07 13:24:02,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 13:24:02,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2019-12-07 13:24:02,921 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 13:24:02,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-12-07 13:24:02,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 13:24:02,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 13:24:02,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 13:24:02,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:24:02,921 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:24:02,921 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:24:02,921 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:24:02,921 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-12-07 13:24:02,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:24:02,922 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 13:24:02,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 13:24:02,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 01:24:02 BoogieIcfgContainer [2019-12-07 13:24:02,926 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 13:24:02,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:24:02,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:24:02,926 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:24:02,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:04" (3/4) ... [2019-12-07 13:24:02,929 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:24:02,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:24:02,929 INFO L168 Benchmark]: Toolchain (without parser) took 418952.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.8 MB in the beginning and 824.8 MB in the end (delta: 115.0 MB). Peak memory consumption was 251.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,930 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:24:02,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:24:02,930 INFO L168 Benchmark]: Boogie Preprocessor took 21.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:24:02,930 INFO L168 Benchmark]: RCFGBuilder took 224.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,931 INFO L168 Benchmark]: BuchiAutomizer took 418247.22 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Free memory was 1.0 GB in the beginning and 831.2 MB in the end (delta: 215.1 MB). Peak memory consumption was 242.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,931 INFO L168 Benchmark]: Witness Printer took 2.65 ms. Allocated memory is still 1.2 GB. Free memory was 831.2 MB in the beginning and 824.8 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,932 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 416.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 224.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 418247.22 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Free memory was 1.0 GB in the beginning and 831.2 MB in the end (delta: 215.1 MB). Peak memory consumption was 242.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.65 ms. Allocated memory is still 1.2 GB. Free memory was 831.2 MB in the beginning and 824.8 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. 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 19 terminating modules (15 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[malloc(size)] 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. 15 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 418.2s and 20 iterations. TraceHistogramMax:10. Analysis of lassos took 417.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 94 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 17. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 427 SDtfs, 609 SDslu, 1167 SDs, 0 SdLazy, 555 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU14 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital491 mio100 ax107 hnf100 lsp88 ukn38 mio100 lsp52 div100 bol100 ite100 ukn100 eq184 hnf89 smp93 dnf114 smp96 tf100 neg98 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms 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...