./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/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety/test-memleak_nexttime.i -s /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/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/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/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-10-22 08:56:01,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:01,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:01,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:01,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:01,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:01,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:01,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:01,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:01,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:01,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:01,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:01,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:01,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:01,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:01,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:01,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:01,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:01,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:01,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:01,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:01,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:01,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:01,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:01,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:01,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:01,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:01,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:01,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:01,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:01,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:01,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:01,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:01,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:01,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:01,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:01,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:01,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:01,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:01,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:01,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:01,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:56:01,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:01,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:01,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:01,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:01,863 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:01,863 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:01,863 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:01,864 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:01,864 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:01,864 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:01,864 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:01,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:01,864 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:01,865 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:01,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:01,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:01,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:01,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:01,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:01,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:01,866 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:01,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:01,866 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:01,866 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:01,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:01,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:01,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:01,867 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:01,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:01,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:01,867 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:01,869 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:01,869 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/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/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-10-22 08:56:01,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:01,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:01,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:01,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:01,921 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:01,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2019-10-22 08:56:01,972 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/data/0cd181427/9c714209396c46f5a2e40e26a4274ee0/FLAGec74c42b1 [2019-10-22 08:56:02,447 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:02,448 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2019-10-22 08:56:02,464 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/data/0cd181427/9c714209396c46f5a2e40e26a4274ee0/FLAGec74c42b1 [2019-10-22 08:56:02,947 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/bin/uautomizer/data/0cd181427/9c714209396c46f5a2e40e26a4274ee0 [2019-10-22 08:56:02,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:02,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:02,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:02,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:02,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:02,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:02" (1/1) ... [2019-10-22 08:56:02,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bd659b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:02, skipping insertion in model container [2019-10-22 08:56:02,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:02" (1/1) ... [2019-10-22 08:56:02,969 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:03,006 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:03,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:03,420 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:03,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:03,523 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:03,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03 WrapperNode [2019-10-22 08:56:03,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:03,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:03,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:03,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:03,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:03,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:03,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:03,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:03,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:03,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:03,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:03,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:03,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/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-10-22 08:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-22 08:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-22 08:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-22 08:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-22 08:56:03,658 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-22 08:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:56:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:56:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:56:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 08:56:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-22 08:56:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:03,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:03,881 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:56:03,921 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:03,921 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 08:56:03,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:03 BoogieIcfgContainer [2019-10-22 08:56:03,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:03,923 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:03,923 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:03,927 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:03,928 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:03,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:02" (1/3) ... [2019-10-22 08:56:03,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@334f5bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:03, skipping insertion in model container [2019-10-22 08:56:03,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:03,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03" (2/3) ... [2019-10-22 08:56:03,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@334f5bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:03, skipping insertion in model container [2019-10-22 08:56:03,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:03,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:03" (3/3) ... [2019-10-22 08:56:03,932 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime.i [2019-10-22 08:56:03,985 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:03,985 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:03,985 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:03,985 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:03,985 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:03,985 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:03,985 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:03,985 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:04,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:56:04,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-10-22 08:56:04,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:04,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:04,041 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:04,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:04,042 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:04,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:56:04,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-10-22 08:56:04,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:04,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:04,044 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:04,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:04,052 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-10-22 08:56:04,054 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-10-22 08:56:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash 28715065, now seen corresponding path program 1 times [2019-10-22 08:56:04,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:04,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604555954] [2019-10-22 08:56:04,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,234 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,236 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2019-10-22 08:56:04,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:04,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249067190] [2019-10-22 08:56:04,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,252 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,254 INFO L82 PathProgramCache]: Analyzing trace with hash 890167032, now seen corresponding path program 1 times [2019-10-22 08:56:04,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:04,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143477866] [2019-10-22 08:56:04,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:04,564 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 08:56:04,685 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-22 08:56:05,057 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-10-22 08:56:05,200 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-22 08:56:05,215 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:05,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:05,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:05,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:05,217 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:05,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:05,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:05,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:05,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime.i_Iteration1_Lasso [2019-10-22 08:56:05,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:05,218 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:05,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,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-10-22 08:56:05,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,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-10-22 08:56:05,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-10-22 08:56:05,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-10-22 08:56:05,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,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-10-22 08:56:05,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,720 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-10-22 08:56:05,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:05,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:06,301 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-10-22 08:56:06,379 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:06,384 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:06,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,389 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,391 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,391 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,399 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,407 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,407 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,422 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,423 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,423 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,435 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,441 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,441 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,441 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,442 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,451 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,451 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,454 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,454 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,455 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,455 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,458 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,458 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,458 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,459 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,459 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,464 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,470 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,471 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,471 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,475 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,477 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,477 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,486 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,487 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,487 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,500 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,500 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,500 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,503 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,503 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,504 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,506 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,506 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,515 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,515 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,529 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,531 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,531 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,552 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,552 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,563 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,565 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,565 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,576 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,577 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,587 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,587 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,595 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,595 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,607 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,608 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,619 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,619 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,629 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-10-22 08:56:06,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,638 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-10-22 08:56:06,638 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,687 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,687 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,695 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,696 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,710 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,710 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,718 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,718 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,732 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,732 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:06,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,740 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,740 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,768 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:06,797 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:56:06,797 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:56:06,800 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:06,801 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:06,802 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:06,803 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-10-22 08:56:06,840 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-10-22 08:56:06,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-10-22 08:56:06,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:06,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:06,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:06,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:06,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:06,927 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-10-22 08:56:06,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 2 states. [2019-10-22 08:56:06,980 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-10-22 08:56:06,980 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-10-22 08:56:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:56:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-10-22 08:56:06,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-10-22 08:56:06,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:06,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-10-22 08:56:06,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:06,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:56:06,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:06,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-10-22 08:56:06,990 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:06,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 23 transitions. [2019-10-22 08:56:06,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:56:06,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:06,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-10-22 08:56:06,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:06,997 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 08:56:07,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-10-22 08:56:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 08:56:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:56:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-10-22 08:56:07,025 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:56:07,025 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:56:07,025 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:07,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-10-22 08:56:07,026 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:07,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:07,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:07,027 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:07,027 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:07,027 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-10-22 08:56:07,027 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-10-22 08:56:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash 890167034, now seen corresponding path program 1 times [2019-10-22 08:56:07,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938986515] [2019-10-22 08:56:07,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:07,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938986515] [2019-10-22 08:56:07,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:07,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:07,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873101667] [2019-10-22 08:56:07,108 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,108 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2019-10-22 08:56:07,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608482952] [2019-10-22 08:56:07,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:07,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:07,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:07,174 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:56:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:07,201 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-10-22 08:56:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:07,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-10-22 08:56:07,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:07,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 08:56:07,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:07,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:07,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-10-22 08:56:07,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:07,205 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:56:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-10-22 08:56:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:56:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:56:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 08:56:07,206 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:56:07,207 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:56:07,207 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:07,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-10-22 08:56:07,207 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:07,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:07,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:07,208 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:07,208 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:07,208 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-10-22 08:56:07,208 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-10-22 08:56:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1825374235, now seen corresponding path program 1 times [2019-10-22 08:56:07,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623702350] [2019-10-22 08:56:07,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:07,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623702350] [2019-10-22 08:56:07,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563868534] [2019-10-22 08:56:07,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/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-10-22 08:56:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:07,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:07,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:07,333 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:07,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-10-22 08:56:07,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511559192] [2019-10-22 08:56:07,333 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2019-10-22 08:56:07,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639466190] [2019-10-22 08:56:07,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,344 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:07,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:56:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:07,387 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 7 Second operand 8 states. [2019-10-22 08:56:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:07,426 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-10-22 08:56:07,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:07,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-10-22 08:56:07,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:07,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-10-22 08:56:07,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:56:07,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:56:07,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-10-22 08:56:07,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:07,429 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:56:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-10-22 08:56:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-22 08:56:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:56:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-22 08:56:07,431 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:56:07,431 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:56:07,431 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:07,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-10-22 08:56:07,432 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:07,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:07,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:07,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:07,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:07,433 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-10-22 08:56:07,433 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-10-22 08:56:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 752026394, now seen corresponding path program 2 times [2019-10-22 08:56:07,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179688792] [2019-10-22 08:56:07,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:07,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179688792] [2019-10-22 08:56:07,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357139008] [2019-10-22 08:56:07,488 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/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-10-22 08:56:07,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:07,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:07,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:07,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:07,601 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:07,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-10-22 08:56:07,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801378265] [2019-10-22 08:56:07,602 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 3 times [2019-10-22 08:56:07,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422524598] [2019-10-22 08:56:07,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,609 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:07,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:07,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:07,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:07,659 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 10 states. [2019-10-22 08:56:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:07,725 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-10-22 08:56:07,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:07,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-10-22 08:56:07,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:07,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-10-22 08:56:07,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 08:56:07,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 08:56:07,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-10-22 08:56:07,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:07,730 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 08:56:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-10-22 08:56:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-22 08:56:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:56:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-22 08:56:07,732 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 08:56:07,732 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 08:56:07,732 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:07,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-10-22 08:56:07,733 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:07,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:07,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:07,733 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:07,733 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:07,734 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-10-22 08:56:07,734 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-10-22 08:56:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1837981691, now seen corresponding path program 3 times [2019-10-22 08:56:07,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231266337] [2019-10-22 08:56:07,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:07,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231266337] [2019-10-22 08:56:07,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209821402] [2019-10-22 08:56:07,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_542db85c-97bc-484c-bcb6-3b5a3db3c745/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-10-22 08:56:07,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 08:56:07,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:07,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:07,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:07,910 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:07,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-10-22 08:56:07,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794182681] [2019-10-22 08:56:07,910 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 4 times [2019-10-22 08:56:07,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195212148] [2019-10-22 08:56:07,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,918 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:07,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:56:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:56:07,962 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 12 states. [2019-10-22 08:56:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:08,012 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-10-22 08:56:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:08,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2019-10-22 08:56:08,014 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:08,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2019-10-22 08:56:08,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:56:08,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:56:08,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-10-22 08:56:08,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:08,015 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 08:56:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-10-22 08:56:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 08:56:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:56:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-22 08:56:08,017 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 08:56:08,017 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 08:56:08,017 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:08,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-10-22 08:56:08,018 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-10-22 08:56:08,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:08,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:08,018 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:08,018 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:08,019 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-10-22 08:56:08,019 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-10-22 08:56:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1142857530, now seen corresponding path program 4 times [2019-10-22 08:56:08,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948360756] [2019-10-22 08:56:08,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,050 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 5 times [2019-10-22 08:56:08,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876214038] [2019-10-22 08:56:08,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,057 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1068845085, now seen corresponding path program 1 times [2019-10-22 08:56:08,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182489250] [2019-10-22 08:56:08,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,090 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:08,925 WARN L191 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2019-10-22 08:56:08,969 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:09,233 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-10-22 08:56:09,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:09,246 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:09,430 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-10-22 08:56:09,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:09,441 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:09,605 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-22 08:56:09,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:09,614 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:09,742 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-22 08:56:09,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:09,748 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:09,849 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-22 08:56:09,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:09,853 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:09,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:09,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:09,930 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:395, output treesize:311 [2019-10-22 08:56:10,258 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-22 08:56:10,962 WARN L191 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 152 [2019-10-22 08:56:11,289 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-10-22 08:56:11,292 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:11,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:11,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:11,292 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:11,292 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:11,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:11,292 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:11,292 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:11,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime.i_Iteration6_Lasso [2019-10-22 08:56:11,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:11,292 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:11,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-10-22 08:56:11,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,790 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-10-22 08:56:11,793 INFO L168 Benchmark]: Toolchain (without parser) took 8842.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 271.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,793 INFO L168 Benchmark]: CDTParser took 0.36 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-10-22 08:56:11,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.88 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-10-22 08:56:11,795 INFO L168 Benchmark]: Boogie Preprocessor took 33.51 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-10-22 08:56:11,795 INFO L168 Benchmark]: RCFGBuilder took 323.87 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.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,796 INFO L168 Benchmark]: BuchiAutomizer took 7868.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 273.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,799 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.36 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 570.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.88 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 33.51 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 323.87 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.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7868.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 273.4 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...