./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety/test-memleak_nexttime.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_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety/test-memleak_nexttime.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/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 7f8b82d203c82fbd9a6998ebae2e5e61d62e5cb0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:25:17,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:25:17,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:25:17,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:25:17,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:25:17,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:25:17,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:25:17,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:25:17,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:25:17,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:25:17,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:25:17,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:25:17,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:25:17,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:25:17,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:25:17,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:25:17,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:25:17,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:25:17,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:25:17,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:25:17,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:25:17,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:25:17,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:25:17,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:25:17,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:25:17,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:25:17,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:25:17,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:25:17,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:25:17,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:25:17,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:25:17,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:25:17,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:25:17,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:25:17,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:25:17,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:25:17,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:25:17,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:25:17,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:25:17,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:25:17,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:25:17,549 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:25:17,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:25:17,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:25:17,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:25:17,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:25:17,583 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:25:17,583 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:25:17,583 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:25:17,583 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:25:17,584 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:25:17,584 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:25:17,584 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:25:17,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:25:17,585 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:25:17,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:25:17,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:25:17,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:25:17,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:25:17,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:25:17,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:25:17,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:25:17,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:25:17,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:25:17,587 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:25:17,587 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:25:17,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:25:17,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:25:17,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:25:17,588 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:25:17,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:25:17,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:25:17,589 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:25:17,600 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:25:17,601 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_0c2e1953-ee72-4b77-8424-ba355cc1f476/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 -> 7f8b82d203c82fbd9a6998ebae2e5e61d62e5cb0 [2019-11-15 23:25:17,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:25:17,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:25:17,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:25:17,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:25:17,657 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:25:17,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2019-11-15 23:25:17,723 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/data/d802a6201/76c5649c50574db1bed35ec314708cac/FLAGc5abbb942 [2019-11-15 23:25:18,251 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:25:18,252 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2019-11-15 23:25:18,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/data/d802a6201/76c5649c50574db1bed35ec314708cac/FLAGc5abbb942 [2019-11-15 23:25:18,594 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/bin/uautomizer/data/d802a6201/76c5649c50574db1bed35ec314708cac [2019-11-15 23:25:18,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:25:18,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:25:18,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:25:18,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:25:18,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:25:18,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:25:18" (1/1) ... [2019-11-15 23:25:18,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211bba79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:18, skipping insertion in model container [2019-11-15 23:25:18,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:25:18" (1/1) ... [2019-11-15 23:25:18,617 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:25:18,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:25:19,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:25:19,088 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:25:19,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:25:19,245 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:25:19,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19 WrapperNode [2019-11-15 23:25:19,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:25:19,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:25:19,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:25:19,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:25:19,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:25:19,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:25:19,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:25:19,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:25:19,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... [2019-11-15 23:25:19,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:25:19,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:25:19,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:25:19,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:25:19,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/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-15 23:25:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-15 23:25:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-15 23:25:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-15 23:25:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-15 23:25:19,451 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-15 23:25:19,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:25:19,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:25:19,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:25:19,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:25:19,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:25:19,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 23:25:19,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-15 23:25:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:25:19,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:25:19,672 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:25:19,729 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:25:19,730 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:25:19,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:25:19 BoogieIcfgContainer [2019-11-15 23:25:19,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:25:19,731 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:25:19,732 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:25:19,735 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:25:19,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:25:19,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:25:18" (1/3) ... [2019-11-15 23:25:19,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77c40239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:25:19, skipping insertion in model container [2019-11-15 23:25:19,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:25:19,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:25:19" (2/3) ... [2019-11-15 23:25:19,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77c40239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:25:19, skipping insertion in model container [2019-11-15 23:25:19,738 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:25:19,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:25:19" (3/3) ... [2019-11-15 23:25:19,739 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime.i [2019-11-15 23:25:19,785 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:25:19,786 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:25:19,786 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:25:19,786 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:25:19,786 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:25:19,786 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:25:19,786 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:25:19,786 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:25:19,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 23:25:19,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-15 23:25:19,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:25:19,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:25:19,846 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:25:19,847 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:25:19,847 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:25:19,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 23:25:19,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-15 23:25:19,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:25:19,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:25:19,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:25:19,850 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:25:19,858 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 10#L-1true havoc main_#res;havoc main_#t~memcpy~res4.base, main_#t~memcpy~res4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc2.base, foo_#t~malloc2.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 3#L633true call foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 14##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 4#$Ultimate##0true #t~loopctr7 := 0; 8#L-1-1true [2019-11-15 23:25:19,859 INFO L793 eck$LassoCheckResult]: Loop: 8#L-1-1true assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 8#L-1-1true [2019-11-15 23:25:19,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 28715065, now seen corresponding path program 1 times [2019-11-15 23:25:19,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:19,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359982694] [2019-11-15 23:25:19,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:19,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:19,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:20,033 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2019-11-15 23:25:20,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:20,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072899222] [2019-11-15 23:25:20,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:20,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:20,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:20,054 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:20,056 INFO L82 PathProgramCache]: Analyzing trace with hash 890167032, now seen corresponding path program 1 times [2019-11-15 23:25:20,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:20,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306531858] [2019-11-15 23:25:20,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:20,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:20,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:20,145 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:20,505 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 23:25:20,690 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 23:25:21,204 WARN L191 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-11-15 23:25:21,414 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 23:25:21,428 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:25:21,429 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:25:21,429 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:25:21,429 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:25:21,430 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:25:21,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:25:21,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:25:21,430 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:25:21,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime.i_Iteration1_Lasso [2019-11-15 23:25:21,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:25:21,431 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:25:21,471 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-15 23:25:21,476 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-15 23:25:21,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:21,485 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-15 23:25:21,490 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-15 23:25:21,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:21,497 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-15 23:25:21,501 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-15 23:25:21,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:21,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-15 23:25:21,509 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-15 23:25:21,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-15 23:25:21,515 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-15 23:25:21,517 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-15 23:25:21,521 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-15 23:25:21,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-15 23:25:21,528 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-15 23:25:21,531 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-15 23:25:22,122 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-11-15 23:25:22,255 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-15 23:25:22,258 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-15 23:25:22,261 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-15 23:25:22,264 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-15 23:25:22,267 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-15 23:25:22,269 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-15 23:25:22,273 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-15 23:25:22,277 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-15 23:25:22,906 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-15 23:25:22,997 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:25:23,001 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:25:23,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:25:23,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,005 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,008 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,011 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-15 23:25:23,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,011 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,012 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,014 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-15 23:25:23,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,015 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,016 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,016 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,017 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-15 23:25:23,018 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,021 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,021 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,025 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-15 23:25:23,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,027 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,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-15 23:25:23,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,032 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-15 23:25:23,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,035 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,035 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,041 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-15 23:25:23,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,043 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,045 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-15 23:25:23,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,045 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,047 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,048 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-15 23:25:23,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,049 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,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-15 23:25:23,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,063 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-15 23:25:23,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,066 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-15 23:25:23,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,070 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-15 23:25:23,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,078 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-15 23:25:23,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,083 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-15 23:25:23,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,084 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,085 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,085 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,086 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-15 23:25:23,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:23,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:23,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:23,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,090 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-15 23:25:23,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,094 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,094 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,100 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-15 23:25:23,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,104 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,118 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-15 23:25:23,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,127 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-15 23:25:23,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,129 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,129 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,135 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-15 23:25:23,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,138 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,138 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,144 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-15 23:25:23,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,148 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,148 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,156 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-15 23:25:23,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,157 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,159 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,159 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,164 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-15 23:25:23,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,166 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,166 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:25:23,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,177 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,177 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,181 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-15 23:25:23,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,186 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-11-15 23:25:23,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,196 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-11-15 23:25:23,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,251 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-15 23:25:23,252 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,252 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,254 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,254 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,258 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-15 23:25:23,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,259 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,260 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,261 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,267 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-15 23:25:23,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,269 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,270 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:25:23,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,276 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,276 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:25:23,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,281 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,281 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,283 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,283 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:23,288 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-15 23:25:23,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:23,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:23,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:23,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:23,292 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:23,292 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:23,323 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:25:23,365 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:25:23,365 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:25:23,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:25:23,371 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:25:23,372 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:25:23,373 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr7, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr7 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-11-15 23:25:23,435 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-11-15 23:25:23,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-15 23:25:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:23,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:25:23,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:23,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:25:23,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:23,539 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-15 23:25:23,555 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 23:25:23,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 2 states. [2019-11-15 23:25:23,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 2 states. Result 27 states and 34 transitions. Complement of second has 6 states. [2019-11-15 23:25:23,649 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-15 23:25:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 23:25:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-15 23:25:23,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-11-15 23:25:23,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:25:23,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-15 23:25:23,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:25:23,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 23:25:23,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:25:23,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-11-15 23:25:23,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:23,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 23 transitions. [2019-11-15 23:25:23,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 23:25:23,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:25:23,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-11-15 23:25:23,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:25:23,675 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 23:25:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-11-15 23:25:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 23:25:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:25:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-15 23:25:23,709 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 23:25:23,710 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 23:25:23,710 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:25:23,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-15 23:25:23,714 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:23,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:25:23,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:25:23,715 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:25:23,715 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:25:23,719 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 133#L-1 havoc main_#res;havoc main_#t~memcpy~res4.base, main_#t~memcpy~res4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc2.base, foo_#t~malloc2.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 134#L633 call foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 135##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 137#$Ultimate##0 #t~loopctr7 := 0; 138#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 146#L-1-3 [2019-11-15 23:25:23,719 INFO L793 eck$LassoCheckResult]: Loop: 146#L-1-3 assume #t~loopctr9 < size;call #t~mem10.base, #t~mem10.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr9, 4);call write~unchecked~$Pointer$(#t~mem10.base, #t~mem10.offset, dest.base, dest.offset + #t~loopctr9, 4);#t~loopctr9 := 4 + #t~loopctr9; 146#L-1-3 [2019-11-15 23:25:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash 890167034, now seen corresponding path program 1 times [2019-11-15 23:25:23,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:23,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41116715] [2019-11-15 23:25:23,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:23,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:23,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:23,846 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-15 23:25:23,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41116715] [2019-11-15 23:25:23,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:25:23,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:25:23,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137404206] [2019-11-15 23:25:23,849 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:25:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2019-11-15 23:25:23,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:23,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300122272] [2019-11-15 23:25:23,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:23,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:23,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:23,863 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:23,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:23,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:25:23,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:25:23,947 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 23:25:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:23,997 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-15 23:25:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:25:23,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-11-15 23:25:24,000 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:24,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-11-15 23:25:24,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 23:25:24,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:25:24,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-15 23:25:24,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:25:24,001 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 23:25:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-15 23:25:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 23:25:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 23:25:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-15 23:25:24,004 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 23:25:24,004 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 23:25:24,004 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:25:24,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-11-15 23:25:24,005 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:24,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:25:24,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:25:24,006 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:24,006 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:25:24,006 INFO L791 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 175#L-1 havoc main_#res;havoc main_#t~memcpy~res4.base, main_#t~memcpy~res4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc2.base, foo_#t~malloc2.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 176#L633 call foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 177##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 192#$Ultimate##0 #t~loopctr7 := 0; 191#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 189#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 190#L-1-3 [2019-11-15 23:25:24,006 INFO L793 eck$LassoCheckResult]: Loop: 190#L-1-3 assume #t~loopctr9 < size;call #t~mem10.base, #t~mem10.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr9, 4);call write~unchecked~$Pointer$(#t~mem10.base, #t~mem10.offset, dest.base, dest.offset + #t~loopctr9, 4);#t~loopctr9 := 4 + #t~loopctr9; 190#L-1-3 [2019-11-15 23:25:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1825374235, now seen corresponding path program 1 times [2019-11-15 23:25:24,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:24,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948737939] [2019-11-15 23:25:24,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:24,107 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-15 23:25:24,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948737939] [2019-11-15 23:25:24,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34290156] [2019-11-15 23:25:24,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/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-15 23:25:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:24,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:25:24,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:24,210 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-15 23:25:24,211 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:24,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-15 23:25:24,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573187607] [2019-11-15 23:25:24,211 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:25:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2019-11-15 23:25:24,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:24,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422440354] [2019-11-15 23:25:24,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:24,220 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:24,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:24,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:25:24,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:25:24,292 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 7 Second operand 8 states. [2019-11-15 23:25:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:24,355 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-15 23:25:24,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:25:24,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-11-15 23:25:24,358 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:24,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 23:25:24,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 23:25:24,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 23:25:24,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-15 23:25:24,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:25:24,360 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 23:25:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-15 23:25:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 23:25:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 23:25:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 23:25:24,363 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 23:25:24,363 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 23:25:24,363 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:25:24,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-15 23:25:24,364 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:24,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:25:24,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:25:24,365 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:24,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:25:24,365 INFO L791 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 242#L-1 havoc main_#res;havoc main_#t~memcpy~res4.base, main_#t~memcpy~res4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc2.base, foo_#t~malloc2.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 243#L633 call foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 244##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 261#$Ultimate##0 #t~loopctr7 := 0; 260#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 256#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 257#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 258#L-1-3 [2019-11-15 23:25:24,365 INFO L793 eck$LassoCheckResult]: Loop: 258#L-1-3 assume #t~loopctr9 < size;call #t~mem10.base, #t~mem10.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr9, 4);call write~unchecked~$Pointer$(#t~mem10.base, #t~mem10.offset, dest.base, dest.offset + #t~loopctr9, 4);#t~loopctr9 := 4 + #t~loopctr9; 258#L-1-3 [2019-11-15 23:25:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 752026394, now seen corresponding path program 2 times [2019-11-15 23:25:24,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:24,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329183372] [2019-11-15 23:25:24,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:24,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329183372] [2019-11-15 23:25:24,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915193097] [2019-11-15 23:25:24,470 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/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-15 23:25:24,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:25:24,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:25:24,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:25:24,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:24,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:24,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-15 23:25:24,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115560578] [2019-11-15 23:25:24,629 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:25:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 3 times [2019-11-15 23:25:24,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:24,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945588591] [2019-11-15 23:25:24,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:24,636 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:24,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:24,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:25:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:25:24,691 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 10 states. [2019-11-15 23:25:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:24,744 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-15 23:25:24,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:25:24,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-11-15 23:25:24,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:24,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-11-15 23:25:24,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:25:24,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 23:25:24,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-15 23:25:24,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:25:24,748 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 23:25:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-15 23:25:24,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-15 23:25:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 23:25:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-15 23:25:24,751 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 23:25:24,751 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 23:25:24,751 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:25:24,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-11-15 23:25:24,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:24,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:25:24,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:25:24,753 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:24,753 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:25:24,753 INFO L791 eck$LassoCheckResult]: Stem: 321#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 318#L-1 havoc main_#res;havoc main_#t~memcpy~res4.base, main_#t~memcpy~res4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc2.base, foo_#t~malloc2.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 319#L633 call foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 320##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 322#$Ultimate##0 #t~loopctr7 := 0; 323#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 330#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 331#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 335#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 333#L-1-3 [2019-11-15 23:25:24,753 INFO L793 eck$LassoCheckResult]: Loop: 333#L-1-3 assume #t~loopctr9 < size;call #t~mem10.base, #t~mem10.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr9, 4);call write~unchecked~$Pointer$(#t~mem10.base, #t~mem10.offset, dest.base, dest.offset + #t~loopctr9, 4);#t~loopctr9 := 4 + #t~loopctr9; 333#L-1-3 [2019-11-15 23:25:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1837981691, now seen corresponding path program 3 times [2019-11-15 23:25:24,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:24,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150924531] [2019-11-15 23:25:24,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:24,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:24,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150924531] [2019-11-15 23:25:24,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316950153] [2019-11-15 23:25:24,855 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c2e1953-ee72-4b77-8424-ba355cc1f476/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-15 23:25:24,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:25:24,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:25:24,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:25:24,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:25,001 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:25,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-15 23:25:25,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655993587] [2019-11-15 23:25:25,002 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:25:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 4 times [2019-11-15 23:25:25,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:25,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833707186] [2019-11-15 23:25:25,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:25,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:25,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:25,010 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:25,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:25,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:25:25,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:25:25,074 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 12 states. [2019-11-15 23:25:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:25,140 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-15 23:25:25,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:25:25,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2019-11-15 23:25:25,144 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:25,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2019-11-15 23:25:25,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 23:25:25,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 23:25:25,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-11-15 23:25:25,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:25:25,146 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-15 23:25:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-11-15 23:25:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-15 23:25:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:25:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-11-15 23:25:25,148 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-15 23:25:25,148 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-15 23:25:25,148 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:25:25,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-11-15 23:25:25,149 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-11-15 23:25:25,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:25:25,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:25:25,150 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:25,150 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:25:25,150 INFO L791 eck$LassoCheckResult]: Stem: 410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 403#L-1 havoc main_#res;havoc main_#t~memcpy~res4.base, main_#t~memcpy~res4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc2.base, foo_#t~malloc2.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc2.base, foo_#t~malloc2.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 404#L633 call foo_#t~memcpy~res3.base, foo_#t~memcpy~res3.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 405##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 408#$Ultimate##0 #t~loopctr7 := 0; 409#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 415#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 416#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 422#L-1-1 assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 420#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 418#L-1-3 [2019-11-15 23:25:25,150 INFO L793 eck$LassoCheckResult]: Loop: 418#L-1-3 assume #t~loopctr9 < size;call #t~mem10.base, #t~mem10.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr9, 4);call write~unchecked~$Pointer$(#t~mem10.base, #t~mem10.offset, dest.base, dest.offset + #t~loopctr9, 4);#t~loopctr9 := 4 + #t~loopctr9; 418#L-1-3 [2019-11-15 23:25:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1142857530, now seen corresponding path program 4 times [2019-11-15 23:25:25,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:25,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974854766] [2019-11-15 23:25:25,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:25,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:25,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:25,185 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:25,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:25,186 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 5 times [2019-11-15 23:25:25,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:25,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480612740] [2019-11-15 23:25:25,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:25,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:25,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:25,193 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:25,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1068845085, now seen corresponding path program 1 times [2019-11-15 23:25:25,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:25,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001039619] [2019-11-15 23:25:25,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:25,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:25,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:25:25,267 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:25:26,303 WARN L191 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2019-11-15 23:25:26,371 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-15 23:25:26,633 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-15 23:25:26,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:26,644 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-15 23:25:26,864 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 23:25:26,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:26,871 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-15 23:25:27,087 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 23:25:27,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,097 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-15 23:25:27,263 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 23:25:27,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,272 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-15 23:25:27,405 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-15 23:25:27,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,419 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-15 23:25:27,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 23:25:27,511 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:395, output treesize:311 [2019-11-15 23:25:27,695 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 23:25:27,916 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 23:25:28,817 WARN L191 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 152 [2019-11-15 23:25:29,229 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-15 23:25:29,232 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:25:29,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:25:29,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:25:29,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:25:29,232 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:25:29,233 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:25:29,233 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:25:29,233 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:25:29,233 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime.i_Iteration6_Lasso [2019-11-15 23:25:29,233 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:25:29,233 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:25:29,237 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-15 23:25:29,244 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-15 23:25:29,247 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-15 23:25:29,248 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-15 23:25:29,250 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-15 23:25:29,252 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-15 23:25:29,254 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-15 23:25:29,256 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-15 23:25:29,258 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-15 23:25:29,261 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-15 23:25:29,262 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-15 23:25:29,264 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-15 23:25:29,265 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-15 23:25:29,267 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-15 23:25:29,270 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-15 23:25:29,273 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-15 23:25:29,274 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-15 23:25:29,281 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-15 23:25:29,286 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-15 23:25:29,293 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-15 23:25:29,295 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-15 23:25:29,297 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-15 23:25:29,300 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-15 23:25:29,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:29,862 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:25:29,865 INFO L168 Benchmark]: Toolchain (without parser) took 11266.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 270.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:29,865 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:25:29,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:29,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:29,867 INFO L168 Benchmark]: Boogie Preprocessor took 55.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:29,868 INFO L168 Benchmark]: RCFGBuilder took 351.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:29,869 INFO L168 Benchmark]: BuchiAutomizer took 10132.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.5 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:29,872 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 351.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10132.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.5 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...