./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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/reducercommutativity/sum.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c788c1819bdb49f70cf486a187bd014d3d2cd0616eddb169336e33d9a4226f9c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:51:31,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:51:31,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:51:31,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:51:31,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:51:31,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:51:31,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:51:31,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:51:31,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:51:31,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:51:31,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:51:31,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:51:31,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:51:31,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:51:31,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:51:31,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:51:31,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:51:31,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:51:31,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:51:31,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:51:31,742 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:51:31,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:51:31,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:51:31,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:51:31,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:51:31,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:51:31,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:51:31,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:51:31,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:51:31,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:51:31,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:51:31,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:51:31,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:51:31,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:51:31,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:51:31,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:51:31,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:51:31,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:51:31,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:51:31,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:51:31,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:51:31,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:51:31,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:51:31,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:51:31,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:51:31,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:51:31,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:51:31,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:51:31,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:51:31,789 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:51:31,789 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:51:31,789 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:51:31,790 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:51:31,790 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:51:31,790 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:51:31,790 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:51:31,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:51:31,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:51:31,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:51:31,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:51:31,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:51:31,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:51:31,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:51:31,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:51:31,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:51:31,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:51:31,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:51:31,793 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:51:31,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:51:31,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:51:31,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:51:31,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:51:31,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:51:31,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:51:31,795 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:51:31,795 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c788c1819bdb49f70cf486a187bd014d3d2cd0616eddb169336e33d9a4226f9c [2022-07-13 04:51:31,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:51:32,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:51:32,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:51:32,018 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:51:32,018 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:51:32,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum.i [2022-07-13 04:51:32,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3d3717d/b7b39809dd3d42c88b3f0ba1e1a84894/FLAG7f96e518b [2022-07-13 04:51:32,413 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:51:32,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum.i [2022-07-13 04:51:32,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3d3717d/b7b39809dd3d42c88b3f0ba1e1a84894/FLAG7f96e518b [2022-07-13 04:51:32,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3d3717d/b7b39809dd3d42c88b3f0ba1e1a84894 [2022-07-13 04:51:32,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:51:32,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:51:32,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:51:32,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:51:32,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:51:32,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c44262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32, skipping insertion in model container [2022-07-13 04:51:32,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:51:32,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:51:32,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum.i[1282,1295] [2022-07-13 04:51:32,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:51:32,558 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:51:32,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum.i[1282,1295] [2022-07-13 04:51:32,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:51:32,591 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:51:32,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32 WrapperNode [2022-07-13 04:51:32,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:51:32,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:51:32,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:51:32,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:51:32,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,617 INFO L137 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2022-07-13 04:51:32,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:51:32,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:51:32,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:51:32,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:51:32,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:51:32,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:51:32,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:51:32,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:51:32,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (1/1) ... [2022-07-13 04:51:32,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:32,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:32,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:32,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 04:51:32,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:51:32,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:51:32,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:51:32,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:51:32,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:51:32,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:51:32,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:51:32,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:51:32,771 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:51:32,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:51:32,892 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:51:32,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:51:32,896 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:51:32,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:51:32 BoogieIcfgContainer [2022-07-13 04:51:32,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:51:32,899 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:51:32,899 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:51:32,901 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:51:32,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:32,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:51:32" (1/3) ... [2022-07-13 04:51:32,902 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@404acacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:51:32, skipping insertion in model container [2022-07-13 04:51:32,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:32,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:32" (2/3) ... [2022-07-13 04:51:32,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@404acacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:51:32, skipping insertion in model container [2022-07-13 04:51:32,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:32,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:51:32" (3/3) ... [2022-07-13 04:51:32,904 INFO L354 chiAutomizerObserver]: Analyzing ICFG sum.i [2022-07-13 04:51:32,945 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:51:32,945 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:51:32,945 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:51:32,945 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:51:32,945 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:51:32,946 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:51:32,946 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:51:32,946 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:51:32,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:32,977 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 04:51:32,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:32,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:32,981 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 04:51:32,981 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:32,981 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:51:32,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:32,983 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-13 04:51:32,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:32,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:32,983 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 04:51:32,983 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:32,988 INFO L752 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;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(117, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 13#L31true assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 21#L22-3true [2022-07-13 04:51:32,988 INFO L754 eck$LassoCheckResult]: Loop: 21#L22-3true assume !!(sum_~i~0#1 < ~N~0);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 16#L22-2true sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 21#L22-3true [2022-07-13 04:51:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-13 04:51:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:32,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168938347] [2022-07-13 04:51:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:33,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:33,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2022-07-13 04:51:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:33,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851675675] [2022-07-13 04:51:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:33,163 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:33,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2022-07-13 04:51:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:33,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517651586] [2022-07-13 04:51:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:33,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:33,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:33,638 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:51:33,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:51:33,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:51:33,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:51:33,640 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:51:33,640 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:33,640 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:51:33,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:51:33,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration1_Lasso [2022-07-13 04:51:33,640 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:51:33,640 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:51:33,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:33,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:34,242 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:51:34,244 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:51:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:34,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:34,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:34,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 04:51:34,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 04:51:34,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:34,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:34,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:34,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,361 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 04:51:34,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:34,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:34,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:34,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,393 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 [2022-07-13 04:51:34,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 04:51:34,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:34,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:34,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:34,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:51:34,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:34,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:34,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:34,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:51:34,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,533 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 [2022-07-13 04:51:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,534 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:51:34,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-13 04:51:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,577 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:51:34,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 04:51:34,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,673 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 04:51:34,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,721 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 04:51:34,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,754 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 04:51:34,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-13 04:51:34,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,798 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 04:51:34,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,845 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 04:51:34,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,876 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 04:51:34,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:34,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:34,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:34,907 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:34,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 04:51:34,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:34,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:34,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:34,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:34,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:34,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:34,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:34,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:51:34,984 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-13 04:51:34,984 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-07-13 04:51:34,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:34,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:35,012 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:35,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:51:35,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 04:51:35,072 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:51:35,072 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:51:35,072 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sum_~i~0#1) = 1*~N~0 - 1*ULTIMATE.start_sum_~i~0#1 Supporting invariants [] [2022-07-13 04:51:35,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:35,127 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-13 04:51:35,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:35,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:51:35,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:35,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:51:35,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:35,230 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 04:51:35,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:35,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 69 transitions. Complement of second has 8 states. [2022-07-13 04:51:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:51:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-07-13 04:51:35,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-13 04:51:35,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:35,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 04:51:35,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:35,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-13 04:51:35,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:35,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2022-07-13 04:51:35,291 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-13 04:51:35,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2022-07-13 04:51:35,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 04:51:35,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 04:51:35,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2022-07-13 04:51:35,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:35,296 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-13 04:51:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2022-07-13 04:51:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 04:51:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-07-13 04:51:35,315 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-13 04:51:35,315 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-13 04:51:35,316 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:51:35,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-07-13 04:51:35,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-13 04:51:35,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:35,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:35,317 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:51:35,317 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:35,318 INFO L752 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(117, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 174#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 175#L22-3 assume !(sum_~i~0#1 < ~N~0); 176#L22-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 171#L25 main_#t~ret4#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;call main_#t~mem5#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem6#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem6#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 170#L22-8 [2022-07-13 04:51:35,318 INFO L754 eck$LassoCheckResult]: Loop: 170#L22-8 assume !!(sum_~i~0#1 < ~N~0);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 169#L22-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 170#L22-8 [2022-07-13 04:51:35,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2022-07-13 04:51:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:35,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28829078] [2022-07-13 04:51:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:35,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:51:35,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28829078] [2022-07-13 04:51:35,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28829078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:51:35,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:51:35,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:51:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730618119] [2022-07-13 04:51:35,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:51:35,390 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:51:35,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2022-07-13 04:51:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:35,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046075697] [2022-07-13 04:51:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:35,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:51:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:51:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:51:35,438 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:35,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-13 04:51:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:51:35,489 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-07-13 04:51:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:51:35,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2022-07-13 04:51:35,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-13 04:51:35,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2022-07-13 04:51:35,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 04:51:35,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 04:51:35,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2022-07-13 04:51:35,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:35,491 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-13 04:51:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2022-07-13 04:51:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-13 04:51:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-13 04:51:35,493 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 04:51:35,493 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 04:51:35,493 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:51:35,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-07-13 04:51:35,493 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-13 04:51:35,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:35,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:35,494 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:35,494 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:35,494 INFO L752 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(117, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 206#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 215#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 216#L22-3 assume !!(sum_~i~0#1 < ~N~0);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 218#L22-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 219#L22-3 assume !(sum_~i~0#1 < ~N~0); 217#L22-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 210#L25 main_#t~ret4#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;call main_#t~mem5#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem6#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem6#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 211#L22-8 [2022-07-13 04:51:35,494 INFO L754 eck$LassoCheckResult]: Loop: 211#L22-8 assume !!(sum_~i~0#1 < ~N~0);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 212#L22-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 211#L22-8 [2022-07-13 04:51:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2022-07-13 04:51:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:35,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374293153] [2022-07-13 04:51:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:35,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:51:35,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374293153] [2022-07-13 04:51:35,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374293153] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:51:35,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139451625] [2022-07-13 04:51:35,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:35,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:51:35,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:35,530 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:51:35,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 04:51:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:35,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:51:35,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:35,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:51:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:35,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139451625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:51:35,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:51:35,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 04:51:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530859692] [2022-07-13 04:51:35,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:51:35,635 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:51:35,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2022-07-13 04:51:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:35,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701168904] [2022-07-13 04:51:35,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:35,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:51:35,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:51:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:51:35,679 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:51:35,710 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-07-13 04:51:35,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:51:35,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2022-07-13 04:51:35,712 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-13 04:51:35,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 04:51:35,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 04:51:35,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 04:51:35,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2022-07-13 04:51:35,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:35,713 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 04:51:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2022-07-13 04:51:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-13 04:51:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-13 04:51:35,716 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-13 04:51:35,716 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-13 04:51:35,716 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:51:35,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2022-07-13 04:51:35,717 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-13 04:51:35,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:35,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:35,718 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:35,718 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:35,718 INFO L752 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(117, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 295#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 304#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 305#L22-3 assume !!(sum_~i~0#1 < ~N~0);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 307#L22-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 308#L22-3 assume !!(sum_~i~0#1 < ~N~0);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 309#L22-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 310#L22-3 assume !(sum_~i~0#1 < ~N~0); 306#L22-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 299#L25 main_#t~ret4#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret4#1;havoc main_#t~ret4#1;call main_#t~mem5#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem6#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem6#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 300#L22-8 [2022-07-13 04:51:35,718 INFO L754 eck$LassoCheckResult]: Loop: 300#L22-8 assume !!(sum_~i~0#1 < ~N~0);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 301#L22-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 300#L22-8 [2022-07-13 04:51:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2022-07-13 04:51:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:35,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169120524] [2022-07-13 04:51:35,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2022-07-13 04:51:35,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:35,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731978255] [2022-07-13 04:51:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:35,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2022-07-13 04:51:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:35,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479312524] [2022-07-13 04:51:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:35,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:36,326 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:51:36,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:51:36,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:51:36,326 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:51:36,326 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:51:36,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:36,327 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:51:36,327 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:51:36,327 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration4_Lasso [2022-07-13 04:51:36,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:51:36,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:51:36,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:36,467 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 04:51:36,470 INFO L158 Benchmark]: Toolchain (without parser) took 4041.38ms. Allocated memory was 73.4MB in the beginning and 111.1MB in the end (delta: 37.7MB). Free memory was 35.9MB in the beginning and 36.5MB in the end (delta: -590.4kB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-07-13 04:51:36,470 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:51:36,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.50ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 35.7MB in the beginning and 70.3MB in the end (delta: -34.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2022-07-13 04:51:36,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.78ms. Allocated memory is still 92.3MB. Free memory was 70.3MB in the beginning and 68.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:51:36,472 INFO L158 Benchmark]: Boogie Preprocessor took 16.88ms. Allocated memory is still 92.3MB. Free memory was 68.6MB in the beginning and 67.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:51:36,472 INFO L158 Benchmark]: RCFGBuilder took 262.05ms. Allocated memory is still 92.3MB. Free memory was 67.3MB in the beginning and 55.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 04:51:36,473 INFO L158 Benchmark]: BuchiAutomizer took 3570.71ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.1MB in the beginning and 36.5MB in the end (delta: 18.6MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-07-13 04:51:36,474 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.14ms. Allocated memory is still 73.4MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.50ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 35.7MB in the beginning and 70.3MB in the end (delta: -34.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.78ms. Allocated memory is still 92.3MB. Free memory was 70.3MB in the beginning and 68.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.88ms. Allocated memory is still 92.3MB. Free memory was 68.6MB in the beginning and 67.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.05ms. Allocated memory is still 92.3MB. Free memory was 67.3MB in the beginning and 55.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3570.71ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.1MB in the beginning and 36.5MB in the end (delta: 18.6MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:51:36,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:36,704 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null