./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-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-e19ca92 [2021-12-22 19:56:09,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 19:56:09,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 19:56:09,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 19:56:09,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 19:56:09,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 19:56:09,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 19:56:09,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 19:56:09,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 19:56:09,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 19:56:09,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 19:56:09,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 19:56:09,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 19:56:09,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 19:56:09,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 19:56:09,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 19:56:09,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 19:56:09,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 19:56:09,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 19:56:09,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 19:56:09,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 19:56:09,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 19:56:09,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 19:56:09,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 19:56:09,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 19:56:09,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 19:56:09,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 19:56:09,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 19:56:09,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 19:56:09,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 19:56:09,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 19:56:09,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 19:56:09,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 19:56:09,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 19:56:09,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 19:56:09,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 19:56:09,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 19:56:09,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 19:56:09,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 19:56:09,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 19:56:09,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 19:56:09,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-22 19:56:09,609 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 19:56:09,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 19:56:09,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 19:56:09,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 19:56:09,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 19:56:09,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 19:56:09,613 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 19:56:09,613 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 19:56:09,613 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 19:56:09,614 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 19:56:09,614 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 19:56:09,614 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 19:56:09,615 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 19:56:09,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 19:56:09,615 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 19:56:09,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 19:56:09,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 19:56:09,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 19:56:09,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 19:56:09,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 19:56:09,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 19:56:09,616 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 19:56:09,616 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 19:56:09,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 19:56:09,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 19:56:09,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 19:56:09,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 19:56:09,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 19:56:09,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 19:56:09,619 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 19:56:09,619 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 [2021-12-22 19:56:09,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 19:56:09,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 19:56:09,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 19:56:09,840 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 19:56:09,841 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 19:56:09,842 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 [2021-12-22 19:56:09,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959e49f72/a47a8cdcfae348fbb3ad0e73bfea79bc/FLAGb26ba07c6 [2021-12-22 19:56:10,234 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 19:56:10,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2021-12-22 19:56:10,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959e49f72/a47a8cdcfae348fbb3ad0e73bfea79bc/FLAGb26ba07c6 [2021-12-22 19:56:10,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959e49f72/a47a8cdcfae348fbb3ad0e73bfea79bc [2021-12-22 19:56:10,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 19:56:10,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 19:56:10,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 19:56:10,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 19:56:10,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 19:56:10,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61dac547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10, skipping insertion in model container [2021-12-22 19:56:10,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 19:56:10,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 19:56:10,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:56:10,414 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 19:56:10,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:56:10,433 INFO L208 MainTranslator]: Completed translation [2021-12-22 19:56:10,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10 WrapperNode [2021-12-22 19:56:10,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 19:56:10,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 19:56:10,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 19:56:10,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 19:56:10,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,459 INFO L137 Inliner]: procedures = 11, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2021-12-22 19:56:10,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 19:56:10,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 19:56:10,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 19:56:10,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 19:56:10,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 19:56:10,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 19:56:10,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 19:56:10,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 19:56:10,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (1/1) ... [2021-12-22 19:56:10,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:10,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:10,524 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) [2021-12-22 19:56:10,547 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 [2021-12-22 19:56:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 19:56:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2021-12-22 19:56:10,557 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2021-12-22 19:56:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 19:56:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 19:56:10,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 19:56:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 19:56:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 19:56:10,608 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 19:56:10,609 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 19:56:10,781 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 19:56:10,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 19:56:10,786 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-22 19:56:10,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:56:10 BoogieIcfgContainer [2021-12-22 19:56:10,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 19:56:10,795 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 19:56:10,795 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 19:56:10,797 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 19:56:10,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:10,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 07:56:10" (1/3) ... [2021-12-22 19:56:10,799 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e68984d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:56:10, skipping insertion in model container [2021-12-22 19:56:10,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:10,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:10" (2/3) ... [2021-12-22 19:56:10,799 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e68984d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:56:10, skipping insertion in model container [2021-12-22 19:56:10,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:10,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:56:10" (3/3) ... [2021-12-22 19:56:10,800 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2021-12-22 19:56:10,838 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 19:56:10,839 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 19:56:10,839 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 19:56:10,839 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 19:56:10,839 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 19:56:10,839 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 19:56:10,839 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 19:56:10,839 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 19:56:10,851 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) [2021-12-22 19:56:10,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 19:56:10,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:10,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:10,878 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:56:10,878 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:10,878 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 19:56:10,878 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) [2021-12-22 19:56:10,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 19:56:10,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:10,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:10,882 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:56:10,882 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:10,886 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 [2021-12-22 19:56:10,887 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 [2021-12-22 19:56:10,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2021-12-22 19:56:10,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:10,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264338402] [2021-12-22 19:56:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:10,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,054 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,057 INFO L85 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2021-12-22 19:56:11,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102659938] [2021-12-22 19:56:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,107 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2021-12-22 19:56:11,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373112066] [2021-12-22 19:56:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 19:56:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:11,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:11,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373112066] [2021-12-22 19:56:11,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373112066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:56:11,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:56:11,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 19:56:11,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861330438] [2021-12-22 19:56:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:56:11,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 19:56:11,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 19:56:11,840 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) [2021-12-22 19:56:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:11,899 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2021-12-22 19:56:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 19:56:11,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2021-12-22 19:56:11,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 19:56:11,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2021-12-22 19:56:11,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-22 19:56:11,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-22 19:56:11,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-22 19:56:11,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:11,909 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-22 19:56:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-22 19:56:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-22 19:56:11,924 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) [2021-12-22 19:56:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-22 19:56:11,925 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-22 19:56:11,926 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-22 19:56:11,926 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 19:56:11,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-12-22 19:56:11,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 19:56:11,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:11,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:11,927 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:56:11,927 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:11,927 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 [2021-12-22 19:56:11,928 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 [2021-12-22 19:56:11,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2021-12-22 19:56:11,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81607625] [2021-12-22 19:56:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,941 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:11,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2021-12-22 19:56:11,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917680429] [2021-12-22 19:56:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:12,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 19:56:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 19:56:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 19:56:12,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917680429] [2021-12-22 19:56:12,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917680429] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 19:56:12,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079958787] [2021-12-22 19:56:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:12,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 19:56:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:12,081 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) [2021-12-22 19:56:12,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 19:56:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:12,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-22 19:56:12,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:12,222 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-22 19:56:12,223 INFO L387 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 [2021-12-22 19:56:12,631 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 [2021-12-22 19:56:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 19:56:12,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 19:56:12,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079958787] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 19:56:12,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 19:56:12,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2021-12-22 19:56:12,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226416451] [2021-12-22 19:56:12,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 19:56:12,838 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 19:56:12,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:12,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-22 19:56:12,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=228, Unknown=2, NotChecked=30, Total=306 [2021-12-22 19:56:12,842 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) [2021-12-22 19:56:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:12,925 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-12-22 19:56:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 19:56:12,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-12-22 19:56:12,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 19:56:12,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2021-12-22 19:56:12,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-22 19:56:12,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-22 19:56:12,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2021-12-22 19:56:12,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:12,928 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-22 19:56:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2021-12-22 19:56:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-22 19:56:12,929 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) [2021-12-22 19:56:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-22 19:56:12,930 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-22 19:56:12,930 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-22 19:56:12,930 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 19:56:12,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2021-12-22 19:56:12,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 19:56:12,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:12,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:12,932 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:56:12,932 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:12,932 INFO L791 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 176#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; 186#L28-3 [2021-12-22 19:56:12,932 INFO L793 eck$LassoCheckResult]: Loop: 186#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 181#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); 178#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#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; 179#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#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; 179#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#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; 180#recFINAL assume true; 183#recEXIT >#31#return; 184#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 187#recFINAL assume true; 191#recEXIT >#31#return; 189#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 190#recFINAL assume true; 188#recEXIT >#33#return; 185#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; 186#L28-3 [2021-12-22 19:56:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2021-12-22 19:56:12,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:12,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094393257] [2021-12-22 19:56:12,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:12,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:12,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:12,956 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2021-12-22 19:56:12,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:12,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893249619] [2021-12-22 19:56:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:12,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:13,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 19:56:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 19:56:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 19:56:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-22 19:56:13,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:13,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893249619] [2021-12-22 19:56:13,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893249619] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 19:56:13,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871504786] [2021-12-22 19:56:13,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 19:56:13,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 19:56:13,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:13,206 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) [2021-12-22 19:56:13,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 19:56:13,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 19:56:13,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 19:56:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-22 19:56:13,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:13,359 INFO L387 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 [2021-12-22 19:56:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 19:56:13,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 19:56:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 19:56:13,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871504786] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 19:56:13,836 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 19:56:13,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 21 [2021-12-22 19:56:13,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261758202] [2021-12-22 19:56:13,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 19:56:13,837 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 19:56:13,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:13,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 19:56:13,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2021-12-22 19:56:13,839 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) [2021-12-22 19:56:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:13,961 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-12-22 19:56:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 19:56:13,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2021-12-22 19:56:13,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 19:56:13,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2021-12-22 19:56:13,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-22 19:56:13,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-22 19:56:13,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2021-12-22 19:56:13,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:13,964 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-22 19:56:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2021-12-22 19:56:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-22 19:56:13,968 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) [2021-12-22 19:56:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-22 19:56:13,968 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-22 19:56:13,973 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-22 19:56:13,973 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 19:56:13,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2021-12-22 19:56:13,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 19:56:13,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:13,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:13,975 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:56:13,975 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:13,975 INFO L791 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 389#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; 399#L28-3 [2021-12-22 19:56:13,975 INFO L793 eck$LassoCheckResult]: Loop: 399#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 394#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); 391#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#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; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#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; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#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; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#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; 393#recFINAL assume true; 396#recEXIT >#31#return; 397#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 400#recFINAL assume true; 407#recEXIT >#31#return; 406#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 405#recFINAL assume true; 404#recEXIT >#31#return; 402#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 403#recFINAL assume true; 401#recEXIT >#33#return; 398#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; 399#L28-3 [2021-12-22 19:56:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2021-12-22 19:56:13,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:13,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063954886] [2021-12-22 19:56:13,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:13,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:13,986 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:13,996 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2021-12-22 19:56:13,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:13,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945433794] [2021-12-22 19:56:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:13,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:14,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:14,039 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2021-12-22 19:56:14,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:14,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097748773] [2021-12-22 19:56:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:14,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:14,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:14,107 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:16,832 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 19:56:16,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 19:56:16,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 19:56:16,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 19:56:16,834 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 19:56:16,834 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:16,834 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 19:56:16,834 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 19:56:16,834 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2021-12-22 19:56:16,835 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 19:56:16,835 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 19:56:16,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:17,412 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 19:56:17,415 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 19:56:17,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:17,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:17,418 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) [2021-12-22 19:56:17,418 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 [2021-12-22 19:56:17,420 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 [2021-12-22 19:56:17,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:17,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:17,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:17,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:17,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:56:17,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:56:17,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:17,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:17,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:17,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:17,466 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) [2021-12-22 19:56:17,467 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 [2021-12-22 19:56:17,468 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 [2021-12-22 19:56:17,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:17,475 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2021-12-22 19:56:17,475 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2021-12-22 19:56:17,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:17,568 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2021-12-22 19:56:17,569 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2021-12-22 19:56:17,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:17,710 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 [2021-12-22 19:56:17,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:17,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:17,712 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) [2021-12-22 19:56:17,713 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 [2021-12-22 19:56:17,714 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 [2021-12-22 19:56:17,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:17,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:17,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:17,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:17,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:56:17,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:56:17,738 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 19:56:17,755 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-22 19:56:17,755 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-22 19:56:17,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:17,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:17,757 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) [2021-12-22 19:56:17,758 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 [2021-12-22 19:56:17,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 19:56:17,788 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 19:56:17,788 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 19:56:17,789 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 [] [2021-12-22 19:56:17,823 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 [2021-12-22 19:56:17,843 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-12-22 19:56:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:17,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 19:56:17,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:17,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-22 19:56:17,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:17,982 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-22 19:56:17,983 INFO L387 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 61 [2021-12-22 19:56:17,992 INFO L387 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 [2021-12-22 19:56:18,006 INFO L387 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 [2021-12-22 19:56:18,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:18,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-22 19:56:18,030 INFO L387 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 9 treesize of output 7 [2021-12-22 19:56:18,045 INFO L387 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 21 treesize of output 13 [2021-12-22 19:56:18,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:18,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:18,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:18,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:18,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:18,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:18,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:18,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:18,635 INFO L353 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2021-12-22 19:56:18,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 45 [2021-12-22 19:56:18,679 INFO L353 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2021-12-22 19:56:18,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 80 [2021-12-22 19:56:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 19 refuted. 4 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-22 19:56:18,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2021-12-22 19:56:18,730 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-22 19:56:18,774 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 28 states and 32 transitions. Complement of second has 9 states. [2021-12-22 19:56:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-22 19:56:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-22 19:56:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2021-12-22 19:56:18,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-22 19:56:18,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:18,777 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-22 19:56:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:18,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 19:56:18,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:18,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-22 19:56:18,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:18,895 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-22 19:56:18,896 INFO L387 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 61 [2021-12-22 19:56:18,899 INFO L387 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 8 treesize of output 7 [2021-12-22 19:56:18,903 INFO L387 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 23 treesize of output 18 [2021-12-22 19:56:18,921 INFO L387 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 11 treesize of output 7 [2021-12-22 19:56:18,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-12-22 19:56:18,937 INFO L387 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 [2021-12-22 19:56:19,184 INFO L387 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 [2021-12-22 19:56:19,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:19,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-22 19:56:19,451 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 19:56:19,452 INFO L387 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 18 [2021-12-22 19:56:19,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:19,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:19,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:19,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:19,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:19,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:19,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:19,833 INFO L353 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2021-12-22 19:56:19,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 45 [2021-12-22 19:56:19,881 INFO L353 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2021-12-22 19:56:19,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 80 [2021-12-22 19:56:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 21 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-22 19:56:19,983 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 18 loop predicates [2021-12-22 19:56:19,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-22 19:56:20,032 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 29 states and 33 transitions. Complement of second has 11 states. [2021-12-22 19:56:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-22 19:56:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-22 19:56:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2021-12-22 19:56:20,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-22 19:56:20,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:20,034 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-22 19:56:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:20,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 19:56:20,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:20,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-22 19:56:20,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:20,150 INFO L353 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2021-12-22 19:56:20,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 66 [2021-12-22 19:56:20,173 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-12-22 19:56:20,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 74 [2021-12-22 19:56:20,180 INFO L387 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 8 treesize of output 7 [2021-12-22 19:56:20,196 INFO L387 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 21 treesize of output 17 [2021-12-22 19:56:20,221 INFO L387 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 44 treesize of output 37 [2021-12-22 19:56:20,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-12-22 19:56:20,261 INFO L387 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 9 treesize of output 7 [2021-12-22 19:56:20,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-22 19:56:20,319 INFO L387 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 [2021-12-22 19:56:20,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:20,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:20,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:20,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:20,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:20,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:20,973 INFO L353 Elim1Store]: treesize reduction 41, result has 34.9 percent of original size [2021-12-22 19:56:20,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 75 [2021-12-22 19:56:21,033 INFO L353 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2021-12-22 19:56:21,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 150 [2021-12-22 19:56:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 2 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-22 19:56:21,127 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates [2021-12-22 19:56:21,127 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-22 19:56:21,168 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 28 states and 32 transitions. Complement of second has 9 states. [2021-12-22 19:56:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-22 19:56:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-22 19:56:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2021-12-22 19:56:21,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-22 19:56:21,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:21,171 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-22 19:56:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:21,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 19:56:21,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:21,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-22 19:56:21,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:21,294 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-22 19:56:21,295 INFO L387 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 61 [2021-12-22 19:56:21,301 INFO L387 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 8 treesize of output 7 [2021-12-22 19:56:21,307 INFO L387 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 23 treesize of output 18 [2021-12-22 19:56:21,322 INFO L387 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 11 treesize of output 7 [2021-12-22 19:56:21,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-12-22 19:56:21,347 INFO L387 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 [2021-12-22 19:56:21,586 INFO L387 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 [2021-12-22 19:56:21,665 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 19:56:21,665 INFO L387 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 18 [2021-12-22 19:56:21,941 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 19:56:21,941 INFO L387 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 16 treesize of output 22 [2021-12-22 19:56:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:22,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:22,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:22,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:22,557 INFO L353 Elim1Store]: treesize reduction 53, result has 47.5 percent of original size [2021-12-22 19:56:22,558 INFO L387 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 29 treesize of output 65 [2021-12-22 19:56:22,594 INFO L353 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2021-12-22 19:56:22,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 45 [2021-12-22 19:56:22,605 INFO L387 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 7 treesize of output 5 [2021-12-22 19:56:22,649 INFO L387 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 5 treesize of output 3 [2021-12-22 19:56:22,698 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 19:56:22,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2021-12-22 19:56:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 19:56:22,981 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 19 loop predicates [2021-12-22 19:56:22,981 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-22 19:56:23,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 29 states and 33 transitions. Complement of second has 11 states. [2021-12-22 19:56:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-22 19:56:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-22 19:56:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2021-12-22 19:56:23,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-22 19:56:23,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:23,031 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-22 19:56:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:23,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 19:56:23,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:23,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-22 19:56:23,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:23,133 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2021-12-22 19:56:23,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 69 [2021-12-22 19:56:23,157 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-12-22 19:56:23,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2021-12-22 19:56:23,164 INFO L387 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 8 treesize of output 7 [2021-12-22 19:56:23,175 INFO L387 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 17 treesize of output 15 [2021-12-22 19:56:23,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-12-22 19:56:23,319 INFO L387 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 12 treesize of output 10 [2021-12-22 19:56:23,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2021-12-22 19:56:23,347 INFO L387 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 18 treesize of output 14 [2021-12-22 19:56:23,370 INFO L387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2021-12-22 19:56:23,659 INFO L387 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 [2021-12-22 19:56:23,736 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 19:56:23,736 INFO L387 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 18 [2021-12-22 19:56:23,974 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 19:56:23,974 INFO L387 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 16 treesize of output 22 [2021-12-22 19:56:24,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:24,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:24,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:24,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:56:24,521 INFO L353 Elim1Store]: treesize reduction 53, result has 47.5 percent of original size [2021-12-22 19:56:24,522 INFO L387 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 51 treesize of output 83 [2021-12-22 19:56:24,551 INFO L353 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2021-12-22 19:56:24,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 45 [2021-12-22 19:56:24,573 INFO L387 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 7 treesize of output 5 [2021-12-22 19:56:24,647 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 19:56:24,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2021-12-22 19:56:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 24 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 19:56:24,846 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 19 loop predicates [2021-12-22 19:56:24,847 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-22 19:56:24,962 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 109 states and 139 transitions. Complement of second has 58 states 11 powerset states47 rank states. The highest rank that occured is 7 [2021-12-22 19:56:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2021-12-22 19:56:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-22 19:56:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2021-12-22 19:56:24,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-22 19:56:24,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:24,966 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-22 19:56:24,967 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) 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) [2021-12-22 19:56:24,968 INFO L158 Benchmark]: Toolchain (without parser) took 14709.98ms. Allocated memory was 83.9MB in the beginning and 195.0MB in the end (delta: 111.1MB). Free memory was 53.1MB in the beginning and 70.9MB in the end (delta: -17.7MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2021-12-22 19:56:24,968 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 43.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:56:24,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.95ms. Allocated memory is still 83.9MB. Free memory was 53.0MB in the beginning and 61.2MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 19:56:24,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.98ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 59.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:56:24,969 INFO L158 Benchmark]: Boogie Preprocessor took 32.37ms. Allocated memory is still 83.9MB. Free memory was 59.6MB in the beginning and 58.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:56:24,969 INFO L158 Benchmark]: RCFGBuilder took 301.00ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 47.9MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 19:56:24,969 INFO L158 Benchmark]: BuchiAutomizer took 14173.17ms. Allocated memory was 83.9MB in the beginning and 195.0MB in the end (delta: 111.1MB). Free memory was 47.9MB in the beginning and 70.9MB in the end (delta: -23.0MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. [2021-12-22 19:56:24,970 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 43.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.95ms. Allocated memory is still 83.9MB. Free memory was 53.0MB in the beginning and 61.2MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.98ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 59.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.37ms. Allocated memory is still 83.9MB. Free memory was 59.6MB in the beginning and 58.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.00ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 47.9MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 14173.17ms. Allocated memory was 83.9MB in the beginning and 195.0MB in the end (delta: 111.1MB). Free memory was 47.9MB in the beginning and 70.9MB in the end (delta: -23.0MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-22 19:56:24,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:25,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-22 19:56:25,406 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 settings was sufficient