./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/b.13-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 72925b65ef321f719f00e79529e35268c3f3eaa3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:20:31,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:20:31,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:20:31,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:20:31,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:20:31,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:20:31,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:20:31,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:20:31,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:20:31,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:20:31,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:20:31,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:20:31,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:20:31,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:20:31,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:20:31,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:20:31,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:20:31,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:20:31,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:20:31,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:20:31,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:20:31,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:20:31,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:20:31,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:20:31,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:20:31,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:20:31,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:20:31,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:20:31,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:20:31,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:20:31,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:20:31,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:20:31,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:20:31,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:20:31,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:20:31,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:20:31,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:20:31,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:20:31,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:20:31,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:20:31,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:20:31,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-26 04:20:31,920 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:20:31,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:20:31,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:20:31,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:20:31,922 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:20:31,922 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:20:31,922 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:20:31,922 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:20:31,923 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:20:31,923 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:20:31,923 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:20:31,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:20:31,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:20:31,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:20:31,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:20:31,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:20:31,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:20:31,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:20:31,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:20:31,925 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:20:31,925 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:20:31,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:20:31,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:20:31,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:20:31,926 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:20:31,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:20:31,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:20:31,926 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:20:31,927 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:20:31,928 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:20:31,928 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2020-10-26 04:20:32,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:20:32,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:20:32,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:20:32,356 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:20:32,357 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:20:32,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2020-10-26 04:20:32,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61b1b092f/bedc9dc0b858414cb58c7d184a79ff5f/FLAG5254c9c98 [2020-10-26 04:20:33,157 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:20:33,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2020-10-26 04:20:33,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61b1b092f/bedc9dc0b858414cb58c7d184a79ff5f/FLAG5254c9c98 [2020-10-26 04:20:33,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61b1b092f/bedc9dc0b858414cb58c7d184a79ff5f [2020-10-26 04:20:33,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:20:33,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:20:33,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:20:33,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:20:33,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:20:33,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:20:33" (1/1) ... [2020-10-26 04:20:33,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7de6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:33, skipping insertion in model container [2020-10-26 04:20:33,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:20:33" (1/1) ... [2020-10-26 04:20:33,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:20:33,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:20:33,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:20:33,916 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:20:34,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:20:34,098 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:20:34,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34 WrapperNode [2020-10-26 04:20:34,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:20:34,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:20:34,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:20:34,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:20:34,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:20:34,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:20:34,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:20:34,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:20:34,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (1/1) ... [2020-10-26 04:20:34,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:20:34,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:20:34,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:20:34,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:20:34,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (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 04:20:34,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:20:34,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:20:34,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:20:34,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:20:34,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:20:34,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:20:34,778 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:20:34,778 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-26 04:20:34,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:20:34 BoogieIcfgContainer [2020-10-26 04:20:34,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:20:34,782 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:20:34,782 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:20:34,786 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:20:34,787 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:20:34,788 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:20:33" (1/3) ... [2020-10-26 04:20:34,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62fce530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:20:34, skipping insertion in model container [2020-10-26 04:20:34,789 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:20:34,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:34" (2/3) ... [2020-10-26 04:20:34,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62fce530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:20:34, skipping insertion in model container [2020-10-26 04:20:34,790 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:20:34,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:20:34" (3/3) ... [2020-10-26 04:20:34,791 INFO L373 chiAutomizerObserver]: Analyzing ICFG b.13-alloca.i [2020-10-26 04:20:34,873 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:20:34,873 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:20:34,874 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:20:34,874 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:20:34,874 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:20:34,874 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:20:34,874 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:20:34,875 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:20:34,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-10-26 04:20:34,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:20:34,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:34,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:34,923 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:20:34,924 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:20:34,924 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:20:34,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-10-26 04:20:34,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:20:34,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:34,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:34,929 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:20:34,930 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:20:34,939 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 14#L561-2true [2020-10-26 04:20:34,940 INFO L796 eck$LassoCheckResult]: Loop: 14#L561-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 4#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 14#L561-2true [2020-10-26 04:20:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:34,954 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:20:34,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:34,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290447196] [2020-10-26 04:20:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:35,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:35,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:35,339 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2020-10-26 04:20:35,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:35,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326765611] [2020-10-26 04:20:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:35,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:35,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:35,371 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2020-10-26 04:20:35,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:35,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629548327] [2020-10-26 04:20:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:35,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:35,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:35,523 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:35,754 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2020-10-26 04:20:36,981 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 129 DAG size of output: 100 [2020-10-26 04:20:37,407 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-26 04:20:37,423 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:20:37,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:20:37,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:20:37,425 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:20:37,425 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:20:37,425 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:37,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:20:37,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:20:37,426 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration1_Lasso [2020-10-26 04:20:37,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:20:37,426 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:20:37,455 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 04:20:37,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 04:20:37,477 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 04:20:37,483 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 04:20:37,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 04:20:37,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 04:20:37,502 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 04:20:37,508 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 04:20:37,514 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 04:20:37,522 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 04:20:37,531 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 04:20:37,540 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 04:20:38,577 WARN L193 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2020-10-26 04:20:38,840 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-10-26 04:20:38,842 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 04:20:38,851 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 04:20:38,858 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 04:20:38,864 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 04:20:38,869 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 04:20:38,877 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 04:20:38,883 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 04:20:38,890 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 04:20:38,895 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 04:20:39,248 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-26 04:20:39,911 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-26 04:20:40,262 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:20:40,268 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) [2020-10-26 04:20:40,289 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 04:20:40,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:40,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:40,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:40,306 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 04:20:40,333 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 04:20:40,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:40,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:40,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:40,339 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 04:20:40,367 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 04:20:40,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:40,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:40,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:40,378 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 04:20:40,413 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 04:20:40,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:40,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:40,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:40,419 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) [2020-10-26 04:20:40,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:40,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:40,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:40,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:40,467 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) [2020-10-26 04:20:40,507 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 04:20:40,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:40,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:40,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:40,522 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 04:20:40,547 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 04:20:40,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:40,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:40,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:40,553 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:40,579 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 04:20:40,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:40,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:40,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:40,586 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:40,615 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 04:20:40,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:40,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:40,632 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 04:20:40,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:40,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:40,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:40,680 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 04:20:40,707 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 04:20:40,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:40,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:40,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:40,712 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 04:20:40,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:40,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:40,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:40,750 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 04:20:40,777 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 04:20:40,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:40,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:40,792 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 04:20:40,817 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 04:20:40,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:40,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:40,849 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) [2020-10-26 04:20:40,888 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 04:20:40,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:40,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:40,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:40,942 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 04:20:40,980 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 04:20:40,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:40,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:40,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:40,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:40,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:40,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:40,997 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:41,044 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 04:20:41,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:41,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:41,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:41,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:41,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:41,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:41,055 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 04:20:41,095 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 04:20:41,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:41,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:41,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:41,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:41,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:41,101 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 04:20:41,110 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 04:20:41,168 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 04:20:41,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:41,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:41,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:41,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:41,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:41,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:41,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 04:20:41,235 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 04:20:41,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:41,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:41,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:41,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:41,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:41,241 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 04:20:41,246 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 04:20:41,293 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 04:20:41,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:41,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:41,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:41,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:41,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:41,301 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 04:20:41,309 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:41,345 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 04:20:41,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:41,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:41,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:41,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:41,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:41,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:41,377 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:41,408 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 04:20:41,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:41,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:41,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:41,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:41,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:41,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:41,427 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:41,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:41,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:41,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:41,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:41,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:41,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:41,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:41,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:20:41,557 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-26 04:20:41,557 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:41,563 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:41,567 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 04:20:41,568 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:20:41,569 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~nondet20, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*ULTIMATE.start_main_#t~nondet20 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [-1*ULTIMATE.start_main_#t~nondet20 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 >= 0] [2020-10-26 04:20:41,910 INFO L297 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2020-10-26 04:20:41,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:20:41,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:42,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:20:42,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:20:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:42,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:20:42,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:20:42,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:42,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:42,236 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 04:20:42,254 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-26 04:20:42,256 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2020-10-26 04:20:42,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 48 states and 68 transitions. Complement of second has 10 states. [2020-10-26 04:20:42,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:20:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 04:20:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-10-26 04:20:42,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-26 04:20:42,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:42,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-26 04:20:42,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:42,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 2 letters. Loop has 8 letters. [2020-10-26 04:20:42,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:42,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 68 transitions. [2020-10-26 04:20:42,475 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:20:42,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 30 states and 44 transitions. [2020-10-26 04:20:42,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 04:20:42,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 04:20:42,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2020-10-26 04:20:42,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:20:42,483 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2020-10-26 04:20:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2020-10-26 04:20:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-26 04:20:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-26 04:20:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-10-26 04:20:42,509 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-26 04:20:42,509 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-26 04:20:42,509 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:20:42,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2020-10-26 04:20:42,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:20:42,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:42,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:42,512 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:20:42,512 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:20:42,513 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 263#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 264#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 281#L557-1 [2020-10-26 04:20:42,513 INFO L796 eck$LassoCheckResult]: Loop: 281#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 278#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 279#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 274#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 276#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 281#L557-1 [2020-10-26 04:20:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-26 04:20:42,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:42,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597614928] [2020-10-26 04:20:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:42,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:42,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:42,585 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2020-10-26 04:20:42,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:42,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216124694] [2020-10-26 04:20:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:42,685 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 04:20:42,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216124694] [2020-10-26 04:20:42,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:20:42,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 04:20:42,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471981479] [2020-10-26 04:20:42,689 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:20:42,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:20:42,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:20:42,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:20:42,694 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-10-26 04:20:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:20:42,772 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-10-26 04:20:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:20:42,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2020-10-26 04:20:42,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-10-26 04:20:42,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 44 transitions. [2020-10-26 04:20:42,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 04:20:42,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 04:20:42,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2020-10-26 04:20:42,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:20:42,778 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-26 04:20:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2020-10-26 04:20:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-10-26 04:20:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-26 04:20:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-10-26 04:20:42,782 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-26 04:20:42,783 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-26 04:20:42,783 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:20:42,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-10-26 04:20:42,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-10-26 04:20:42,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:42,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:42,784 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:20:42,784 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:20:42,785 INFO L794 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 338#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 339#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 357#L557-1 assume test_fun_#t~short10; 362#L557-3 [2020-10-26 04:20:42,785 INFO L796 eck$LassoCheckResult]: Loop: 362#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 359#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 360#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 365#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 364#L557-1 assume test_fun_#t~short10; 362#L557-3 [2020-10-26 04:20:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2020-10-26 04:20:42,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:42,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008522171] [2020-10-26 04:20:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:42,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:42,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:42,841 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:42,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:42,842 INFO L82 PathProgramCache]: Analyzing trace with hash 45964857, now seen corresponding path program 1 times [2020-10-26 04:20:42,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:42,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883083105] [2020-10-26 04:20:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:42,922 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 04:20:42,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883083105] [2020-10-26 04:20:42,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:20:42,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:20:42,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049813517] [2020-10-26 04:20:42,924 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:20:42,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:20:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:20:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:20:42,926 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-10-26 04:20:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:20:43,075 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-10-26 04:20:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:20:43,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2020-10-26 04:20:43,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:20:43,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 35 transitions. [2020-10-26 04:20:43,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 04:20:43,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 04:20:43,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-10-26 04:20:43,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:20:43,083 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-26 04:20:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-10-26 04:20:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-10-26 04:20:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 04:20:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-10-26 04:20:43,094 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-26 04:20:43,095 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-26 04:20:43,096 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:20:43,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2020-10-26 04:20:43,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:20:43,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:43,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:43,099 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:20:43,100 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:20:43,100 INFO L794 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 410#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 411#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 431#L557-3 [2020-10-26 04:20:43,100 INFO L796 eck$LassoCheckResult]: Loop: 431#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 427#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 422#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 430#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 431#L557-3 [2020-10-26 04:20:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-10-26 04:20:43,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:43,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456723218] [2020-10-26 04:20:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,202 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1480169, now seen corresponding path program 1 times [2020-10-26 04:20:43,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:43,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845866624] [2020-10-26 04:20:43,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,225 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,228 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:43,230 INFO L82 PathProgramCache]: Analyzing trace with hash 179595856, now seen corresponding path program 1 times [2020-10-26 04:20:43,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:43,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157177379] [2020-10-26 04:20:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:20:43,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157177379] [2020-10-26 04:20:43,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:20:43,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:20:43,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966110202] [2020-10-26 04:20:43,609 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2020-10-26 04:20:43,717 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-26 04:20:43,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:20:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:20:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:20:43,719 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-26 04:20:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:20:43,774 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-10-26 04:20:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:20:43,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2020-10-26 04:20:43,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:20:43,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 28 transitions. [2020-10-26 04:20:43,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 04:20:43,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 04:20:43,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-10-26 04:20:43,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:20:43,777 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-26 04:20:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-10-26 04:20:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-10-26 04:20:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-26 04:20:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-10-26 04:20:43,779 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-26 04:20:43,779 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-26 04:20:43,780 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:20:43,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-10-26 04:20:43,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-10-26 04:20:43,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:43,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:43,781 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:20:43,781 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:20:43,781 INFO L794 eck$LassoCheckResult]: Stem: 472#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 466#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 467#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 481#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 474#L557-3 [2020-10-26 04:20:43,781 INFO L796 eck$LassoCheckResult]: Loop: 474#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 479#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 477#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 478#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 484#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 474#L557-3 [2020-10-26 04:20:43,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:43,782 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-10-26 04:20:43,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:43,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427858110] [2020-10-26 04:20:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,819 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:43,820 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2020-10-26 04:20:43,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:43,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497776988] [2020-10-26 04:20:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,877 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2020-10-26 04:20:43,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:43,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157207208] [2020-10-26 04:20:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,929 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:43,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:43,978 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:44,194 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-10-26 04:20:45,333 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 157 DAG size of output: 128 [2020-10-26 04:20:45,722 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-26 04:20:45,727 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:20:45,727 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:20:45,727 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:20:45,728 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:20:45,728 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:20:45,728 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:45,728 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:20:45,728 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:20:45,728 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration5_Lasso [2020-10-26 04:20:45,728 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:20:45,728 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:20:45,734 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 04:20:45,743 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 04:20:45,748 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 04:20:45,751 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 04:20:45,757 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 04:20:45,762 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 04:20:45,766 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 04:20:47,588 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2020-10-26 04:20:47,924 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2020-10-26 04:20:47,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 04:20:47,928 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 04:20:47,931 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 04:20:47,935 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 04:20:47,939 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 04:20:47,942 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 04:20:47,945 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 04:20:47,948 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 04:20:47,952 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 04:20:47,956 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 04:20:47,960 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 04:20:48,453 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-10-26 04:20:49,484 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-26 04:20:49,826 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-10-26 04:20:49,923 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:20:49,923 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:49,940 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 04:20:49,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:49,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:49,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:49,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:49,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:49,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:49,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:49,944 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:49,968 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 04:20:49,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:49,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:49,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:49,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:49,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:49,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:49,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:49,972 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:49,995 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 04:20:49,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:49,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:49,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:49,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:49,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:49,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:49,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:49,999 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,022 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 04:20:50,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:50,031 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,055 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 04:20:50,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:50,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:50,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:50,059 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:50,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:50,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,097 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,129 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 04:20:50,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:50,137 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:50,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:50,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,198 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,226 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 04:20:50,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:50,234 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:50,256 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 Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:50,264 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,286 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 04:20:50,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:50,293 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:50,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:50,350 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:50,385 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 04:20:50,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,393 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,427 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 04:20:50,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:50,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:50,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:50,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:50,438 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,460 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 04:20:50,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:50,463 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-26 04:20:50,463 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 04:20:50,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:50,527 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-26 04:20:50,527 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-26 04:20:50,621 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:20:50,778 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-26 04:20:50,779 INFO L444 ModelExtractionUtils]: 51 out of 91 variables were initially zero. Simplification set additionally 37 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:50,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,786 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-26 04:20:50,787 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:20:50,787 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2020-10-26 04:20:51,023 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2020-10-26 04:20:51,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:20:51,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:20:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:51,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:20:51,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:20:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:51,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 04:20:51,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:20:51,351 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-10-26 04:20:51,352 INFO L350 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-10-26 04:20:51,353 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 111 [2020-10-26 04:20:51,362 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-26 04:20:51,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:20:51,367 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-26 04:20:51,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:20:51,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:20:51,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:20:51,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:20:51,381 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:20:51,526 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2020-10-26 04:20:51,527 INFO L625 ElimStorePlain]: treesize reduction 325, result has 46.7 percent of original size [2020-10-26 04:20:51,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:51,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:51,536 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2020-10-26 04:20:51,537 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:285 [2020-10-26 04:20:51,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:51,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:51,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:51,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:51,706 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2020-10-26 04:20:51,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:51,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:51,812 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 04:20:51,813 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-26 04:20:51,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-10-26 04:20:51,866 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2020-10-26 04:20:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:20:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:20:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-10-26 04:20:51,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 4 letters. Loop has 5 letters. [2020-10-26 04:20:51,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 9 letters. Loop has 5 letters. [2020-10-26 04:20:51,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 4 letters. Loop has 10 letters. [2020-10-26 04:20:51,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:51,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2020-10-26 04:20:51,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-10-26 04:20:51,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 41 states and 53 transitions. [2020-10-26 04:20:51,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-26 04:20:51,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-26 04:20:51,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2020-10-26 04:20:51,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:20:51,872 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-10-26 04:20:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2020-10-26 04:20:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-26 04:20:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-26 04:20:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2020-10-26 04:20:51,877 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-10-26 04:20:51,877 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-10-26 04:20:51,877 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:20:51,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2020-10-26 04:20:51,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-10-26 04:20:51,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:51,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:51,879 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:20:51,879 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:20:51,879 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 738#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 739#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 766#L557-1 assume test_fun_#t~short10; 774#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 772#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 770#L561 [2020-10-26 04:20:51,880 INFO L796 eck$LassoCheckResult]: Loop: 770#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 769#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 773#L557-1 assume test_fun_#t~short10; 771#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 768#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 770#L561 [2020-10-26 04:20:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2020-10-26 04:20:51,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:51,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362868457] [2020-10-26 04:20:51,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:51,922 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 04:20:51,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362868457] [2020-10-26 04:20:51,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:20:51,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 04:20:51,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087948783] [2020-10-26 04:20:51,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:20:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 52859425, now seen corresponding path program 1 times [2020-10-26 04:20:51,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:51,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730151899] [2020-10-26 04:20:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:51,958 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 04:20:51,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730151899] [2020-10-26 04:20:51,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:20:51,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 04:20:51,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681975104] [2020-10-26 04:20:51,960 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:20:51,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:20:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:20:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:20:51,961 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-10-26 04:20:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:20:52,000 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-10-26 04:20:52,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:20:52,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2020-10-26 04:20:52,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 04:20:52,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 28 transitions. [2020-10-26 04:20:52,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:20:52,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:20:52,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-10-26 04:20:52,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:20:52,003 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-26 04:20:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-10-26 04:20:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-10-26 04:20:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 04:20:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-10-26 04:20:52,006 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-26 04:20:52,006 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-26 04:20:52,006 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:20:52,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2020-10-26 04:20:52,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 04:20:52,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:52,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:52,008 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:20:52,008 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:20:52,008 INFO L794 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 820#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 821#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 841#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 839#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 836#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 832#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 833#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 827#L557-1 assume test_fun_#t~short10; 828#L557-3 [2020-10-26 04:20:52,009 INFO L796 eck$LassoCheckResult]: Loop: 828#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 822#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 823#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 834#L557-1 assume test_fun_#t~short10; 828#L557-3 [2020-10-26 04:20:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2020-10-26 04:20:52,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:52,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172018830] [2020-10-26 04:20:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:20:52,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172018830] [2020-10-26 04:20:52,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005122932] [2020-10-26 04:20:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:20:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:52,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-26 04:20:52,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:20:52,269 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:20:52,269 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-10-26 04:20:52,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:20:52,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:52,284 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:20:52,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:20:52,298 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:20:52,299 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2020-10-26 04:20:52,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:52,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:52,410 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2020-10-26 04:20:52,411 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:20:52,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:20:52,426 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:20:52,426 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2020-10-26 04:20:52,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:20:52,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:20:52,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-10-26 04:20:52,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918010218] [2020-10-26 04:20:52,481 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:20:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2020-10-26 04:20:52,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:52,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245446977] [2020-10-26 04:20:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:52,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:52,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:52,500 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:52,603 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2020-10-26 04:20:52,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:20:52,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 04:20:52,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-26 04:20:52,645 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2020-10-26 04:20:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:20:52,719 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-10-26 04:20:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:20:52,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-10-26 04:20:52,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:20:52,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-10-26 04:20:52,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:20:52,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:20:52,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:20:52,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:20:52,721 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:20:52,721 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:20:52,721 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:20:52,721 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:20:52,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:20:52,721 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:20:52,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:20:52,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:20:52 BoogieIcfgContainer [2020-10-26 04:20:52,728 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:20:52,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:20:52,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:20:52,729 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:20:52,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:20:34" (3/4) ... [2020-10-26 04:20:52,733 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:20:52,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:20:52,747 INFO L168 Benchmark]: Toolchain (without parser) took 19312.79 ms. Allocated memory was 46.1 MB in the beginning and 188.7 MB in the end (delta: 142.6 MB). Free memory was 31.4 MB in the beginning and 164.9 MB in the end (delta: -133.5 MB). Peak memory consumption was 115.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:20:52,748 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 46.1 MB. Free memory was 28.7 MB in the beginning and 28.7 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:20:52,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.35 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 30.7 MB in the beginning and 32.6 MB in the end (delta: -1.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:20:52,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.29 ms. Allocated memory is still 56.6 MB. Free memory was 32.4 MB in the beginning and 30.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:20:52,749 INFO L168 Benchmark]: Boogie Preprocessor took 63.22 ms. Allocated memory is still 56.6 MB. Free memory was 30.6 MB in the beginning and 29.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:20:52,750 INFO L168 Benchmark]: RCFGBuilder took 527.48 ms. Allocated memory is still 56.6 MB. Free memory was 29.4 MB in the beginning and 27.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2020-10-26 04:20:52,751 INFO L168 Benchmark]: BuchiAutomizer took 17946.32 ms. Allocated memory was 56.6 MB in the beginning and 188.7 MB in the end (delta: 132.1 MB). Free memory was 27.2 MB in the beginning and 59.0 MB in the end (delta: -31.8 MB). Peak memory consumption was 98.7 MB. Max. memory is 16.1 GB. [2020-10-26 04:20:52,751 INFO L168 Benchmark]: Witness Printer took 17.48 ms. Allocated memory is still 188.7 MB. Free memory was 59.0 MB in the beginning and 164.9 MB in the end (delta: -105.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:20:52,754 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.22 ms. Allocated memory is still 46.1 MB. Free memory was 28.7 MB in the beginning and 28.7 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 658.35 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 30.7 MB in the beginning and 32.6 MB in the end (delta: -1.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.29 ms. Allocated memory is still 56.6 MB. Free memory was 32.4 MB in the beginning and 30.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.22 ms. Allocated memory is still 56.6 MB. Free memory was 30.6 MB in the beginning and 29.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 527.48 ms. Allocated memory is still 56.6 MB. Free memory was 29.4 MB in the beginning and 27.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 17946.32 ms. Allocated memory was 56.6 MB in the beginning and 188.7 MB in the end (delta: 132.1 MB). Free memory was 27.2 MB in the beginning and 59.0 MB in the end (delta: -31.8 MB). Peak memory consumption was 98.7 MB. Max. memory is 16.1 GB. * Witness Printer took 17.48 ms. Allocated memory is still 188.7 MB. Free memory was 59.0 MB in the beginning and 164.9 MB in the end (delta: -105.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-__VERIFIER_nondet_int()-aux + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 15.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 51 SDslu, 38 SDs, 0 SdLazy, 180 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI1 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital408 mio100 ax104 hnf99 lsp94 ukn70 mio100 lsp29 div100 bol104 ite100 ukn100 eq187 hnf88 smp97 dnf231 smp73 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 328ms VariablesStem: 17 VariablesLoop: 12 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...