./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/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 1cebb5f481285aa400c004636e713993debded4b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/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.23-635dfa2 [2018-12-02 17:31:13,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:31:13,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:31:13,139 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:31:13,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:31:13,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:31:13,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:31:13,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:31:13,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:31:13,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:31:13,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:31:13,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:31:13,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:31:13,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:31:13,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:31:13,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:31:13,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:31:13,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:31:13,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:31:13,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:31:13,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:31:13,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:31:13,149 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:31:13,149 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:31:13,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:31:13,150 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:31:13,150 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:31:13,151 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:31:13,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:31:13,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:31:13,152 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:31:13,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:31:13,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:31:13,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:31:13,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:31:13,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:31:13,153 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 17:31:13,161 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:31:13,161 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:31:13,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 17:31:13,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 17:31:13,162 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 17:31:13,162 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 17:31:13,162 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 17:31:13,162 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 17:31:13,162 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 17:31:13,162 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 17:31:13,162 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 17:31:13,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:31:13,163 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 17:31:13,164 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 17:31:13,164 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 17:31:13,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:31:13,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:31:13,164 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 17:31:13,164 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:31:13,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 17:31:13,164 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 17:31:13,165 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 17:31:13,165 INFO L133 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_26520904-96e9-448a-85d6-920e60233c26/bin-2019/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 -> 1cebb5f481285aa400c004636e713993debded4b [2018-12-02 17:31:13,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:31:13,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:31:13,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:31:13,195 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:31:13,195 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:31:13,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-12-02 17:31:13,235 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/data/70bd68ef8/5c6fed7235604ea28a44fdaf3ce41b8b/FLAG0b224f41b [2018-12-02 17:31:13,689 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:31:13,689 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-12-02 17:31:13,695 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/data/70bd68ef8/5c6fed7235604ea28a44fdaf3ce41b8b/FLAG0b224f41b [2018-12-02 17:31:13,703 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/data/70bd68ef8/5c6fed7235604ea28a44fdaf3ce41b8b [2018-12-02 17:31:13,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:31:13,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:31:13,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:31:13,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:31:13,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:31:13,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:13,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eda5476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13, skipping insertion in model container [2018-12-02 17:31:13,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:13,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:31:13,739 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:31:13,904 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:31:13,911 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:31:13,963 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:31:13,995 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:31:13,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13 WrapperNode [2018-12-02 17:31:13,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:31:13,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:31:13,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:31:13,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:31:14,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:31:14,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:31:14,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:31:14,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:31:14,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... [2018-12-02 17:31:14,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:31:14,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:31:14,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:31:14,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:31:14,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/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 [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-12-02 17:31:14,072 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 17:31:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 17:31:14,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-12-02 17:31:14,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:31:14,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:31:14,182 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 17:31:14,208 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:31:14,208 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 17:31:14,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:31:14 BoogieIcfgContainer [2018-12-02 17:31:14,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:31:14,209 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 17:31:14,209 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 17:31:14,211 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 17:31:14,212 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:31:14,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 05:31:13" (1/3) ... [2018-12-02 17:31:14,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f3ea088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:31:14, skipping insertion in model container [2018-12-02 17:31:14,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:31:14,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:13" (2/3) ... [2018-12-02 17:31:14,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f3ea088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:31:14, skipping insertion in model container [2018-12-02 17:31:14,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:31:14,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:31:14" (3/3) ... [2018-12-02 17:31:14,214 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-12-02 17:31:14,247 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 17:31:14,247 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 17:31:14,247 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 17:31:14,247 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 17:31:14,247 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:31:14,247 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:31:14,247 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 17:31:14,248 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:31:14,248 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 17:31:14,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-02 17:31:14,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-12-02 17:31:14,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:31:14,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:31:14,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 17:31:14,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 17:31:14,276 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 17:31:14,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-02 17:31:14,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-12-02 17:31:14,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:31:14,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:31:14,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 17:31:14,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 17:31:14,282 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(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); 9#L-1true havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 11#L744true call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 13##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~loopctr5 := 0; 7#L-1-1true [2018-12-02 17:31:14,282 INFO L796 eck$LassoCheckResult]: Loop: 7#L-1-1true assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 7#L-1-1true [2018-12-02 17:31:14,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash 28715065, now seen corresponding path program 1 times [2018-12-02 17:31:14,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:14,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:14,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:14,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:14,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:14,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2018-12-02 17:31:14,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:14,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:14,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:14,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:14,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:14,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash 890167032, now seen corresponding path program 1 times [2018-12-02 17:31:14,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:14,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:14,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:14,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:14,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:14,791 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2018-12-02 17:31:14,866 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:31:14,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:31:14,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:31:14,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:31:14,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:31:14,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:31:14,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:31:14,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:31:14,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-02 17:31:14,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:31:14,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:31:14,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:14,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:14,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:14,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:14,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:15,399 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:31:15,402 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:31:15,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:31:15,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:31:15,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:31:15,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:31:15,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:31:15,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:31:15,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:31:15,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:31:15,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:31:15,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,416 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:31:15,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,417 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:31:15,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,427 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:31:15,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,429 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:31:15,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:31:15,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:31:15,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:31:15,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:31:15,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:31:15,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:31:15,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:31:15,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:31:15,490 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:31:15,503 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 17:31:15,504 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 17:31:15,505 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:31:15,506 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:31:15,506 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:31:15,507 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr5, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr5 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-12-02 17:31:15,539 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-12-02 17:31:15,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-12-02 17:31:15,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:15,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:31:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:15,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:31:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:15,601 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 [2018-12-02 17:31:15,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 2 states. [2018-12-02 17:31:15,637 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. [2018-12-02 17:31:15,637 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 [2018-12-02 17:31:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-02 17:31:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-02 17:31:15,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2018-12-02 17:31:15,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:31:15,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2018-12-02 17:31:15,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:31:15,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 17:31:15,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:31:15,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-12-02 17:31:15,644 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:15,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 23 transitions. [2018-12-02 17:31:15,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 17:31:15,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:31:15,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-12-02 17:31:15,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:31:15,649 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-02 17:31:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-12-02 17:31:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-02 17:31:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 17:31:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-02 17:31:15,666 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-02 17:31:15,666 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-02 17:31:15,666 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 17:31:15,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-12-02 17:31:15,667 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:15,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:31:15,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:31:15,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 17:31:15,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 17:31:15,668 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(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~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 134#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 142##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; 149#$Ultimate##0 #t~loopctr5 := 0; 148#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 147#L-1-3 [2018-12-02 17:31:15,668 INFO L796 eck$LassoCheckResult]: Loop: 147#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 147#L-1-3 [2018-12-02 17:31:15,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash 890167034, now seen corresponding path program 1 times [2018-12-02 17:31:15,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:15,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:15,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:31:15,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:31:15,722 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:31:15,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2018-12-02 17:31:15,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:15,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:15,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:31:15,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:31:15,768 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 17:31:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:15,789 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-02 17:31:15,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:31:15,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-12-02 17:31:15,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:15,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-12-02 17:31:15,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:31:15,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:31:15,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-02 17:31:15,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:31:15,791 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 17:31:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-02 17:31:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 17:31:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 17:31:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-02 17:31:15,793 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 17:31:15,793 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 17:31:15,793 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 17:31:15,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-12-02 17:31:15,793 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:15,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:31:15,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:31:15,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:15,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 17:31:15,794 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(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~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 176#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 185##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~loopctr5 := 0; 191#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 189#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 190#L-1-3 [2018-12-02 17:31:15,794 INFO L796 eck$LassoCheckResult]: Loop: 190#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 190#L-1-3 [2018-12-02 17:31:15,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1825374235, now seen corresponding path program 1 times [2018-12-02 17:31:15,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:15,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:15,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:15,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:31:15,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:15,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:31:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:15,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:31:15,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-02 17:31:15,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:31:15,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2018-12-02 17:31:15,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:15,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:15,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:31:15,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:31:15,928 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-12-02 17:31:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:15,952 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-12-02 17:31:15,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:31:15,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-12-02 17:31:15,953 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:15,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-12-02 17:31:15,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-02 17:31:15,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-02 17:31:15,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-02 17:31:15,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:31:15,954 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-02 17:31:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-02 17:31:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 17:31:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 17:31:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-02 17:31:15,955 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-02 17:31:15,956 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-02 17:31:15,956 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 17:31:15,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-02 17:31:15,956 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:15,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:31:15,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:31:15,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:15,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 17:31:15,957 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(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~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 243#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 251##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; 246#$Ultimate##0 #t~loopctr5 := 0; 247#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 255#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 256#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 257#L-1-3 [2018-12-02 17:31:15,957 INFO L796 eck$LassoCheckResult]: Loop: 257#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 257#L-1-3 [2018-12-02 17:31:15,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash 752026394, now seen corresponding path program 2 times [2018-12-02 17:31:15,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:15,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:15,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:31:15,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:15,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:15,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:31:16,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 17:31:16,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 17:31:16,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:31:16,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:31:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:16,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:31:16,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-12-02 17:31:16,076 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:31:16,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 3 times [2018-12-02 17:31:16,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:16,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:31:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 17:31:16,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:31:16,106 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-12-02 17:31:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:16,126 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-02 17:31:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:31:16,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-12-02 17:31:16,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:16,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2018-12-02 17:31:16,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 17:31:16,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 17:31:16,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-12-02 17:31:16,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:31:16,128 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-02 17:31:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-12-02 17:31:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-02 17:31:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 17:31:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-02 17:31:16,129 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-02 17:31:16,129 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-02 17:31:16,129 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 17:31:16,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-12-02 17:31:16,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:16,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:31:16,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:31:16,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:16,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 17:31:16,130 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(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~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 319#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 327##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; 339#$Ultimate##0 #t~loopctr5 := 0; 337#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 332#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 333#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 335#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 334#L-1-3 [2018-12-02 17:31:16,130 INFO L796 eck$LassoCheckResult]: Loop: 334#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 334#L-1-3 [2018-12-02 17:31:16,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1837981691, now seen corresponding path program 3 times [2018-12-02 17:31:16,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:16,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:31:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:16,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:16,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26520904-96e9-448a-85d6-920e60233c26/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:31:16,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:31:16,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 17:31:16,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:31:16,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:31:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:16,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:31:16,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-12-02 17:31:16,238 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:31:16,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 4 times [2018-12-02 17:31:16,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:16,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:16,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:31:16,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 17:31:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:31:16,269 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-12-02 17:31:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:16,295 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-12-02 17:31:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:31:16,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-12-02 17:31:16,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:16,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-12-02 17:31:16,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-02 17:31:16,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 17:31:16,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-12-02 17:31:16,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:31:16,297 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 17:31:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-12-02 17:31:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-02 17:31:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 17:31:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-02 17:31:16,298 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 17:31:16,298 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 17:31:16,298 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 17:31:16,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-12-02 17:31:16,298 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-02 17:31:16,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:31:16,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:31:16,299 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:16,299 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 17:31:16,299 INFO L794 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(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~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 404#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 413##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; 424#$Ultimate##0 #t~loopctr5 := 0; 422#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 417#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 418#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 421#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 420#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 419#L-1-3 [2018-12-02 17:31:16,299 INFO L796 eck$LassoCheckResult]: Loop: 419#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 419#L-1-3 [2018-12-02 17:31:16,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1142857530, now seen corresponding path program 4 times [2018-12-02 17:31:16,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:16,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:31:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:16,316 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 5 times [2018-12-02 17:31:16,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:16,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:16,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:31:16,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:16,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1068845085, now seen corresponding path program 1 times [2018-12-02 17:31:16,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:31:16,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:31:16,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:31:16,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:17,025 WARN L180 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2018-12-02 17:31:17,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,409 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,418 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,545 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,554 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,665 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,669 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,750 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,755 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-02 17:31:17,805 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:367, output treesize:287 [2018-12-02 17:31:18,125 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-02 17:31:18,579 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-12-02 17:31:18,716 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-02 17:31:18,718 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:31:18,718 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:31:18,718 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:31:18,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:31:18,719 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:31:18,719 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:31:18,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:31:18,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:31:18,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-02 17:31:18,719 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:31:18,719 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:31:18,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:18,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:18,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:18,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:31:19,150 FATAL L292 ToolchainWalker]: 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.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:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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) [2018-12-02 17:31:19,152 INFO L168 Benchmark]: Toolchain (without parser) took 5446.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -340.6 MB). Peak memory consumption was 394.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:19,152 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:31:19,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:19,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:31:19,153 INFO L168 Benchmark]: Boogie Preprocessor took 17.72 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:19,154 INFO L168 Benchmark]: RCFGBuilder took 168.80 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:19,154 INFO L168 Benchmark]: BuchiAutomizer took 4942.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -212.1 MB). Peak memory consumption was 398.2 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:19,157 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.72 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 168.80 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4942.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -212.1 MB). Peak memory consumption was 398.2 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...