./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-recursive-malloc/rec_malloc_ex1.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 97c126101f069ab488324cfc4632ee48c30de136646e991b84ddea84d63344d8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:38,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:38,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:38,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:38,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:38,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:38,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:38,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:38,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:38,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:38,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:38,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:38,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:38,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:38,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:38,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:38,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:38,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:38,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:38,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:38,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:38,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:38,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:38,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:38,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:38,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:38,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:38,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:38,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:38,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:38,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:38,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:38,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:38,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:38,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:38,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:38,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:38,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:38,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:38,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:38,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:38,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:38,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:38,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:38,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:38,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:38,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:38,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:38,816 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:38,816 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:38,816 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:38,816 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:38,817 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:38,817 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:38,817 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:38,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:38,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:38,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:38,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:38,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:38,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:38,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:38,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:38,819 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:38,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:38,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:38,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:38,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:38,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:38,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:38,821 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:38,822 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 -> 97c126101f069ab488324cfc4632ee48c30de136646e991b84ddea84d63344d8 [2022-02-21 03:35:39,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:39,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:39,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:39,025 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:39,027 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:39,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2022-02-21 03:35:39,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76cb8654/4fdd88f1023b4f6787597d8d41c7dde9/FLAG5f4b0a62b [2022-02-21 03:35:39,371 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:39,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2022-02-21 03:35:39,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76cb8654/4fdd88f1023b4f6787597d8d41c7dde9/FLAG5f4b0a62b [2022-02-21 03:35:39,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76cb8654/4fdd88f1023b4f6787597d8d41c7dde9 [2022-02-21 03:35:39,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:39,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:39,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:39,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:39,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:39,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f0443cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39, skipping insertion in model container [2022-02-21 03:35:39,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:39,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:39,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:39,987 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:39,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:40,011 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:40,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40 WrapperNode [2022-02-21 03:35:40,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:40,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:40,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:40,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:40,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,039 INFO L137 Inliner]: procedures = 11, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-21 03:35:40,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:40,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:40,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:40,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:40,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:40,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:40,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:40,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:40,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:40,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:40,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:40,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:35:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-02-21 03:35:40,119 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-02-21 03:35:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:40,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:40,178 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:40,179 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:40,392 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:40,398 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:40,398 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:35:40,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:40 BoogieIcfgContainer [2022-02-21 03:35:40,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:40,400 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:40,400 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:40,403 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:40,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:40,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:39" (1/3) ... [2022-02-21 03:35:40,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b3eefb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:40, skipping insertion in model container [2022-02-21 03:35:40,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:40,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (2/3) ... [2022-02-21 03:35:40,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b3eefb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:40, skipping insertion in model container [2022-02-21 03:35:40,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:40,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:40" (3/3) ... [2022-02-21 03:35:40,406 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2022-02-21 03:35:40,438 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:40,438 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:40,438 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:40,438 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:40,438 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:40,439 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:40,439 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:40,439 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:40,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:40,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:40,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:40,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:40,496 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:40,497 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:40,497 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:40,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:40,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:40,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:40,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:40,503 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:40,503 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:40,508 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 13#L28-3true [2022-02-21 03:35:40,509 INFO L793 eck$LassoCheckResult]: Loop: 13#L28-3true call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 11#L28-1true assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 5#L31true call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 12#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 10#L9true assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 16#recFINALtrue assume true; 15#recEXITtrue >#33#return; 14#L31-1true havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 13#L28-3true [2022-02-21 03:35:40,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:40,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2022-02-21 03:35:40,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:40,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050421957] [2022-02-21 03:35:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:40,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:40,680 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2022-02-21 03:35:40,682 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:40,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627103601] [2022-02-21 03:35:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:40,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:40,776 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2022-02-21 03:35:40,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:40,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987293145] [2022-02-21 03:35:40,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:40,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:35:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:40,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {34#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:40,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {35#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:40,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#(<= (+ |rec_#in~i| 1) 0)} assume true; {35#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:41,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#(<= (+ |rec_#in~i| 1) 0)} {28#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= 2 |ULTIMATE.start_main_#t~mem11#1|))} #33#return; {25#false} is VALID [2022-02-21 03:35:41,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {24#true} is VALID [2022-02-21 03:35:41,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; {26#(not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))} is VALID [2022-02-21 03:35:41,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#(not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))} call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {27#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} is VALID [2022-02-21 03:35:41,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {28#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= 2 |ULTIMATE.start_main_#t~mem11#1|))} is VALID [2022-02-21 03:35:41,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= 2 |ULTIMATE.start_main_#t~mem11#1|))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1); {33#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:41,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {34#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:41,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {35#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:41,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(<= (+ |rec_#in~i| 1) 0)} assume true; {35#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:41,029 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {35#(<= (+ |rec_#in~i| 1) 0)} {28#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= 2 |ULTIMATE.start_main_#t~mem11#1|))} #33#return; {25#false} is VALID [2022-02-21 03:35:41,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {25#false} is VALID [2022-02-21 03:35:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:41,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:41,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987293145] [2022-02-21 03:35:41,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987293145] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:41,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:41,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:35:41,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51400319] [2022-02-21 03:35:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:41,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:41,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:35:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:35:41,589 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:41,770 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-21 03:35:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:35:41,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:41,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:41,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2022-02-21 03:35:41,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:41,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2022-02-21 03:35:41,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:35:41,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:35:41,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-02-21 03:35:41,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:41,794 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:35:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-02-21 03:35:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:35:41,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:41,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:41,812 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:41,813 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:41,815 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:35:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:35:41,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:41,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:41,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 14 states and 16 transitions. [2022-02-21 03:35:41,826 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 14 states and 16 transitions. [2022-02-21 03:35:41,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:41,827 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:35:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:35:41,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:41,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:41,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:41,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:35:41,831 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:35:41,831 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:35:41,831 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:41,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:35:41,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:41,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:41,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:41,832 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:41,832 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:41,833 INFO L791 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 59#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 66#L28-3 [2022-02-21 03:35:41,833 INFO L793 eck$LassoCheckResult]: Loop: 66#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 64#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 62#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 65#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 60#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 61#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 65#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 60#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 63#recFINAL assume true; 67#recEXIT >#31#return; 68#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 70#recFINAL assume true; 71#recEXIT >#33#return; 69#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 66#L28-3 [2022-02-21 03:35:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:41,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2022-02-21 03:35:41,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:41,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287577072] [2022-02-21 03:35:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:41,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:41,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:41,852 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2022-02-21 03:35:41,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:41,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168522685] [2022-02-21 03:35:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:41,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:41,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {127#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:41,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#(<= (+ |rec_#in~i| 1) 0)} assume true; {127#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:42,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#(<= (+ |rec_#in~i| 1) 0)} {121#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} #31#return; {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:42,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:42,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {121#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} is VALID [2022-02-21 03:35:42,002 INFO L272 TraceCheckUtils]: 2: Hoare triple {121#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:42,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:42,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {127#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:42,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#(<= (+ |rec_#in~i| 1) 0)} assume true; {127#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:42,004 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {127#(<= (+ |rec_#in~i| 1) 0)} {121#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} #31#return; {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:42,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:42,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} assume true; {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:42,006 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} {108#(and (or (and (or (= (- 1) |ULTIMATE.start_main_#t~mem11#1|) (not (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (or (<= 2 |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~mem11#1|)))} #33#return; {106#false} is VALID [2022-02-21 03:35:42,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {107#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} is VALID [2022-02-21 03:35:42,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {108#(and (or (and (or (= (- 1) |ULTIMATE.start_main_#t~mem11#1|) (not (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (or (<= 2 |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~mem11#1|)))} is VALID [2022-02-21 03:35:42,009 INFO L272 TraceCheckUtils]: 2: Hoare triple {108#(and (or (and (or (= (- 1) |ULTIMATE.start_main_#t~mem11#1|) (not (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (or (<= 2 |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~mem11#1|)))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1); {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:42,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:42,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {121#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} is VALID [2022-02-21 03:35:42,011 INFO L272 TraceCheckUtils]: 5: Hoare triple {121#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:42,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:42,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {127#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:42,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {127#(<= (+ |rec_#in~i| 1) 0)} assume true; {127#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:42,013 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {127#(<= (+ |rec_#in~i| 1) 0)} {121#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} #31#return; {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:42,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:42,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} assume true; {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:42,015 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {126#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} {108#(and (or (and (or (= (- 1) |ULTIMATE.start_main_#t~mem11#1|) (not (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (or (<= 2 |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~mem11#1|)))} #33#return; {106#false} is VALID [2022-02-21 03:35:42,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {106#false} havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {106#false} is VALID [2022-02-21 03:35:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:35:42,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:42,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168522685] [2022-02-21 03:35:42,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168522685] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:42,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828156993] [2022-02-21 03:35:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:42,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:42,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:42,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:42,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:35:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:42,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-21 03:35:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:42,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:42,395 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:35:42,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2022-02-21 03:35:43,104 WARN L860 $PredicateComparison]: unable to prove that (and (< |c_rec_#in~i| 0) (exists ((v_ArrVal_102 (Array Int Int))) (= (store |c_old(#memory_int)| |c_rec_#in~op.base| v_ArrVal_102) |c_#memory_int|))) is different from true [2022-02-21 03:35:43,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {107#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} is VALID [2022-02-21 03:35:43,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {134#(exists ((|ULTIMATE.start_main_~qq~0#1.offset| Int) (|ULTIMATE.start_main_~pp~0#1.base| Int) (|ULTIMATE.start_main_~qq~0#1.base| Int) (|ULTIMATE.start_main_~pp~0#1.offset| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|) (or (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|)) (and (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 1) 0)))} is VALID [2022-02-21 03:35:43,391 INFO L272 TraceCheckUtils]: 2: Hoare triple {134#(exists ((|ULTIMATE.start_main_~qq~0#1.offset| Int) (|ULTIMATE.start_main_~pp~0#1.base| Int) (|ULTIMATE.start_main_~qq~0#1.base| Int) (|ULTIMATE.start_main_~pp~0#1.offset| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|) (or (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|)) (and (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 1) 0)))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1); {138#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:43,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {138#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {142#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (= rec_~i |rec_#in~i|))} is VALID [2022-02-21 03:35:43,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {142#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (= rec_~i |rec_#in~i|))} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {146#(and (exists ((v_ArrVal_101 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_101))) (not (< rec_~i 0)) (= (select |old(#valid)| rec_~ip~0.base) 0) (= rec_~i |rec_#in~i|))} is VALID [2022-02-21 03:35:43,393 INFO L272 TraceCheckUtils]: 5: Hoare triple {146#(and (exists ((v_ArrVal_101 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_101))) (not (< rec_~i 0)) (= (select |old(#valid)| rec_~ip~0.base) 0) (= rec_~i |rec_#in~i|))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {150#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:43,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#(= |#memory_int| |old(#memory_int)|)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {154#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |rec_#in~op.base| rec_~op.base))} is VALID [2022-02-21 03:35:43,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |rec_#in~op.base| rec_~op.base))} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {158#(and (exists ((v_ArrVal_102 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| v_ArrVal_102))) (< |rec_#in~i| 0))} is VALID [2022-02-21 03:35:43,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#(and (exists ((v_ArrVal_102 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| v_ArrVal_102))) (< |rec_#in~i| 0))} assume true; {158#(and (exists ((v_ArrVal_102 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| v_ArrVal_102))) (< |rec_#in~i| 0))} is VALID [2022-02-21 03:35:43,397 WARN L284 TraceCheckUtils]: 9: Hoare quadruple {158#(and (exists ((v_ArrVal_102 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| v_ArrVal_102))) (< |rec_#in~i| 0))} {146#(and (exists ((v_ArrVal_101 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_101))) (not (< rec_~i 0)) (= (select |old(#valid)| rec_~ip~0.base) 0) (= rec_~i |rec_#in~i|))} #31#return; {165#(and (exists ((rec_~ip~0.base Int) (v_ArrVal_102 (Array Int Int))) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_102)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (not (< |rec_#in~i| 0)) (< |rec_#in~i| 1))} is UNKNOWN [2022-02-21 03:35:43,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {165#(and (exists ((rec_~ip~0.base Int) (v_ArrVal_102 (Array Int Int))) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_102)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (not (< |rec_#in~i| 0)) (< |rec_#in~i| 1))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {165#(and (exists ((rec_~ip~0.base Int) (v_ArrVal_102 (Array Int Int))) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_102)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (not (< |rec_#in~i| 0)) (< |rec_#in~i| 1))} is VALID [2022-02-21 03:35:43,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {165#(and (exists ((rec_~ip~0.base Int) (v_ArrVal_102 (Array Int Int))) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_102)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (not (< |rec_#in~i| 0)) (< |rec_#in~i| 1))} assume true; {165#(and (exists ((rec_~ip~0.base Int) (v_ArrVal_102 (Array Int Int))) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_102)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (not (< |rec_#in~i| 0)) (< |rec_#in~i| 1))} is VALID [2022-02-21 03:35:43,400 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {165#(and (exists ((rec_~ip~0.base Int) (v_ArrVal_102 (Array Int Int))) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_102)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (not (< |rec_#in~i| 0)) (< |rec_#in~i| 1))} {134#(exists ((|ULTIMATE.start_main_~qq~0#1.offset| Int) (|ULTIMATE.start_main_~pp~0#1.base| Int) (|ULTIMATE.start_main_~qq~0#1.base| Int) (|ULTIMATE.start_main_~pp~0#1.offset| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|) (or (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|)) (and (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 1) 0)))} #33#return; {106#false} is VALID [2022-02-21 03:35:43,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {106#false} havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {106#false} is VALID [2022-02-21 03:35:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-21 03:35:43,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:43,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828156993] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:43,767 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:35:43,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2022-02-21 03:35:43,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349133858] [2022-02-21 03:35:43,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:43,768 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:43,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:43,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:35:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=228, Unknown=2, NotChecked=30, Total=306 [2022-02-21 03:35:43,770 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:35:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:43,954 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:35:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:35:43,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:35:43,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:43,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2022-02-21 03:35:44,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:44,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 03:35:44,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:35:44,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:35:44,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-02-21 03:35:44,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:44,001 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:35:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-02-21 03:35:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:35:44,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:44,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:44,003 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:44,003 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:44,004 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:35:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:35:44,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:44,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:44,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 17 states and 19 transitions. [2022-02-21 03:35:44,019 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 17 states and 19 transitions. [2022-02-21 03:35:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:44,021 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:35:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:35:44,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:44,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:44,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:44,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 03:35:44,022 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:35:44,022 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:35:44,022 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:44,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:35:44,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:44,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:44,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:44,023 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:44,023 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:44,024 INFO L791 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 206#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 216#L28-3 [2022-02-21 03:35:44,024 INFO L793 eck$LassoCheckResult]: Loop: 216#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 211#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 208#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 212#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 207#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 209#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 212#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 207#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 209#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 212#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 207#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 210#recFINAL assume true; 213#recEXIT >#31#return; 214#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 217#recFINAL assume true; 221#recEXIT >#31#return; 219#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 220#recFINAL assume true; 218#recEXIT >#33#return; 215#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 216#L28-3 [2022-02-21 03:35:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2022-02-21 03:35:44,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:44,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370009925] [2022-02-21 03:35:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:44,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:44,050 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2022-02-21 03:35:44,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:44,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583177754] [2022-02-21 03:35:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#(<= (+ |rec_#in~i| 1) 0)} assume true; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#(<= (+ |rec_#in~i| 1) 0)} {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} #31#return; {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} is VALID [2022-02-21 03:35:44,260 INFO L272 TraceCheckUtils]: 2: Hoare triple {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:44,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#(<= (+ |rec_#in~i| 1) 0)} assume true; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,262 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {301#(<= (+ |rec_#in~i| 1) 0)} {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} #31#return; {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} assume true; {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,263 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} {283#(= rec_~i |rec_#in~i|)} #31#return; {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,265 INFO L272 TraceCheckUtils]: 2: Hoare triple {283#(= rec_~i |rec_#in~i|)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:44,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} is VALID [2022-02-21 03:35:44,267 INFO L272 TraceCheckUtils]: 5: Hoare triple {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:44,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#(<= (+ |rec_#in~i| 1) 0)} assume true; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,269 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {301#(<= (+ |rec_#in~i| 1) 0)} {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} #31#return; {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} assume true; {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,270 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} {283#(= rec_~i |rec_#in~i|)} #31#return; {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} assume true; {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,272 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} {264#(and (or (and (or (= (- 1) |ULTIMATE.start_main_#t~mem11#1|) (not (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (or (<= 2 |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|)) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~mem11#1|)))} #33#return; {281#(or (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 0) (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 0))} is VALID [2022-02-21 03:35:44,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {263#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} is VALID [2022-02-21 03:35:44,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {263#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {264#(and (or (and (or (= (- 1) |ULTIMATE.start_main_#t~mem11#1|) (not (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (or (<= 2 |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|)) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~mem11#1|)))} is VALID [2022-02-21 03:35:44,275 INFO L272 TraceCheckUtils]: 2: Hoare triple {264#(and (or (and (or (= (- 1) |ULTIMATE.start_main_#t~mem11#1|) (not (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (or (<= 2 |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|)) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~mem11#1|)))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1); {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:44,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,276 INFO L272 TraceCheckUtils]: 5: Hoare triple {283#(= rec_~i |rec_#in~i|)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:44,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} is VALID [2022-02-21 03:35:44,278 INFO L272 TraceCheckUtils]: 8: Hoare triple {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:44,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#(<= (+ |rec_#in~i| 1) 0)} assume true; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,280 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {301#(<= (+ |rec_#in~i| 1) 0)} {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} #31#return; {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} assume true; {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} is VALID [2022-02-21 03:35:44,283 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {300#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 0))} {283#(= rec_~i |rec_#in~i|)} #31#return; {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} assume true; {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,285 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {294#(and (<= 1 |rec_#in~i|) (<= |rec_#in~i| 1))} {264#(and (or (and (or (= (- 1) |ULTIMATE.start_main_#t~mem11#1|) (not (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (or (<= 2 |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|))) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|)) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~mem11#1|)))} #33#return; {281#(or (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 0) (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 0))} is VALID [2022-02-21 03:35:44,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {281#(or (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 0) (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 0))} havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {262#false} is VALID [2022-02-21 03:35:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 03:35:44,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:44,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583177754] [2022-02-21 03:35:44,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583177754] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:44,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389111069] [2022-02-21 03:35:44,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:35:44,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:44,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:44,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:35:44,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:35:44,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:44,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:35:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:44,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-02-21 03:35:44,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {305#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} is VALID [2022-02-21 03:35:44,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {309#(or (<= (+ |ULTIMATE.start_main_#t~mem11#1| 1) 0) (< 1 |ULTIMATE.start_main_#t~mem11#1|))} is VALID [2022-02-21 03:35:44,791 INFO L272 TraceCheckUtils]: 2: Hoare triple {309#(or (<= (+ |ULTIMATE.start_main_#t~mem11#1| 1) 0) (< 1 |ULTIMATE.start_main_#t~mem11#1|))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1); {261#true} is VALID [2022-02-21 03:35:44,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {283#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:35:44,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {283#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} is VALID [2022-02-21 03:35:44,793 INFO L272 TraceCheckUtils]: 5: Hoare triple {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {261#true} is VALID [2022-02-21 03:35:44,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {325#(<= |rec_#in~i| rec_~i)} is VALID [2022-02-21 03:35:44,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(<= |rec_#in~i| rec_~i)} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {325#(<= |rec_#in~i| rec_~i)} is VALID [2022-02-21 03:35:44,794 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#(<= |rec_#in~i| rec_~i)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {261#true} is VALID [2022-02-21 03:35:44,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {325#(<= |rec_#in~i| rec_~i)} is VALID [2022-02-21 03:35:44,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {325#(<= |rec_#in~i| rec_~i)} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#(<= (+ |rec_#in~i| 1) 0)} assume true; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:44,796 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {301#(<= (+ |rec_#in~i| 1) 0)} {325#(<= |rec_#in~i| rec_~i)} #31#return; {344#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:35:44,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {344#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {344#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:35:44,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {344#(<= |rec_#in~i| 0)} assume true; {344#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:35:44,806 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {344#(<= |rec_#in~i| 0)} {295#(and (= rec_~i |rec_#in~i|) (<= 0 rec_~i))} #31#return; {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} assume true; {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:44,808 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} {309#(or (<= (+ |ULTIMATE.start_main_#t~mem11#1| 1) 0) (< 1 |ULTIMATE.start_main_#t~mem11#1|))} #33#return; {262#false} is VALID [2022-02-21 03:35:44,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#false} havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {262#false} is VALID [2022-02-21 03:35:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:35:44,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:45,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#false} havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {262#false} is VALID [2022-02-21 03:35:45,787 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} {309#(or (<= (+ |ULTIMATE.start_main_#t~mem11#1| 1) 0) (< 1 |ULTIMATE.start_main_#t~mem11#1|))} #33#return; {262#false} is VALID [2022-02-21 03:35:45,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} assume true; {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:45,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:45,794 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {344#(<= |rec_#in~i| 0)} {382#(or (and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1)) (<= 2 rec_~i))} #31#return; {354#(and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1))} is VALID [2022-02-21 03:35:45,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {344#(<= |rec_#in~i| 0)} assume true; {344#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:35:45,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {344#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {344#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:35:45,796 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {301#(<= (+ |rec_#in~i| 1) 0)} {395#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} #31#return; {344#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:35:45,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#(<= (+ |rec_#in~i| 1) 0)} assume true; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:45,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(or (<= (+ |rec_#in~i| 1) 0) (not (< rec_~i 0)))} assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; {301#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:35:45,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {405#(or (<= (+ |rec_#in~i| 1) 0) (not (< rec_~i 0)))} is VALID [2022-02-21 03:35:45,797 INFO L272 TraceCheckUtils]: 8: Hoare triple {395#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {261#true} is VALID [2022-02-21 03:35:45,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {395#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} is VALID [2022-02-21 03:35:45,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {395#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} is VALID [2022-02-21 03:35:45,798 INFO L272 TraceCheckUtils]: 5: Hoare triple {382#(or (and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1)) (<= 2 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {261#true} is VALID [2022-02-21 03:35:45,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {418#(or (and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1)) (< rec_~i 0) (<= 2 rec_~i))} assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; {382#(or (and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1)) (<= 2 rec_~i))} is VALID [2022-02-21 03:35:45,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {418#(or (and (<= 0 |rec_#in~i|) (<= |rec_#in~i| 1)) (< rec_~i 0) (<= 2 rec_~i))} is VALID [2022-02-21 03:35:45,802 INFO L272 TraceCheckUtils]: 2: Hoare triple {309#(or (<= (+ |ULTIMATE.start_main_#t~mem11#1| 1) 0) (< 1 |ULTIMATE.start_main_#t~mem11#1|))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1); {261#true} is VALID [2022-02-21 03:35:45,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(or (not (< 1 |ULTIMATE.start_main_#t~mem9#1|)) (forall ((|ULTIMATE.start_main_~pp~0#1.base| Int) (v_ArrVal_182 Int) (|ULTIMATE.start_main_~pp~0#1.offset| Int)) (or (not (<= (+ v_ArrVal_182 1) 0)) (< 1 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~pp~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))) |ULTIMATE.start_main_~qq~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~pp~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))) |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset| v_ArrVal_182)) |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|)) (<= (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~pp~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))) |ULTIMATE.start_main_~qq~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~pp~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))) |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset| v_ArrVal_182)) |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) 1) 0))))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {309#(or (<= (+ |ULTIMATE.start_main_#t~mem11#1| 1) 0) (< 1 |ULTIMATE.start_main_#t~mem11#1|))} is VALID [2022-02-21 03:35:45,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {425#(or (not (< 1 |ULTIMATE.start_main_#t~mem9#1|)) (forall ((|ULTIMATE.start_main_~pp~0#1.base| Int) (v_ArrVal_182 Int) (|ULTIMATE.start_main_~pp~0#1.offset| Int)) (or (not (<= (+ v_ArrVal_182 1) 0)) (< 1 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~pp~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))) |ULTIMATE.start_main_~qq~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~pp~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))) |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset| v_ArrVal_182)) |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|)) (<= (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~pp~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))) |ULTIMATE.start_main_~qq~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~pp~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))) |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset| v_ArrVal_182)) |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) 1) 0))))} is VALID [2022-02-21 03:35:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:35:45,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389111069] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:45,805 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:45,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 21 [2022-02-21 03:35:45,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109371708] [2022-02-21 03:35:45,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:45,806 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:45,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:45,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 03:35:45,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:35:45,807 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 7 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:35:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:46,220 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:35:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:35:46,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 7 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:35:46,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:46,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2022-02-21 03:35:46,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:46,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2022-02-21 03:35:46,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:35:46,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 03:35:46,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-02-21 03:35:46,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:46,289 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:35:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-02-21 03:35:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:35:46,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:46,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 22 transitions. Second operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:35:46,290 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 22 transitions. Second operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:35:46,290 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:35:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:46,294 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:35:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:35:46,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:46,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:46,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 20 states and 22 transitions. [2022-02-21 03:35:46,296 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 20 states and 22 transitions. [2022-02-21 03:35:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:46,299 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:35:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:35:46,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:46,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:46,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:46,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:35:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-02-21 03:35:46,302 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:35:46,302 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:35:46,302 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:46,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:35:46,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:46,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:46,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:46,305 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:46,305 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:46,305 INFO L791 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 455#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 465#L28-3 [2022-02-21 03:35:46,307 INFO L793 eck$LassoCheckResult]: Loop: 465#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 460#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 457#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 461#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 456#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 458#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 461#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 456#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 458#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 461#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 456#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 458#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 461#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 456#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 459#recFINAL assume true; 462#recEXIT >#31#return; 463#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 466#recFINAL assume true; 473#recEXIT >#31#return; 472#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 471#recFINAL assume true; 470#recEXIT >#31#return; 468#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 469#recFINAL assume true; 467#recEXIT >#33#return; 464#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 465#L28-3 [2022-02-21 03:35:46,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2022-02-21 03:35:46,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135560914] [2022-02-21 03:35:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,336 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:46,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2022-02-21 03:35:46,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547851085] [2022-02-21 03:35:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,476 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2022-02-21 03:35:46,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337227247] [2022-02-21 03:35:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,558 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,613 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:48,041 WARN L756 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-02-21 03:35:50,389 WARN L756 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-02-21 03:35:54,525 WARN L756 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-02-21 03:35:56,826 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:56,827 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:56,827 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:56,827 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:56,827 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:56,827 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,828 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:56,828 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:56,828 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2022-02-21 03:35:56,828 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:56,828 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:56,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:57,204 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:35:57,205 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:35:57,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:57,543 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:57,546 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:57,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:35:57,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:35:57,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:35:57,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:57,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:35:57,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,696 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:35:57,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:35:57,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:35:57,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:57,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:57,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:57,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,762 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:35:57,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:35:57,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:35:57,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:57,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,845 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:35:57,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:57,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,875 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:35:57,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:57,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,900 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:35:57,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:35:57,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,941 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:35:57,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:57,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:57,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:57,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:35:57,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,967 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:35:57,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:57,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:57,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:57,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:57,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:57,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:57,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:57,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:57,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:35:57,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:57,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,999 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:58,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:35:58,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:58,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:58,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:58,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:58,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:58,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:58,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:58,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:58,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:58,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:58,034 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:58,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:35:58,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:58,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:58,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:58,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:58,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:58,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:58,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:58,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:58,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:35:58,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:58,088 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:58,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:35:58,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:58,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:58,097 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:58,097 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2022-02-21 03:35:58,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:58,185 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2022-02-21 03:35:58,185 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2022-02-21 03:35:58,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:58,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:58,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:58,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:58,343 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:58,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:35:58,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:58,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:58,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:58,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:58,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:58,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:58,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:58,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:58,378 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:35:58,378 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:35:58,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:58,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:58,381 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:58,401 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:58,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:35:58,419 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:58,420 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:58,420 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:35:58,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:58,481 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:35:58,490 INFO L390 LassoCheck]: Loop: "call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);" "call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4;" "call rec(~ip~0.base, ~ip~0.offset, ~i - 1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4;" "call rec(~ip~0.base, ~ip~0.offset, ~i - 1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4;" "call rec(~ip~0.base, ~ip~0.offset, ~i - 1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2;" "assume true;" >"#31#return;" "call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);" "assume true;" >"#31#return;" "call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);" "assume true;" >"#31#return;" "call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);" "assume true;" >"#33#return;" "havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1;" [2022-02-21 03:35:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:58,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:58,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:58,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {523#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {523#unseeded} is VALID [2022-02-21 03:35:58,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; {523#unseeded} is VALID [2022-02-21 03:35:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:58,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-21 03:35:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:58,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:58,800 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-02-21 03:35:58,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 84 [2022-02-21 03:35:58,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2022-02-21 03:35:58,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-02-21 03:35:58,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:35:58,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2022-02-21 03:35:58,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-02-21 03:35:58,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 03:35:59,663 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-21 03:35:59,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 03:36:00,103 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-02-21 03:36:00,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-02-21 03:36:01,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:01,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:01,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:01,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:01,465 INFO L356 Elim1Store]: treesize reduction 53, result has 47.5 percent of original size [2022-02-21 03:36:01,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 101 [2022-02-21 03:36:01,483 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No Interpolants at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:731) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:36:01,488 INFO L158 Benchmark]: Toolchain (without parser) took 21651.57ms. Allocated memory was 79.7MB in the beginning and 251.7MB in the end (delta: 172.0MB). Free memory was 45.8MB in the beginning and 208.7MB in the end (delta: -163.0MB). Peak memory consumption was 142.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:01,488 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory was 58.1MB in the beginning and 58.1MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:01,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.34ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 45.5MB in the beginning and 72.5MB in the end (delta: -26.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-02-21 03:36:01,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.90ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 70.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:01,489 INFO L158 Benchmark]: Boogie Preprocessor took 14.96ms. Allocated memory is still 96.5MB. Free memory was 70.9MB in the beginning and 69.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:01,489 INFO L158 Benchmark]: RCFGBuilder took 341.67ms. Allocated memory is still 96.5MB. Free memory was 69.7MB in the beginning and 56.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:01,490 INFO L158 Benchmark]: BuchiAutomizer took 21086.62ms. Allocated memory was 96.5MB in the beginning and 251.7MB in the end (delta: 155.2MB). Free memory was 56.0MB in the beginning and 208.7MB in the end (delta: -152.7MB). Peak memory consumption was 138.3MB. Max. memory is 16.1GB. [2022-02-21 03:36:01,491 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory was 58.1MB in the beginning and 58.1MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.34ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 45.5MB in the beginning and 72.5MB in the end (delta: -26.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.90ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 70.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.96ms. Allocated memory is still 96.5MB. Free memory was 70.9MB in the beginning and 69.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.67ms. Allocated memory is still 96.5MB. Free memory was 69.7MB in the beginning and 56.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 21086.62ms. Allocated memory was 96.5MB in the beginning and 251.7MB in the end (delta: 155.2MB). Free memory was 56.0MB in the beginning and 208.7MB in the end (delta: -152.7MB). Peak memory consumption was 138.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No Interpolants de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No Interpolants: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:150) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:36:01,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:01,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:01,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: No Interpolants