./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e7f10697bf40be831ee927139b8f7b8ae344247 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:22:53,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:22:53,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:22:53,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:22:53,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:22:53,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:22:53,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:22:53,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:22:53,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:22:53,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:22:53,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:22:53,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:22:53,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:22:53,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:22:53,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:22:53,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:22:53,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:22:53,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:22:53,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:22:53,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:22:53,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:22:53,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:22:53,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:22:53,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:22:53,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:22:53,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:22:53,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:22:53,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:22:53,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:22:53,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:22:53,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:22:53,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:22:53,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:22:53,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:22:53,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:22:53,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:22:53,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:22:53,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:22:53,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:22:53,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:22:53,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:22:53,310 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:22:53,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:22:53,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:22:53,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:22:53,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:22:53,326 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:22:53,327 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:22:53,327 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:22:53,327 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:22:53,327 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:22:53,328 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:22:53,328 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:22:53,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:22:53,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:22:53,329 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:22:53,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:22:53,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:22:53,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:22:53,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:22:53,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:22:53,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:22:53,330 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:22:53,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:22:53,331 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:22:53,331 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:22:53,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:22:53,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:22:53,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:22:53,332 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:22:53,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:22:53,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:22:53,333 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:22:53,334 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:22:53,334 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_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e7f10697bf40be831ee927139b8f7b8ae344247 [2019-11-16 00:22:53,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:22:53,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:22:53,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:22:53,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:22:53,373 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:22:53,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2019-11-16 00:22:53,427 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/data/8ef312cc6/eabb3f74d4d24dcab4a4922536889b30/FLAG6a3c1ec1d [2019-11-16 00:22:53,915 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:22:53,916 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2019-11-16 00:22:53,930 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/data/8ef312cc6/eabb3f74d4d24dcab4a4922536889b30/FLAG6a3c1ec1d [2019-11-16 00:22:54,216 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/data/8ef312cc6/eabb3f74d4d24dcab4a4922536889b30 [2019-11-16 00:22:54,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:22:54,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:22:54,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:54,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:22:54,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:22:54,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46bf9ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54, skipping insertion in model container [2019-11-16 00:22:54,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:22:54,274 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:22:54,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:54,701 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:22:54,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:54,861 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:22:54,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54 WrapperNode [2019-11-16 00:22:54,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:54,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:54,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:22:54,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:22:54,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:54,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:22:54,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:22:54,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:22:54,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... [2019-11-16 00:22:54,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:22:54,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:22:54,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:22:54,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:22:54,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:55,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:22:55,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:22:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:22:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:22:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:22:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:22:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:22:55,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:22:55,340 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:22:55,340 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-16 00:22:55,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:55 BoogieIcfgContainer [2019-11-16 00:22:55,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:22:55,342 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:22:55,342 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:22:55,345 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:22:55,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:55,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:22:54" (1/3) ... [2019-11-16 00:22:55,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@262dfaa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:22:55, skipping insertion in model container [2019-11-16 00:22:55,347 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:55,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:54" (2/3) ... [2019-11-16 00:22:55,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@262dfaa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:22:55, skipping insertion in model container [2019-11-16 00:22:55,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:55,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:55" (3/3) ... [2019-11-16 00:22:55,350 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2019-11-16 00:22:55,404 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:22:55,404 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:22:55,404 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:22:55,404 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:22:55,404 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:22:55,404 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:22:55,405 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:22:55,405 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:22:55,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-16 00:22:55,435 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-16 00:22:55,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:55,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:55,440 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:55,440 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:22:55,440 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:22:55,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-16 00:22:55,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-16 00:22:55,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:55,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:55,443 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:55,443 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:22:55,447 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 11#L-1true havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 26#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 18#L530true entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 12#L788true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 19#L789-3true [2019-11-16 00:22:55,448 INFO L793 eck$LassoCheckResult]: Loop: 19#L789-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 16#L789-2true entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 19#L789-3true [2019-11-16 00:22:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-11-16 00:22:55,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:55,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404872260] [2019-11-16 00:22:55,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:55,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404872260] [2019-11-16 00:22:55,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:55,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:55,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772658987] [2019-11-16 00:22:55,636 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2019-11-16 00:22:55,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:55,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645459413] [2019-11-16 00:22:55,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:55,676 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:55,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:55,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:55,769 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-11-16 00:22:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:55,842 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-11-16 00:22:55,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:22:55,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2019-11-16 00:22:55,847 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2019-11-16 00:22:55,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 41 transitions. [2019-11-16 00:22:55,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-16 00:22:55,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-16 00:22:55,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-11-16 00:22:55,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:55,857 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-16 00:22:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-11-16 00:22:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-11-16 00:22:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:22:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-16 00:22:55,881 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-16 00:22:55,881 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-16 00:22:55,881 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:22:55,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-11-16 00:22:55,882 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-16 00:22:55,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:55,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:55,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:55,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:22:55,883 INFO L791 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 93#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 94#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 99#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 95#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 96#L789-3 [2019-11-16 00:22:55,883 INFO L793 eck$LassoCheckResult]: Loop: 96#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 98#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 96#L789-3 [2019-11-16 00:22:55,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2019-11-16 00:22:55,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:55,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106771690] [2019-11-16 00:22:55,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:55,914 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:55,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:55,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2019-11-16 00:22:55,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:55,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947541153] [2019-11-16 00:22:55,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:55,934 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:55,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2019-11-16 00:22:55,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:55,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364489421] [2019-11-16 00:22:55,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:55,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:56,018 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:56,331 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-11-16 00:22:56,448 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:56,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:56,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:56,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:56,456 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:56,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:56,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:56,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:56,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2019-11-16 00:22:56,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:56,457 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:56,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,783 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-16 00:22:56,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:56,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:57,531 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-16 00:22:57,576 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:57,581 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:57,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:57,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,586 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:57,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:57,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:57,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:57,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,594 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:57,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,595 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:57,595 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:57,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,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-11-16 00:22:57,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,599 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,602 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:57,602 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:57,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:57,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,615 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:57,615 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:57,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:57,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,635 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:57,636 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:57,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,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-11-16 00:22:57,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,653 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:57,654 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:57,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:57,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,659 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:57,659 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:57,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:57,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,670 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:57,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:57,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:57,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:57,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,693 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:57,693 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:57,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:57,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:57,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:57,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:57,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:57,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:57,700 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:57,700 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:57,786 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:57,840 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:22:57,841 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:22:57,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:57,852 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:22:57,852 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:57,853 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~2) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2019-11-16 00:22:57,884 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-16 00:22:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:57,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:57,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:57,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:57,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:57,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:22:57,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:22:58,043 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 37 states and 50 transitions. Complement of second has 6 states. [2019-11-16 00:22:58,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:22:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:22:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-11-16 00:22:58,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:22:58,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:58,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:22:58,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:58,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:22:58,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:58,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-16 00:22:58,054 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:58,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 22 states and 28 transitions. [2019-11-16 00:22:58,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-16 00:22:58,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:22:58,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-11-16 00:22:58,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:58,056 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-16 00:22:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-11-16 00:22:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-16 00:22:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:22:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-16 00:22:58,059 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-16 00:22:58,059 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-16 00:22:58,059 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:22:58,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-16 00:22:58,060 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:58,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:58,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:58,061 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:58,061 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:58,061 INFO L791 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 223#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; 224#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 230#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 225#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 226#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 231#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 232#L765-3 [2019-11-16 00:22:58,061 INFO L793 eck$LassoCheckResult]: Loop: 232#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 213#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 214#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 220#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 222#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 232#L765-3 [2019-11-16 00:22:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2019-11-16 00:22:58,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:58,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976615986] [2019-11-16 00:22:58,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:58,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976615986] [2019-11-16 00:22:58,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:58,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:22:58,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612992942] [2019-11-16 00:22:58,122 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:58,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:58,122 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2019-11-16 00:22:58,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:58,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496819934] [2019-11-16 00:22:58,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:58,145 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:58,363 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:22:58,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:58,447 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-16 00:22:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:58,471 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-16 00:22:58,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:58,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2019-11-16 00:22:58,472 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:58,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2019-11-16 00:22:58,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:22:58,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:22:58,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-11-16 00:22:58,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:58,474 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-16 00:22:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-11-16 00:22:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-16 00:22:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:22:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-16 00:22:58,476 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-16 00:22:58,476 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-16 00:22:58,476 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:22:58,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-16 00:22:58,477 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:58,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:58,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:58,478 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:58,478 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:58,478 INFO L791 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 275#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; 276#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 282#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 277#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 278#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 280#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 281#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 283#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 284#L765-3 [2019-11-16 00:22:58,478 INFO L793 eck$LassoCheckResult]: Loop: 284#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 265#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 266#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 272#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 274#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 284#L765-3 [2019-11-16 00:22:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2019-11-16 00:22:58,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:58,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155112520] [2019-11-16 00:22:58,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:58,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155112520] [2019-11-16 00:22:58,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684559262] [2019-11-16 00:22:58,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:22:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:58,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:58,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:58,630 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:22:58,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-16 00:22:58,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910314560] [2019-11-16 00:22:58,631 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2019-11-16 00:22:58,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:58,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526293725] [2019-11-16 00:22:58,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:58,656 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:58,823 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:22:58,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:58,905 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-16 00:22:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:58,943 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-11-16 00:22:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:22:58,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2019-11-16 00:22:58,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:58,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2019-11-16 00:22:58,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:22:58,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:22:58,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2019-11-16 00:22:58,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:58,946 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-16 00:22:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2019-11-16 00:22:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-16 00:22:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:22:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-11-16 00:22:58,949 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-16 00:22:58,949 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-16 00:22:58,949 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:22:58,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2019-11-16 00:22:58,950 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:58,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:58,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:58,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:58,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:58,951 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 356#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; 357#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 363#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 358#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 359#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 360#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 361#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 364#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 367#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 365#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 366#L765-3 [2019-11-16 00:22:58,951 INFO L793 eck$LassoCheckResult]: Loop: 366#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 346#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 347#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 353#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 355#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 366#L765-3 [2019-11-16 00:22:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash 447769425, now seen corresponding path program 2 times [2019-11-16 00:22:58,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:58,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347598266] [2019-11-16 00:22:58,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:58,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:59,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347598266] [2019-11-16 00:22:59,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945050625] [2019-11-16 00:22:59,004 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:22:59,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:22:59,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:22:59,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:22:59,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:59,126 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:22:59,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-16 00:22:59,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222929266] [2019-11-16 00:22:59,126 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2019-11-16 00:22:59,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:59,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684189483] [2019-11-16 00:22:59,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:59,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:59,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:59,138 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:59,311 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:22:59,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:59,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:22:59,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:22:59,380 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand 9 states. [2019-11-16 00:22:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:59,432 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-11-16 00:22:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:22:59,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-11-16 00:22:59,435 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:59,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-11-16 00:22:59,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:22:59,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:22:59,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-11-16 00:22:59,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:59,436 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-16 00:22:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-11-16 00:22:59,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-16 00:22:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:22:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-11-16 00:22:59,438 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-16 00:22:59,438 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-16 00:22:59,439 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:22:59,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2019-11-16 00:22:59,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:59,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:59,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:59,440 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:59,440 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:59,440 INFO L791 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 449#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; 450#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 456#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 451#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 452#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 457#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 462#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 454#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 455#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 458#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 461#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 459#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 460#L765-3 [2019-11-16 00:22:59,440 INFO L793 eck$LassoCheckResult]: Loop: 460#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 439#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 440#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 446#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 448#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 460#L765-3 [2019-11-16 00:22:59,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:59,441 INFO L82 PathProgramCache]: Analyzing trace with hash 809744147, now seen corresponding path program 3 times [2019-11-16 00:22:59,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:59,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331867395] [2019-11-16 00:22:59,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:59,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:59,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:59,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331867395] [2019-11-16 00:22:59,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242079707] [2019-11-16 00:22:59,512 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:22:59,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:22:59,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:22:59,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:22:59,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:59,656 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:22:59,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-16 00:22:59,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156306100] [2019-11-16 00:22:59,656 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2019-11-16 00:22:59,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:59,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988768606] [2019-11-16 00:22:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:59,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:59,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:59,821 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:22:59,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:59,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:22:59,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:22:59,894 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 9 Second operand 11 states. [2019-11-16 00:22:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:59,942 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-11-16 00:22:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:59,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-11-16 00:22:59,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:59,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2019-11-16 00:22:59,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:22:59,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:22:59,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2019-11-16 00:22:59,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:59,946 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-16 00:22:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2019-11-16 00:22:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-16 00:22:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:22:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-16 00:22:59,948 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-16 00:22:59,948 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-16 00:22:59,948 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:22:59,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-11-16 00:22:59,949 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:59,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:59,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:59,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:59,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:59,950 INFO L791 eck$LassoCheckResult]: Stem: 558#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 554#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; 555#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 561#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 556#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 557#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 562#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 563#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 559#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 560#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 569#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 568#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 567#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 566#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 564#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 565#L765-3 [2019-11-16 00:22:59,950 INFO L793 eck$LassoCheckResult]: Loop: 565#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 544#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 545#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 551#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 553#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 565#L765-3 [2019-11-16 00:22:59,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 4 times [2019-11-16 00:22:59,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:59,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815448878] [2019-11-16 00:22:59,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:59,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:59,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:00,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815448878] [2019-11-16 00:23:00,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568233962] [2019-11-16 00:23:00,034 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:00,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:23:00,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:23:00,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:23:00,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:00,168 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:00,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-16 00:23:00,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066795519] [2019-11-16 00:23:00,168 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 5 times [2019-11-16 00:23:00,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:00,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417563729] [2019-11-16 00:23:00,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:00,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:00,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:00,178 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:00,324 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:23:00,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:00,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:23:00,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:23:00,377 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-16 00:23:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:00,420 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-11-16 00:23:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:00,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-11-16 00:23:00,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:00,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2019-11-16 00:23:00,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:23:00,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:23:00,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2019-11-16 00:23:00,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:00,423 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-16 00:23:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2019-11-16 00:23:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-16 00:23:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-16 00:23:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-16 00:23:00,425 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-16 00:23:00,425 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-16 00:23:00,425 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:23:00,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2019-11-16 00:23:00,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:00,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:00,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:00,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:00,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:23:00,427 INFO L791 eck$LassoCheckResult]: Stem: 677#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 671#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; 672#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 680#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 673#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 674#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 678#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 679#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 675#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 676#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 688#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 687#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 686#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 685#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 684#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 683#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 681#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 682#L765-3 [2019-11-16 00:23:00,427 INFO L793 eck$LassoCheckResult]: Loop: 682#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 661#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 662#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 668#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 670#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 682#L765-3 [2019-11-16 00:23:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:00,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1842787607, now seen corresponding path program 5 times [2019-11-16 00:23:00,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:00,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980481642] [2019-11-16 00:23:00,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:00,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:00,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:00,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980481642] [2019-11-16 00:23:00,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725242483] [2019-11-16 00:23:00,499 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:00,585 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-16 00:23:00,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:23:00,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:23:00,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:00,667 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:00,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-16 00:23:00,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39586080] [2019-11-16 00:23:00,668 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 6 times [2019-11-16 00:23:00,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:00,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152033675] [2019-11-16 00:23:00,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:00,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:00,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:00,677 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:00,809 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:23:00,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:23:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:23:00,861 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 9 Second operand 15 states. [2019-11-16 00:23:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:00,917 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-11-16 00:23:00,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:23:00,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2019-11-16 00:23:00,931 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:00,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2019-11-16 00:23:00,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:23:00,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:23:00,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2019-11-16 00:23:00,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:00,933 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-16 00:23:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2019-11-16 00:23:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-16 00:23:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:23:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-16 00:23:00,935 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-16 00:23:00,935 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-16 00:23:00,935 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:23:00,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2019-11-16 00:23:00,936 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:00,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:00,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:00,937 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:00,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:23:00,937 INFO L791 eck$LassoCheckResult]: Stem: 806#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 800#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; 801#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 809#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 802#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 803#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 807#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 808#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 804#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 805#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 819#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 818#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 817#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 816#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 815#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 814#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 813#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 812#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 810#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 811#L765-3 [2019-11-16 00:23:00,937 INFO L793 eck$LassoCheckResult]: Loop: 811#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 790#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 791#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 797#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 799#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 811#L765-3 [2019-11-16 00:23:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1392420697, now seen corresponding path program 6 times [2019-11-16 00:23:00,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:00,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412038730] [2019-11-16 00:23:00,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:00,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:00,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:01,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412038730] [2019-11-16 00:23:01,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595764242] [2019-11-16 00:23:01,042 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:01,175 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-16 00:23:01,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:23:01,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:23:01,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:01,307 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:01,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-16 00:23:01,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137997776] [2019-11-16 00:23:01,308 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:01,308 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 7 times [2019-11-16 00:23:01,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:01,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801060957] [2019-11-16 00:23:01,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:01,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:01,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:01,318 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:01,467 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:23:01,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:23:01,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:23:01,524 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 9 Second operand 17 states. [2019-11-16 00:23:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:01,588 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-16 00:23:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:23:01,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2019-11-16 00:23:01,596 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:01,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 40 transitions. [2019-11-16 00:23:01,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:23:01,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:23:01,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-11-16 00:23:01,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:01,598 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-16 00:23:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-11-16 00:23:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-16 00:23:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:23:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-11-16 00:23:01,600 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-16 00:23:01,601 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-16 00:23:01,601 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:23:01,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2019-11-16 00:23:01,601 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:01,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:01,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:01,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:01,602 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:23:01,603 INFO L791 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 943#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; 944#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 948#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 941#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 942#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 949#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 950#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 945#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 946#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 962#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 961#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 960#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 959#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 958#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 957#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 956#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 955#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 954#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 953#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 951#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 952#L765-3 [2019-11-16 00:23:01,603 INFO L793 eck$LassoCheckResult]: Loop: 952#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 931#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 932#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 938#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 940#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 952#L765-3 [2019-11-16 00:23:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1913450213, now seen corresponding path program 7 times [2019-11-16 00:23:01,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:01,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586677650] [2019-11-16 00:23:01,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:01,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:01,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:01,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586677650] [2019-11-16 00:23:01,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761877463] [2019-11-16 00:23:01,697 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:01,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:23:01,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:01,903 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:01,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-16 00:23:01,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487431164] [2019-11-16 00:23:01,904 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:01,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:01,904 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 8 times [2019-11-16 00:23:01,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:01,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435717288] [2019-11-16 00:23:01,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:01,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:01,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:01,913 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:02,043 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:23:02,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:02,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:23:02,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:23:02,114 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 9 Second operand 19 states. [2019-11-16 00:23:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:02,200 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-11-16 00:23:02,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:23:02,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2019-11-16 00:23:02,201 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:02,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2019-11-16 00:23:02,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:23:02,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:23:02,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2019-11-16 00:23:02,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:02,202 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-16 00:23:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2019-11-16 00:23:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-16 00:23:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:23:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-16 00:23:02,205 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-16 00:23:02,205 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-16 00:23:02,205 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:23:02,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2019-11-16 00:23:02,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:02,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:02,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:02,206 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:02,206 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:23:02,207 INFO L791 eck$LassoCheckResult]: Stem: 1098#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1094#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; 1095#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1101#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1096#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1097#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1102#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1103#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1099#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1100#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1117#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1116#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1115#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1114#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1113#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1112#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1111#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1110#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1109#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1108#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1107#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1106#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1104#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1105#L765-3 [2019-11-16 00:23:02,207 INFO L793 eck$LassoCheckResult]: Loop: 1105#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1084#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1085#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1091#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1093#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1105#L765-3 [2019-11-16 00:23:02,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:02,207 INFO L82 PathProgramCache]: Analyzing trace with hash -579595683, now seen corresponding path program 8 times [2019-11-16 00:23:02,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:02,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440540383] [2019-11-16 00:23:02,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:02,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:02,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:02,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440540383] [2019-11-16 00:23:02,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795412761] [2019-11-16 00:23:02,309 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:02,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:23:02,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:23:02,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:23:02,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:02,500 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:02,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-11-16 00:23:02,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492862515] [2019-11-16 00:23:02,500 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 9 times [2019-11-16 00:23:02,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:02,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746766342] [2019-11-16 00:23:02,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:02,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:02,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:02,509 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:02,663 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:23:02,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:02,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:23:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:23:02,734 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 9 Second operand 21 states. [2019-11-16 00:23:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:02,792 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-11-16 00:23:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:23:02,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2019-11-16 00:23:02,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:02,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2019-11-16 00:23:02,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:23:02,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:23:02,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2019-11-16 00:23:02,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:02,796 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-16 00:23:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2019-11-16 00:23:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-11-16 00:23:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-16 00:23:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-11-16 00:23:02,799 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-16 00:23:02,799 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-16 00:23:02,799 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:23:02,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2019-11-16 00:23:02,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:02,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:02,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:02,800 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:02,800 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:23:02,800 INFO L791 eck$LassoCheckResult]: Stem: 1265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1259#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; 1260#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1268#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1261#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1262#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1266#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1267#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1263#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1264#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1284#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1283#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1282#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1281#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1280#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1279#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1278#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1277#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1276#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1275#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1274#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1273#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1272#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1271#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1269#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1270#L765-3 [2019-11-16 00:23:02,800 INFO L793 eck$LassoCheckResult]: Loop: 1270#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1249#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1250#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1256#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1258#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1270#L765-3 [2019-11-16 00:23:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1354353439, now seen corresponding path program 9 times [2019-11-16 00:23:02,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:02,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378459831] [2019-11-16 00:23:02,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:02,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:02,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:02,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378459831] [2019-11-16 00:23:02,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279436663] [2019-11-16 00:23:02,924 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8a35513-007e-4ca3-9e67-7d9d84e51f4d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:03,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-16 00:23:03,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:23:03,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:23:03,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:04,114 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:04,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-11-16 00:23:04,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348755478] [2019-11-16 00:23:04,115 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 10 times [2019-11-16 00:23:04,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:04,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945210870] [2019-11-16 00:23:04,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:04,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:04,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:04,122 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:04,246 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:23:04,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:04,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:23:04,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:23:04,298 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 23 states. [2019-11-16 00:23:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:04,384 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-16 00:23:04,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:23:04,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2019-11-16 00:23:04,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:04,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2019-11-16 00:23:04,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:23:04,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:23:04,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2019-11-16 00:23:04,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:04,386 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-16 00:23:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2019-11-16 00:23:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-16 00:23:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:23:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-16 00:23:04,388 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-16 00:23:04,388 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-16 00:23:04,388 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:23:04,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2019-11-16 00:23:04,389 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:23:04,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:04,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:04,390 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:04,390 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:23:04,390 INFO L791 eck$LassoCheckResult]: Stem: 1444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1438#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; 1439#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1447#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1440#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1441#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1445#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1446#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1442#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1443#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1465#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1464#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1463#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1462#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1461#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1460#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1459#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1458#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1457#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1456#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1455#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1454#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1453#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1452#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1451#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1450#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1448#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1449#L765-3 [2019-11-16 00:23:04,390 INFO L793 eck$LassoCheckResult]: Loop: 1449#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1428#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1429#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1435#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1437#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1449#L765-3 [2019-11-16 00:23:04,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:04,390 INFO L82 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 10 times [2019-11-16 00:23:04,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:04,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552269603] [2019-11-16 00:23:04,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:04,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:04,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:04,422 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:04,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 11 times [2019-11-16 00:23:04,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:04,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464919641] [2019-11-16 00:23:04,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:04,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:04,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:04,431 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2019-11-16 00:23:04,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:04,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123839172] [2019-11-16 00:23:04,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:04,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:04,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:04,528 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:04,672 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-16 00:24:44,407 WARN L191 SmtUtils]: Spent 1.66 m on a formula simplification. DAG size of input: 371 DAG size of output: 305 [2019-11-16 00:24:44,611 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:53,540 WARN L191 SmtUtils]: Spent 8.93 s on a formula simplification that was a NOOP. DAG size: 192 [2019-11-16 00:24:53,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:53,605 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:01,476 WARN L191 SmtUtils]: Spent 7.87 s on a formula simplification that was a NOOP. DAG size: 188 [2019-11-16 00:25:01,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,508 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:08,365 WARN L191 SmtUtils]: Spent 6.86 s on a formula simplification that was a NOOP. DAG size: 184 [2019-11-16 00:25:08,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:08,441 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:14,611 WARN L191 SmtUtils]: Spent 6.17 s on a formula simplification that was a NOOP. DAG size: 180 [2019-11-16 00:25:14,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,657 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:20,079 WARN L191 SmtUtils]: Spent 5.42 s on a formula simplification that was a NOOP. DAG size: 176 [2019-11-16 00:25:20,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:20,104 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:24,422 WARN L191 SmtUtils]: Spent 4.32 s on a formula simplification that was a NOOP. DAG size: 172 [2019-11-16 00:25:24,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,441 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:26,798 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 168 [2019-11-16 00:25:26,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:26,814 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:27,712 WARN L191 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-11-16 00:25:27,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:27,727 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:28,563 WARN L191 SmtUtils]: Spent 834.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-16 00:25:28,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:28,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:28,564 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:562, output treesize:414 [2019-11-16 00:25:29,413 WARN L191 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-16 00:25:29,416 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:25:29,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:25:29,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:25:29,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:25:29,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:25:29,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:25:29,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:25:29,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:25:29,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration13_Lasso [2019-11-16 00:25:29,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:25:29,417 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:25:29,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:29,934 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-16 00:25:30,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:30,242 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-16 00:25:30,500 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-16 00:25:30,682 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:25:30,683 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:25:30,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:30,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,685 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:30,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:30,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:30,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,687 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:30,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:30,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:30,690 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:30,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,693 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:30,694 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:30,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,695 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:30,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,696 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:30,696 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:30,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,698 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:30,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:30,699 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:30,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,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-11-16 00:25:30,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,700 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:30,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:30,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:30,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,703 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,703 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,704 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:30,704 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:30,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,706 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-16 00:25:30,706 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:25:30,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,715 INFO L400 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-11-16 00:25:30,715 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:25:30,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:30,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:30,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:30,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:30,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:30,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:30,763 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:30,763 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:30,793 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:25:30,840 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-16 00:25:30,841 INFO L444 ModelExtractionUtils]: 47 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:25:30,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:25:30,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:25:30,842 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:25:30,842 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2019-11-16 00:25:30,869 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-16 00:25:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:30,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:25:30,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:30,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:25:30,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:30,954 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:25:30,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:25:30,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 59 states and 71 transitions. Complement of second has 6 states. [2019-11-16 00:25:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:25:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:25:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-11-16 00:25:30,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 5 letters. [2019-11-16 00:25:30,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:30,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 5 letters. [2019-11-16 00:25:30,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:30,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 10 letters. [2019-11-16 00:25:30,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:30,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2019-11-16 00:25:30,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-16 00:25:30,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 55 transitions. [2019-11-16 00:25:30,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:25:30,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-16 00:25:30,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2019-11-16 00:25:30,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:25:30,997 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-11-16 00:25:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2019-11-16 00:25:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-11-16 00:25:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-16 00:25:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-16 00:25:30,999 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-16 00:25:30,999 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-16 00:25:30,999 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-16 00:25:31,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2019-11-16 00:25:31,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:25:31,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:31,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:31,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:31,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:25:31,001 INFO L791 eck$LassoCheckResult]: Stem: 1691#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1687#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; 1688#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1694#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1689#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1690#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1692#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1693#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1695#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1715#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1714#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1713#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1712#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1711#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1710#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1709#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1708#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1707#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1706#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1705#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1704#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1703#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1702#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1701#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1700#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1699#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1696#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1697#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1672#L765-4 alloc_17_#res := 0; 1673#L776 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1682#L780-3 [2019-11-16 00:25:31,002 INFO L793 eck$LassoCheckResult]: Loop: 1682#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1681#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1682#L780-3 [2019-11-16 00:25:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2019-11-16 00:25:31,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767406664] [2019-11-16 00:25:31,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-16 00:25:31,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767406664] [2019-11-16 00:25:31,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:31,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:31,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065782790] [2019-11-16 00:25:31,097 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:25:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2019-11-16 00:25:31,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484673180] [2019-11-16 00:25:31,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,102 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:31,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:31,139 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-16 00:25:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:31,184 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-11-16 00:25:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:31,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2019-11-16 00:25:31,185 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:25:31,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2019-11-16 00:25:31,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-16 00:25:31,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-16 00:25:31,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2019-11-16 00:25:31,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:25:31,187 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-11-16 00:25:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2019-11-16 00:25:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2019-11-16 00:25:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-16 00:25:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-16 00:25:31,190 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-16 00:25:31,190 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-16 00:25:31,190 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-16 00:25:31,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2019-11-16 00:25:31,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:25:31,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:31,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:31,191 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:31,191 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:25:31,192 INFO L791 eck$LassoCheckResult]: Stem: 1800#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1796#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; 1797#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1803#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1798#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1799#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1801#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1802#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1804#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1824#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1823#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1822#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1821#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1820#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1819#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1818#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1817#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1816#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1815#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1814#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1813#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1812#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1811#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1810#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1809#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1808#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1805#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1806#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1783#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1784#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1792#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1793#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1788#L772-3 [2019-11-16 00:25:31,192 INFO L793 eck$LassoCheckResult]: Loop: 1788#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1787#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1788#L772-3 [2019-11-16 00:25:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2019-11-16 00:25:31,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772590651] [2019-11-16 00:25:31,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,236 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2019-11-16 00:25:31,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221399177] [2019-11-16 00:25:31,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,246 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2019-11-16 00:25:31,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983710207] [2019-11-16 00:25:31,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-16 00:25:31,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983710207] [2019-11-16 00:25:31,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:31,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:31,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323211403] [2019-11-16 00:25:31,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:31,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:31,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:31,427 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-16 00:25:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:31,458 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-16 00:25:31,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:31,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 69 transitions. [2019-11-16 00:25:31,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:25:31,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 69 transitions. [2019-11-16 00:25:31,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-16 00:25:31,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-16 00:25:31,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2019-11-16 00:25:31,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:25:31,461 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-11-16 00:25:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2019-11-16 00:25:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2019-11-16 00:25:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-16 00:25:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-16 00:25:31,463 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-16 00:25:31,464 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-16 00:25:31,464 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-16 00:25:31,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2019-11-16 00:25:31,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:25:31,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:31,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:31,465 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:31,465 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:25:31,465 INFO L791 eck$LassoCheckResult]: Stem: 1916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1912#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; 1913#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1919#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1914#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1915#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1917#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1918#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1920#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1944#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1943#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1942#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1941#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1940#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1939#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1938#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1937#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1936#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1935#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1934#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1933#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1932#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1931#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1930#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1929#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1928#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1921#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1922#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1925#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1923#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1908#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1909#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1904#L772-3 assume !(alloc_17_~j~0 >= 0); 1905#L772-4 alloc_17_#res := 3; 1897#L776 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1907#L780-3 [2019-11-16 00:25:31,466 INFO L793 eck$LassoCheckResult]: Loop: 1907#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1906#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1907#L780-3 [2019-11-16 00:25:31,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2019-11-16 00:25:31,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857739780] [2019-11-16 00:25:31,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,510 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,511 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2019-11-16 00:25:31,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946190439] [2019-11-16 00:25:31,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2019-11-16 00:25:31,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580362273] [2019-11-16 00:25:31,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,560 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:23,381 WARN L191 SmtUtils]: Spent 1.86 m on a formula simplification. DAG size of input: 411 DAG size of output: 341 [2019-11-16 00:27:23,490 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:35,619 WARN L191 SmtUtils]: Spent 12.13 s on a formula simplification that was a NOOP. DAG size: 215 [2019-11-16 00:27:35,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:35,645 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:46,056 WARN L191 SmtUtils]: Spent 10.41 s on a formula simplification that was a NOOP. DAG size: 211 [2019-11-16 00:27:46,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:46,109 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:55,240 WARN L191 SmtUtils]: Spent 9.13 s on a formula simplification that was a NOOP. DAG size: 207 [2019-11-16 00:27:55,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:55,297 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:28:02,763 WARN L191 SmtUtils]: Spent 7.47 s on a formula simplification that was a NOOP. DAG size: 203 [2019-11-16 00:28:02,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:02,802 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:28:07,407 WARN L191 SmtUtils]: Spent 4.60 s on a formula simplification that was a NOOP. DAG size: 199 [2019-11-16 00:28:07,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:07,432 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:28:09,749 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification that was a NOOP. DAG size: 195 [2019-11-16 00:28:09,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:09,770 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:28:11,859 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 191 [2019-11-16 00:28:11,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:11,905 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:28:13,529 WARN L191 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 187 [2019-11-16 00:28:13,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:13,547 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:28:14,737 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 183 [2019-11-16 00:28:14,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:14,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-16 00:28:14,739 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:611, output treesize:458 [2019-11-16 00:28:15,814 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 183 [2019-11-16 00:28:15,817 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:28:15,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:28:15,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:28:15,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:28:15,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:28:15,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:28:15,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:28:15,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:28:15,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration16_Lasso [2019-11-16 00:28:15,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:28:15,818 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:28:15,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:15,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,295 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-16 00:28:16,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:28:16,588 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-16 00:28:16,966 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-16 00:28:17,019 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:28:17,019 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:28:17,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,022 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,022 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,024 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,024 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,024 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,025 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,025 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,028 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,028 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,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-11-16 00:28:17,030 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,031 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,032 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,035 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,035 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,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-11-16 00:28:17,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,039 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,040 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,044 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,044 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,048 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,049 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,062 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,062 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,074 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,077 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,077 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,082 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,082 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,090 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,094 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,094 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,097 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,098 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,098 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,100 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:17,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,101 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:17,101 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:17,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:17,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:28:17,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:17,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:17,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:17,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:17,106 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:17,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:17,124 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:28:17,136 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:28:17,136 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:28:17,137 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:28:17,138 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:28:17,138 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:28:17,139 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2019-11-16 00:28:17,166 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-16 00:28:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:17,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:28:17,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:17,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:28:17,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:17,248 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:28:17,248 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-16 00:28:17,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 57 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 51 states and 60 transitions. Complement of second has 4 states. [2019-11-16 00:28:17,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:28:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:28:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-16 00:28:17,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 2 letters. [2019-11-16 00:28:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 37 letters. Loop has 2 letters. [2019-11-16 00:28:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 4 letters. [2019-11-16 00:28:17,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:17,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2019-11-16 00:28:17,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:28:17,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 43 transitions. [2019-11-16 00:28:17,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-16 00:28:17,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:28:17,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2019-11-16 00:28:17,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:28:17,262 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-16 00:28:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2019-11-16 00:28:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-16 00:28:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-16 00:28:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-16 00:28:17,264 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-16 00:28:17,264 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-16 00:28:17,264 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-16 00:28:17,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2019-11-16 00:28:17,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:28:17,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:28:17,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:28:17,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:17,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:28:17,266 INFO L791 eck$LassoCheckResult]: Stem: 2171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 2165#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; 2166#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 2174#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2167#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2168#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2172#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2173#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2169#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2170#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2193#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2192#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2191#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2190#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2189#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2188#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2187#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2186#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2185#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2184#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2183#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2182#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2181#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2180#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2179#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2178#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2175#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 2176#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2157#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2158#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2163#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 2164#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2177#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2155#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2156#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2161#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2162#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2160#L772-3 [2019-11-16 00:28:17,266 INFO L793 eck$LassoCheckResult]: Loop: 2160#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 2159#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2160#L772-3 [2019-11-16 00:28:17,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash -14863959, now seen corresponding path program 1 times [2019-11-16 00:28:17,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:17,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455178961] [2019-11-16 00:28:17,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-16 00:28:17,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455178961] [2019-11-16 00:28:17,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:17,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:28:17,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210906023] [2019-11-16 00:28:17,341 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:28:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 2 times [2019-11-16 00:28:17,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:17,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022230242] [2019-11-16 00:28:17,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:17,348 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:17,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:17,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:17,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:17,481 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-16 00:28:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:17,510 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-16 00:28:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:28:17,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 49 transitions. [2019-11-16 00:28:17,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:28:17,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 47 transitions. [2019-11-16 00:28:17,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-16 00:28:17,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-16 00:28:17,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 47 transitions. [2019-11-16 00:28:17,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:28:17,513 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-16 00:28:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 47 transitions. [2019-11-16 00:28:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-11-16 00:28:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-16 00:28:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-16 00:28:17,515 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-16 00:28:17,515 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-16 00:28:17,515 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-16 00:28:17,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2019-11-16 00:28:17,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:28:17,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:28:17,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:28:17,516 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:17,517 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:28:17,517 INFO L791 eck$LassoCheckResult]: Stem: 2263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 2259#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; 2260#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 2266#L530 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2261#L788 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2262#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2264#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2265#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2267#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2287#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2286#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2285#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2284#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2283#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2282#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2281#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2280#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2279#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2278#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2277#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2276#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2275#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2274#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2273#L789-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2272#L789-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2271#L789-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2268#L789-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 2269#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2251#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 2252#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2257#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 2258#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2270#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2249#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2250#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2255#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2256#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2254#L772-3 [2019-11-16 00:28:17,517 INFO L793 eck$LassoCheckResult]: Loop: 2254#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 2253#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2254#L772-3 [2019-11-16 00:28:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -694922329, now seen corresponding path program 1 times [2019-11-16 00:28:17,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:17,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712605774] [2019-11-16 00:28:17,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:17,561 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 3 times [2019-11-16 00:28:17,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:17,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367501460] [2019-11-16 00:28:17,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:17,567 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2100425303, now seen corresponding path program 1 times [2019-11-16 00:28:17,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:17,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31036738] [2019-11-16 00:28:17,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:17,613 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:11,671 WARN L191 SmtUtils]: Spent 2.90 m on a formula simplification. DAG size of input: 457 DAG size of output: 376 [2019-11-16 00:31:11,801 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:21,400 WARN L191 SmtUtils]: Spent 9.60 s on a formula simplification that was a NOOP. DAG size: 219 [2019-11-16 00:31:21,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:21,451 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:29,376 WARN L191 SmtUtils]: Spent 7.92 s on a formula simplification that was a NOOP. DAG size: 215 [2019-11-16 00:31:29,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:29,411 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:35,286 WARN L191 SmtUtils]: Spent 5.87 s on a formula simplification that was a NOOP. DAG size: 211 [2019-11-16 00:31:35,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:35,312 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:40,598 WARN L191 SmtUtils]: Spent 5.29 s on a formula simplification that was a NOOP. DAG size: 207 [2019-11-16 00:31:40,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:40,639 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:45,120 WARN L191 SmtUtils]: Spent 4.48 s on a formula simplification that was a NOOP. DAG size: 203 [2019-11-16 00:31:45,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:45,156 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:49,495 WARN L191 SmtUtils]: Spent 4.34 s on a formula simplification that was a NOOP. DAG size: 199 [2019-11-16 00:31:49,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:49,517 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:51,985 WARN L191 SmtUtils]: Spent 2.47 s on a formula simplification that was a NOOP. DAG size: 195 [2019-11-16 00:31:51,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:52,008 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:53,512 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 191 [2019-11-16 00:31:53,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:53,529 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:55,005 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 188 [2019-11-16 00:31:55,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:55,016 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:56,044 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 184 [2019-11-16 00:31:56,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:56,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 10 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-16 00:31:56,046 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:719, output treesize:639 [2019-11-16 00:31:57,005 WARN L191 SmtUtils]: Spent 958.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-11-16 00:31:57,008 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:31:57,008 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:31:57,008 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:31:57,008 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:31:57,009 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:31:57,009 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:31:57,009 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:31:57,009 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:31:57,009 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration18_Lasso [2019-11-16 00:31:57,009 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:31:57,009 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:31:57,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,447 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-11-16 00:31:57,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:57,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:58,239 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-16 00:31:58,297 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:31:58,297 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:31:58,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,298 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,298 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:58,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,299 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:58,299 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:58,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,300 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:58,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,300 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:58,300 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:58,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,301 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:58,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,301 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:58,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:58,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:58,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:58,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:58,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,304 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,305 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:58,305 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:58,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,307 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:58,307 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:58,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,308 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,309 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:58,309 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:58,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,311 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:58,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,312 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:58,312 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:58,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,313 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,313 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:58,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,314 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:58,314 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:58,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,317 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:58,317 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:58,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:58,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:31:58,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:58,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:58,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:58,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:58,321 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:58,321 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:58,339 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:31:58,369 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:31:58,369 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-16 00:31:58,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:31:58,370 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:31:58,371 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:31:58,371 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2019-11-16 00:31:58,410 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-16 00:31:58,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:31:58,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:31:58,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:58,486 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:31:58,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:31:58,495 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 41 states and 45 transitions. Complement of second has 4 states. [2019-11-16 00:31:58,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:31:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:31:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-16 00:31:58,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 37 letters. Loop has 2 letters. [2019-11-16 00:31:58,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:58,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 39 letters. Loop has 2 letters. [2019-11-16 00:31:58,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:58,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 37 letters. Loop has 4 letters. [2019-11-16 00:31:58,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:58,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2019-11-16 00:31:58,497 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:31:58,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-16 00:31:58,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:31:58,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:31:58,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:31:58,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:31:58,498 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:58,498 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:58,498 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:58,498 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-16 00:31:58,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:31:58,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:31:58,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:31:58,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:31:58 BoogieIcfgContainer [2019-11-16 00:31:58,505 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:31:58,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:31:58,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:31:58,506 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:31:58,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:55" (3/4) ... [2019-11-16 00:31:58,509 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:31:58,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:31:58,511 INFO L168 Benchmark]: Toolchain (without parser) took 544291.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -61.4 MB). Peak memory consumption was 176.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:58,511 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:58,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:58,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:58,512 INFO L168 Benchmark]: Boogie Preprocessor took 30.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:58,513 INFO L168 Benchmark]: RCFGBuilder took 389.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:58,513 INFO L168 Benchmark]: BuchiAutomizer took 543163.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 35.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 135.4 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:58,513 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:58,515 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 389.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 543163.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 35.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 135.4 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.25 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (14 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 543.1s and 19 iterations. TraceHistogramMax:10. Analysis of lassos took 541.6s. Construction of modules took 0.5s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 55 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 405 SDtfs, 529 SDslu, 1351 SDs, 0 SdLazy, 546 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU13 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital498 mio100 ax107 hnf100 lsp89 ukn38 mio100 lsp53 div100 bol100 ite100 ukn100 eq184 hnf89 smp93 dnf173 smp71 tf100 neg98 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...