./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety/test-memleak_nexttime.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety/test-memleak_nexttime.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 60a24c4f5e174a9ae46b1f077c5e18d0598bd760 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.2.0-5485861 [2020-10-26 06:03:28,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 06:03:28,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 06:03:28,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 06:03:28,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 06:03:28,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 06:03:28,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 06:03:28,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 06:03:28,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 06:03:28,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 06:03:28,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 06:03:28,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 06:03:28,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 06:03:28,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 06:03:28,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 06:03:28,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 06:03:28,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 06:03:28,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 06:03:28,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 06:03:28,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 06:03:28,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 06:03:28,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 06:03:28,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 06:03:28,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 06:03:28,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 06:03:28,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 06:03:28,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 06:03:28,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 06:03:28,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 06:03:28,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 06:03:28,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 06:03:28,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 06:03:28,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 06:03:28,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 06:03:28,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 06:03:28,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 06:03:28,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 06:03:28,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 06:03:28,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 06:03:28,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 06:03:28,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 06:03:28,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 06:03:28,679 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 06:03:28,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 06:03:28,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 06:03:28,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 06:03:28,683 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 06:03:28,683 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 06:03:28,683 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 06:03:28,684 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 06:03:28,684 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 06:03:28,684 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 06:03:28,685 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 06:03:28,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 06:03:28,686 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 06:03:28,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 06:03:28,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 06:03:28,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 06:03:28,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 06:03:28,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 06:03:28,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 06:03:28,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 06:03:28,688 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 06:03:28,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 06:03:28,688 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 06:03:28,689 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 06:03:28,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 06:03:28,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 06:03:28,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 06:03:28,690 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 06:03:28,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 06:03:28,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 06:03:28,690 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 06:03:28,691 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 06:03:28,693 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 06:03:28,693 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 60a24c4f5e174a9ae46b1f077c5e18d0598bd760 [2020-10-26 06:03:29,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 06:03:29,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 06:03:29,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 06:03:29,144 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 06:03:29,147 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 06:03:29,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2020-10-26 06:03:29,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763f37717/444701799a794c9eabdbfba59bd67c1d/FLAGec465ae8a [2020-10-26 06:03:30,009 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 06:03:30,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2020-10-26 06:03:30,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763f37717/444701799a794c9eabdbfba59bd67c1d/FLAGec465ae8a [2020-10-26 06:03:30,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763f37717/444701799a794c9eabdbfba59bd67c1d [2020-10-26 06:03:30,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 06:03:30,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 06:03:30,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 06:03:30,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 06:03:30,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 06:03:30,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:03:30" (1/1) ... [2020-10-26 06:03:30,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed029b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:30, skipping insertion in model container [2020-10-26 06:03:30,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:03:30" (1/1) ... [2020-10-26 06:03:30,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 06:03:30,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 06:03:30,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:03:30,880 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 06:03:30,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:03:31,046 INFO L208 MainTranslator]: Completed translation [2020-10-26 06:03:31,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31 WrapperNode [2020-10-26 06:03:31,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 06:03:31,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 06:03:31,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 06:03:31,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 06:03:31,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 06:03:31,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 06:03:31,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 06:03:31,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 06:03:31,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... [2020-10-26 06:03:31,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 06:03:31,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 06:03:31,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 06:03:31,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 06:03:31,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-26 06:03:31,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-10-26 06:03:31,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-10-26 06:03:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-10-26 06:03:31,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2020-10-26 06:03:31,239 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2020-10-26 06:03:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-26 06:03:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 06:03:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-26 06:03:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 06:03:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-26 06:03:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 06:03:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-10-26 06:03:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 06:03:31,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 06:03:31,621 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-26 06:03:31,769 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 06:03:31,769 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-26 06:03:31,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:03:31 BoogieIcfgContainer [2020-10-26 06:03:31,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 06:03:31,773 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 06:03:31,773 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 06:03:31,778 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 06:03:31,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:03:31,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 06:03:30" (1/3) ... [2020-10-26 06:03:31,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@387db2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:03:31, skipping insertion in model container [2020-10-26 06:03:31,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:03:31,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:03:31" (2/3) ... [2020-10-26 06:03:31,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@387db2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:03:31, skipping insertion in model container [2020-10-26 06:03:31,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:03:31,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:03:31" (3/3) ... [2020-10-26 06:03:31,785 INFO L373 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime.i [2020-10-26 06:03:31,865 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 06:03:31,866 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 06:03:31,866 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 06:03:31,866 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 06:03:31,866 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 06:03:31,866 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 06:03:31,866 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 06:03:31,866 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 06:03:31,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-26 06:03:31,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-10-26 06:03:31,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:03:31,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:03:31,930 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 06:03:31,931 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 06:03:31,931 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 06:03:31,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-26 06:03:31,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-10-26 06:03:31,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:03:31,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:03:31,937 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 06:03:31,937 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 06:03:31,947 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 10#L-1true havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 3#L644true call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 14##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 5#$Ultimate##0true #t~loopctr10 := 0; 9#L-1-1true [2020-10-26 06:03:31,947 INFO L796 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 9#L-1-1true [2020-10-26 06:03:31,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 28715065, now seen corresponding path program 1 times [2020-10-26 06:03:31,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:31,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118896514] [2020-10-26 06:03:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:32,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:32,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:32,337 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2020-10-26 06:03:32,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:32,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260428270] [2020-10-26 06:03:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:32,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:32,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:32,394 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:32,403 INFO L82 PathProgramCache]: Analyzing trace with hash 890167032, now seen corresponding path program 1 times [2020-10-26 06:03:32,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:32,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510682953] [2020-10-26 06:03:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:32,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:32,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:32,483 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:33,320 WARN L193 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2020-10-26 06:03:33,641 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-26 06:03:34,438 WARN L193 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2020-10-26 06:03:34,792 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-26 06:03:34,806 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:03:34,807 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:03:34,807 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:03:34,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:03:34,808 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:03:34,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:34,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:03:34,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:03:34,809 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime.i_Iteration1_Lasso [2020-10-26 06:03:34,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:03:34,809 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:03:34,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:34,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:34,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:34,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:34,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:34,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,762 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2020-10-26 06:03:35,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:35,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:36,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:36,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:36,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:36,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:36,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:36,814 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-10-26 06:03:36,932 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:03:36,940 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:36,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:36,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:36,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:36,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:36,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:36,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:36,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:36,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:36,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:37,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:37,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:37,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:37,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:37,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:37,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:37,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:37,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:37,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:37,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:37,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:37,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:37,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:37,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:37,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:37,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:37,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:37,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:37,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:37,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:37,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:37,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:37,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:03:37,949 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-26 06:03:37,949 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:37,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:37,959 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:03:37,960 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:03:37,961 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr10) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr10 Supporting invariants [] [2020-10-26 06:03:38,356 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2020-10-26 06:03:38,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2020-10-26 06:03:38,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:38,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:03:38,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:38,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:03:38,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:38,485 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 [2020-10-26 06:03:38,487 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 2 states. [2020-10-26 06:03:38,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 2 states. Result 27 states and 34 transitions. Complement of second has 6 states. [2020-10-26 06:03:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-26 06:03:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-26 06:03:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-10-26 06:03:38,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2020-10-26 06:03:38,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:38,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2020-10-26 06:03:38,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:38,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-26 06:03:38,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:38,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2020-10-26 06:03:38,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:38,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 23 transitions. [2020-10-26 06:03:38,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-26 06:03:38,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 06:03:38,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2020-10-26 06:03:38,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:03:38,577 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-26 06:03:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2020-10-26 06:03:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-26 06:03:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-26 06:03:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-10-26 06:03:38,614 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-26 06:03:38,615 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-26 06:03:38,615 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 06:03:38,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2020-10-26 06:03:38,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:38,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:03:38,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:03:38,617 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 06:03:38,617 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 06:03:38,617 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 201#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 202#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 203##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; 204#$Ultimate##0 #t~loopctr10 := 0; 205#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 216#L-1-3 [2020-10-26 06:03:38,617 INFO L796 eck$LassoCheckResult]: Loop: 216#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 216#L-1-3 [2020-10-26 06:03:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:38,618 INFO L82 PathProgramCache]: Analyzing trace with hash 890167034, now seen corresponding path program 1 times [2020-10-26 06:03:38,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:38,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688571176] [2020-10-26 06:03:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:38,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688571176] [2020-10-26 06:03:38,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:03:38,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 06:03:38,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187555963] [2020-10-26 06:03:38,691 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:03:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:38,692 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2020-10-26 06:03:38,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:38,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030611041] [2020-10-26 06:03:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:38,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:38,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:38,705 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:38,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:03:38,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 06:03:38,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 06:03:38,771 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-26 06:03:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:03:38,812 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-10-26 06:03:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:03:38,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2020-10-26 06:03:38,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:38,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2020-10-26 06:03:38,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-26 06:03:38,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 06:03:38,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-10-26 06:03:38,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:03:38,817 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-10-26 06:03:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-10-26 06:03:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-26 06:03:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-26 06:03:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2020-10-26 06:03:38,820 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-10-26 06:03:38,820 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-10-26 06:03:38,820 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 06:03:38,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2020-10-26 06:03:38,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:38,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:03:38,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:03:38,822 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:03:38,822 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 06:03:38,822 INFO L794 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 243#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 244#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 245##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; 260#$Ultimate##0 #t~loopctr10 := 0; 259#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 257#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 258#L-1-3 [2020-10-26 06:03:38,822 INFO L796 eck$LassoCheckResult]: Loop: 258#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 258#L-1-3 [2020-10-26 06:03:38,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1825374235, now seen corresponding path program 1 times [2020-10-26 06:03:38,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:38,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905004477] [2020-10-26 06:03:38,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:38,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905004477] [2020-10-26 06:03:38,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847553783] [2020-10-26 06:03:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:03:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:38,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:03:38,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:39,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:03:39,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-10-26 06:03:39,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353446036] [2020-10-26 06:03:39,010 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:03:39,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:39,010 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2020-10-26 06:03:39,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:39,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820712720] [2020-10-26 06:03:39,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:39,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:39,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:39,022 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:39,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:03:39,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 06:03:39,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-26 06:03:39,077 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 7 Second operand 8 states. [2020-10-26 06:03:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:03:39,141 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-10-26 06:03:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:03:39,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2020-10-26 06:03:39,144 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:39,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2020-10-26 06:03:39,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 06:03:39,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 06:03:39,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2020-10-26 06:03:39,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:03:39,145 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-26 06:03:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2020-10-26 06:03:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-26 06:03:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-26 06:03:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-26 06:03:39,148 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-26 06:03:39,148 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-26 06:03:39,149 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 06:03:39,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2020-10-26 06:03:39,150 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:39,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:03:39,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:03:39,150 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-26 06:03:39,150 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 06:03:39,151 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 310#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 311#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 312##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; 314#$Ultimate##0 #t~loopctr10 := 0; 315#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 322#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 323#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 325#L-1-3 [2020-10-26 06:03:39,151 INFO L796 eck$LassoCheckResult]: Loop: 325#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 325#L-1-3 [2020-10-26 06:03:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash 752026394, now seen corresponding path program 2 times [2020-10-26 06:03:39,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:39,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133786901] [2020-10-26 06:03:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:39,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133786901] [2020-10-26 06:03:39,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303137486] [2020-10-26 06:03:39,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:03:39,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:03:39,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:03:39,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:03:39,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:39,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:03:39,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2020-10-26 06:03:39,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633203280] [2020-10-26 06:03:39,385 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:03:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 3 times [2020-10-26 06:03:39,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:39,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913552374] [2020-10-26 06:03:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:39,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:39,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:39,397 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:39,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:03:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 06:03:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-10-26 06:03:39,471 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 10 states. [2020-10-26 06:03:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:03:39,545 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-10-26 06:03:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 06:03:39,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2020-10-26 06:03:39,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:39,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2020-10-26 06:03:39,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 06:03:39,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 06:03:39,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-10-26 06:03:39,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:03:39,548 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-26 06:03:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-10-26 06:03:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-26 06:03:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 06:03:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-10-26 06:03:39,552 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-26 06:03:39,552 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-26 06:03:39,552 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 06:03:39,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2020-10-26 06:03:39,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:39,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:03:39,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:03:39,553 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2020-10-26 06:03:39,553 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 06:03:39,554 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 386#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 387#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 388##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; 407#$Ultimate##0 #t~loopctr10 := 0; 406#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 400#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 401#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 403#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 402#L-1-3 [2020-10-26 06:03:39,554 INFO L796 eck$LassoCheckResult]: Loop: 402#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 402#L-1-3 [2020-10-26 06:03:39,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1837981691, now seen corresponding path program 3 times [2020-10-26 06:03:39,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:39,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122908610] [2020-10-26 06:03:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:39,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122908610] [2020-10-26 06:03:39,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767088326] [2020-10-26 06:03:39,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:03:39,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-26 06:03:39,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:03:39,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:03:39,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:39,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:03:39,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-10-26 06:03:39,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698254522] [2020-10-26 06:03:39,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:03:39,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 4 times [2020-10-26 06:03:39,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:39,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248540265] [2020-10-26 06:03:39,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:39,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:39,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:39,879 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:39,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:03:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 06:03:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-10-26 06:03:39,940 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 12 states. [2020-10-26 06:03:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:03:40,013 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-10-26 06:03:40,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 06:03:40,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2020-10-26 06:03:40,014 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:40,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2020-10-26 06:03:40,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-26 06:03:40,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-26 06:03:40,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2020-10-26 06:03:40,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:03:40,016 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-10-26 06:03:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2020-10-26 06:03:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-26 06:03:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-26 06:03:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2020-10-26 06:03:40,019 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-10-26 06:03:40,019 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-10-26 06:03:40,019 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 06:03:40,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2020-10-26 06:03:40,020 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2020-10-26 06:03:40,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:03:40,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:03:40,021 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2020-10-26 06:03:40,021 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 06:03:40,021 INFO L794 eck$LassoCheckResult]: Stem: 480#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 471#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 472#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 473##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; 494#$Ultimate##0 #t~loopctr10 := 0; 493#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 485#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 486#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 489#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 488#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 487#L-1-3 [2020-10-26 06:03:40,021 INFO L796 eck$LassoCheckResult]: Loop: 487#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 487#L-1-3 [2020-10-26 06:03:40,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1142857530, now seen corresponding path program 4 times [2020-10-26 06:03:40,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:40,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896533521] [2020-10-26 06:03:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:40,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:40,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:40,074 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:40,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:40,075 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 5 times [2020-10-26 06:03:40,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:40,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760696235] [2020-10-26 06:03:40,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:40,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:40,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:40,084 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:40,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:40,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1068845085, now seen corresponding path program 1 times [2020-10-26 06:03:40,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:40,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451817846] [2020-10-26 06:03:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:40,110 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:40,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:40,162 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:42,708 WARN L193 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2020-10-26 06:03:42,777 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 06:03:43,363 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-26 06:03:43,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:03:43,378 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 06:03:43,864 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-26 06:03:43,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:03:43,881 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 06:03:44,345 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-26 06:03:44,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:03:44,365 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 06:03:44,641 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-26 06:03:44,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:03:44,653 INFO L545 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 06:03:44,907 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-26 06:03:44,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:03:44,924 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 06:03:45,192 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-26 06:03:45,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:03:45,194 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-10-26 06:03:45,195 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:367, output treesize:287 [2020-10-26 06:03:45,413 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-26 06:03:46,322 WARN L193 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2020-10-26 06:03:46,719 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-26 06:03:47,006 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-26 06:03:47,219 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-26 06:03:49,901 WARN L193 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 179 DAG size of output: 167 [2020-10-26 06:03:51,330 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 159 [2020-10-26 06:03:51,335 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:03:51,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:03:51,336 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:03:51,336 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:03:51,336 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:03:51,336 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:51,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:03:51,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:03:51,345 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime.i_Iteration6_Lasso [2020-10-26 06:03:51,345 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:03:51,346 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:03:51,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:51,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:53,143 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java: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:957) 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:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-10-26 06:03:53,146 INFO L168 Benchmark]: Toolchain (without parser) took 22823.48 ms. Allocated memory was 39.8 MB in the beginning and 134.2 MB in the end (delta: 94.4 MB). Free memory was 24.6 MB in the beginning and 97.1 MB in the end (delta: -72.5 MB). Peak memory consumption was 87.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:03:53,147 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 39.8 MB. Free memory was 22.9 MB in the beginning and 22.9 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:03:53,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.83 ms. Allocated memory was 39.8 MB in the beginning and 52.4 MB in the end (delta: 12.6 MB). Free memory was 24.0 MB in the beginning and 26.5 MB in the end (delta: -2.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. [2020-10-26 06:03:53,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.51 ms. Allocated memory is still 52.4 MB. Free memory was 26.3 MB in the beginning and 24.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:03:53,148 INFO L168 Benchmark]: Boogie Preprocessor took 32.71 ms. Allocated memory is still 52.4 MB. Free memory was 24.5 MB in the beginning and 23.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:03:53,149 INFO L168 Benchmark]: RCFGBuilder took 632.32 ms. Allocated memory is still 52.4 MB. Free memory was 23.2 MB in the beginning and 30.1 MB in the end (delta: -6.9 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-26 06:03:53,150 INFO L168 Benchmark]: BuchiAutomizer took 21371.91 ms. Allocated memory was 52.4 MB in the beginning and 134.2 MB in the end (delta: 81.8 MB). Free memory was 30.0 MB in the beginning and 97.1 MB in the end (delta: -67.2 MB). Peak memory consumption was 81.3 MB. Max. memory is 16.1 GB. [2020-10-26 06:03:53,154 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 39.8 MB. Free memory was 22.9 MB in the beginning and 22.9 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 698.83 ms. Allocated memory was 39.8 MB in the beginning and 52.4 MB in the end (delta: 12.6 MB). Free memory was 24.0 MB in the beginning and 26.5 MB in the end (delta: -2.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.51 ms. Allocated memory is still 52.4 MB. Free memory was 26.3 MB in the beginning and 24.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.71 ms. Allocated memory is still 52.4 MB. Free memory was 24.5 MB in the beginning and 23.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 632.32 ms. Allocated memory is still 52.4 MB. Free memory was 23.2 MB in the beginning and 30.1 MB in the end (delta: -6.9 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 21371.91 ms. Allocated memory was 52.4 MB in the beginning and 134.2 MB in the end (delta: 81.8 MB). Free memory was 30.0 MB in the beginning and 97.1 MB in the end (delta: -67.2 MB). Peak memory consumption was 81.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...