./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/rangesum05.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 aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 03:11:20,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 03:11:20,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 03:11:20,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 03:11:20,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 03:11:20,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 03:11:20,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 03:11:20,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 03:11:20,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 03:11:20,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 03:11:20,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 03:11:20,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 03:11:20,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 03:11:20,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 03:11:20,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 03:11:20,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 03:11:20,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 03:11:20,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 03:11:20,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 03:11:20,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 03:11:20,280 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 03:11:20,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 03:11:20,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 03:11:20,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 03:11:20,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 03:11:20,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 03:11:20,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 03:11:20,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 03:11:20,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 03:11:20,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 03:11:20,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 03:11:20,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 03:11:20,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 03:11:20,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 03:11:20,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 03:11:20,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 03:11:20,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 03:11:20,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 03:11:20,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 03:11:20,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 03:11:20,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 03:11:20,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 03:11:20,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 03:11:20,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 03:11:20,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 03:11:20,360 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 03:11:20,360 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 03:11:20,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 03:11:20,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 03:11:20,363 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 03:11:20,363 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 03:11:20,364 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 03:11:20,365 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 03:11:20,365 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 03:11:20,365 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 03:11:20,365 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 03:11:20,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 03:11:20,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 03:11:20,366 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 03:11:20,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 03:11:20,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 03:11:20,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 03:11:20,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 03:11:20,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 03:11:20,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 03:11:20,367 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 03:11:20,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 03:11:20,368 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 03:11:20,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 03:11:20,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 03:11:20,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 03:11:20,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 03:11:20,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 03:11:20,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 03:11:20,372 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 03:11:20,372 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 -> aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 [2022-07-22 03:11:20,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 03:11:20,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 03:11:20,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 03:11:20,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 03:11:20,736 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 03:11:20,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum05.i [2022-07-22 03:11:20,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57af1cc67/27f57da5c2374033a6c8719a66f63ab9/FLAG35c0da59d [2022-07-22 03:11:21,250 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 03:11:21,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i [2022-07-22 03:11:21,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57af1cc67/27f57da5c2374033a6c8719a66f63ab9/FLAG35c0da59d [2022-07-22 03:11:21,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57af1cc67/27f57da5c2374033a6c8719a66f63ab9 [2022-07-22 03:11:21,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 03:11:21,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 03:11:21,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 03:11:21,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 03:11:21,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 03:11:21,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9b0a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21, skipping insertion in model container [2022-07-22 03:11:21,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 03:11:21,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 03:11:21,518 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/rangesum05.i[1457,1470] [2022-07-22 03:11:21,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:11:21,529 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 03:11:21,586 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/rangesum05.i[1457,1470] [2022-07-22 03:11:21,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:11:21,615 INFO L208 MainTranslator]: Completed translation [2022-07-22 03:11:21,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21 WrapperNode [2022-07-22 03:11:21,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 03:11:21,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 03:11:21,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 03:11:21,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 03:11:21,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,670 INFO L137 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2022-07-22 03:11:21,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 03:11:21,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 03:11:21,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 03:11:21,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 03:11:21,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 03:11:21,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 03:11:21,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 03:11:21,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 03:11:21,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (1/1) ... [2022-07-22 03:11:21,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:21,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:21,761 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-22 03:11:21,779 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-22 03:11:21,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 03:11:21,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 03:11:21,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 03:11:21,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 03:11:21,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 03:11:21,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 03:11:21,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 03:11:21,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 03:11:21,904 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 03:11:21,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 03:11:22,149 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 03:11:22,156 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 03:11:22,156 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 03:11:22,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:11:22 BoogieIcfgContainer [2022-07-22 03:11:22,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 03:11:22,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 03:11:22,179 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 03:11:22,182 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 03:11:22,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:11:22,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 03:11:21" (1/3) ... [2022-07-22 03:11:22,185 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@347ee653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:11:22, skipping insertion in model container [2022-07-22 03:11:22,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:11:22,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:11:21" (2/3) ... [2022-07-22 03:11:22,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@347ee653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:11:22, skipping insertion in model container [2022-07-22 03:11:22,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:11:22,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:11:22" (3/3) ... [2022-07-22 03:11:22,188 INFO L354 chiAutomizerObserver]: Analyzing ICFG rangesum05.i [2022-07-22 03:11:22,253 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 03:11:22,253 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 03:11:22,253 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 03:11:22,254 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 03:11:22,254 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 03:11:22,254 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 03:11:22,254 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 03:11:22,255 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 03:11:22,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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-22 03:11:22,284 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2022-07-22 03:11:22,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:22,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:22,290 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:11:22,290 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:11:22,290 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 03:11:22,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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-22 03:11:22,295 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2022-07-22 03:11:22,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:22,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:22,296 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:11:22,297 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:11:22,305 INFO L752 eck$LassoCheckResult]: Stem: 15#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(13, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 21#L17-3true [2022-07-22 03:11:22,306 INFO L754 eck$LassoCheckResult]: Loop: 21#L17-3true assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 10#L17-2true init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 21#L17-3true [2022-07-22 03:11:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 03:11:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:22,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981992060] [2022-07-22 03:11:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:22,430 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:22,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-22 03:11:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:22,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681508948] [2022-07-22 03:11:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:22,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:22,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:22,512 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-22 03:11:22,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:22,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858524620] [2022-07-22 03:11:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:22,544 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:22,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:22,966 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:11:22,967 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:11:22,967 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:11:22,967 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:11:22,967 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:11:22,968 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:22,968 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:11:22,968 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:11:22,969 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration1_Lasso [2022-07-22 03:11:22,969 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:11:22,969 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:11:22,997 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-22 03:11:23,003 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-22 03:11:23,006 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-22 03:11:23,008 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-22 03:11:23,012 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-22 03:11:23,262 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-22 03:11:23,265 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-22 03:11:23,268 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-22 03:11:23,270 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-22 03:11:23,273 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-22 03:11:23,275 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-22 03:11:23,278 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-22 03:11:23,280 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-22 03:11:23,282 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-22 03:11:23,284 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-22 03:11:23,286 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-22 03:11:23,289 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-22 03:11:23,294 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-22 03:11:23,591 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:11:23,594 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:11:23,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:23,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:23,598 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-22 03:11:23,605 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-22 03:11:23,606 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-22 03:11:23,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:23,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:23,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:23,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:23,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:23,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:23,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:23,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:23,664 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-22 03:11:23,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:23,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:23,667 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-22 03:11:23,678 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-22 03:11:23,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:23,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:23,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:23,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:23,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:23,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:23,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:23,688 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-22 03:11:23,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:23,730 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-22 03:11:23,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:23,732 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-22 03:11:23,733 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-22 03:11:23,740 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-22 03:11:23,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:23,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:23,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:23,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:23,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:23,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:23,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:23,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:23,784 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-22 03:11:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:23,786 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-22 03:11:23,787 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-22 03:11:23,788 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-22 03:11:23,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:23,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:23,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:23,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:23,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:23,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:23,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:23,843 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-22 03:11:23,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:23,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:23,845 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-22 03:11:23,856 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-22 03:11:23,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:23,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:23,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:23,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:23,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:23,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:23,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:23,867 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-22 03:11:23,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:23,899 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-22 03:11:23,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:23,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:23,901 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-22 03:11:23,902 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-22 03:11:23,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:11:23,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:23,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:23,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:23,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:23,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:23,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:23,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:23,963 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-22 03:11:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:23,965 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-22 03:11:23,974 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-22 03:11:23,975 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-22 03:11:23,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:23,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:23,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:23,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:23,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:23,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:23,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:23,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:24,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:24,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:24,026 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-22 03:11:24,033 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-22 03:11:24,034 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-22 03:11:24,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:24,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:24,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:24,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:24,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:24,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:24,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:24,103 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-22 03:11:24,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:24,106 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-22 03:11:24,114 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-22 03:11:24,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:24,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:24,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:24,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:24,127 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-22 03:11:24,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:24,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:24,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:11:24,218 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 03:11:24,218 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-07-22 03:11:24,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:24,222 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-22 03:11:24,226 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-22 03:11:24,226 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:11:24,248 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:11:24,248 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:11:24,249 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_init_nondet_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_init_nondet_~i~0#1 Supporting invariants [] [2022-07-22 03:11:24,276 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-22 03:11:24,298 INFO L293 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-07-22 03:11:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:24,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 03:11:24,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:24,358 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 03:11:24,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:24,389 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-22 03:11:24,415 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-22 03:11:24,417 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-22 03:11:24,503 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-22 03:11:24,560 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 75 states and 119 transitions. Complement of second has 8 states. [2022-07-22 03:11:24,561 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-22 03:11:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-22 03:11:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-07-22 03:11:24,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 03:11:24,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:24,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 03:11:24,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:24,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-22 03:11:24,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:24,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2022-07-22 03:11:24,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:24,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 32 transitions. [2022-07-22 03:11:24,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 03:11:24,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:11:24,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2022-07-22 03:11:24,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:11:24,591 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-07-22 03:11:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2022-07-22 03:11:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 03:11:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 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-22 03:11:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-07-22 03:11:24,616 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-07-22 03:11:24,616 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-07-22 03:11:24,616 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 03:11:24,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2022-07-22 03:11:24,618 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:24,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:24,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:24,618 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 03:11:24,618 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:24,619 INFO L752 eck$LassoCheckResult]: Stem: 184#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(13, 2); 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 196#L17-3 assume !(init_nondet_~i~0#1 < 5); 191#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 192#L28-3 [2022-07-22 03:11:24,619 INFO L754 eck$LassoCheckResult]: Loop: 192#L28-3 assume !!(rangesum_~i~1#1 < 5); 193#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 194#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 192#L28-3 [2022-07-22 03:11:24,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-22 03:11:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:24,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620005892] [2022-07-22 03:11:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:24,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:24,662 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-22 03:11:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:24,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620005892] [2022-07-22 03:11:24,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620005892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:11:24,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:11:24,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 03:11:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484290945] [2022-07-22 03:11:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:11:24,666 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:11:24,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:24,667 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2022-07-22 03:11:24,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:24,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985707119] [2022-07-22 03:11:24,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:24,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:24,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:24,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 03:11:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 03:11:24,730 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-22 03:11:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:24,744 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2022-07-22 03:11:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 03:11:24,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2022-07-22 03:11:24,746 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:24,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2022-07-22 03:11:24,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:11:24,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:11:24,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2022-07-22 03:11:24,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:11:24,747 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2022-07-22 03:11:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2022-07-22 03:11:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-22 03:11:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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-22 03:11:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2022-07-22 03:11:24,750 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-07-22 03:11:24,750 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-07-22 03:11:24,750 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 03:11:24,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-07-22 03:11:24,750 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:24,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:24,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:24,751 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 03:11:24,751 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:24,751 INFO L752 eck$LassoCheckResult]: Stem: 235#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(13, 2); 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 248#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 249#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 250#L17-3 assume !(init_nondet_~i~0#1 < 5); 242#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 243#L28-3 [2022-07-22 03:11:24,752 INFO L754 eck$LassoCheckResult]: Loop: 243#L28-3 assume !!(rangesum_~i~1#1 < 5); 244#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 245#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 243#L28-3 [2022-07-22 03:11:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-22 03:11:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:24,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295142920] [2022-07-22 03:11:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:24,779 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-22 03:11:24,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:24,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295142920] [2022-07-22 03:11:24,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295142920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:11:24,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349275290] [2022-07-22 03:11:24,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:24,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:24,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:24,782 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:24,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 03:11:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:24,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 03:11:24,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:24,840 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-22 03:11:24,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:11:24,865 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-22 03:11:24,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349275290] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:11:24,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 03:11:24,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-22 03:11:24,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253777843] [2022-07-22 03:11:24,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 03:11:24,870 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:11:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2022-07-22 03:11:24,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:24,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838016166] [2022-07-22 03:11:24,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:24,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:24,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:24,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 03:11:24,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 03:11:24,934 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-22 03:11:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:24,962 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-07-22 03:11:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 03:11:24,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2022-07-22 03:11:24,964 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:24,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 37 transitions. [2022-07-22 03:11:24,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:11:24,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:11:24,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-07-22 03:11:24,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:11:24,966 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-07-22 03:11:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-07-22 03:11:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-22 03:11:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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-22 03:11:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-07-22 03:11:24,968 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-07-22 03:11:24,968 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-07-22 03:11:24,968 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 03:11:24,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2022-07-22 03:11:24,969 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:24,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:24,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:24,970 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-22 03:11:24,970 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:24,970 INFO L752 eck$LassoCheckResult]: Stem: 325#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(13, 2); 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 337#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 338#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 339#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 340#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 352#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 351#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 350#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 349#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 348#L17-3 assume !(init_nondet_~i~0#1 < 5); 332#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 333#L28-3 [2022-07-22 03:11:24,970 INFO L754 eck$LassoCheckResult]: Loop: 333#L28-3 assume !!(rangesum_~i~1#1 < 5); 334#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 335#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 333#L28-3 [2022-07-22 03:11:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:24,971 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-22 03:11:24,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:24,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486939366] [2022-07-22 03:11:24,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:24,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:11:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:25,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486939366] [2022-07-22 03:11:25,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486939366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:11:25,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308407725] [2022-07-22 03:11:25,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 03:11:25,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:25,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:25,027 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:25,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 03:11:25,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 03:11:25,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 03:11:25,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 03:11:25,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:11:25,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:11:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:11:25,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308407725] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:11:25,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 03:11:25,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-22 03:11:25,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410882349] [2022-07-22 03:11:25,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 03:11:25,150 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:11:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2022-07-22 03:11:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623074539] [2022-07-22 03:11:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:25,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 03:11:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-22 03:11:25,234 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-22 03:11:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:25,255 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-07-22 03:11:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 03:11:25,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2022-07-22 03:11:25,257 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:25,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2022-07-22 03:11:25,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:11:25,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:11:25,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2022-07-22 03:11:25,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:11:25,258 INFO L369 hiAutomatonCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-07-22 03:11:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2022-07-22 03:11:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 03:11:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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-22 03:11:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-07-22 03:11:25,261 INFO L392 hiAutomatonCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-07-22 03:11:25,261 INFO L374 stractBuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-07-22 03:11:25,261 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 03:11:25,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2022-07-22 03:11:25,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:25,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:25,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:25,262 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2022-07-22 03:11:25,262 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:25,262 INFO L752 eck$LassoCheckResult]: Stem: 460#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(13, 2); 461#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 473#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 474#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 475#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 476#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 489#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 488#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 487#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 486#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 485#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 484#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 483#L17-3 assume !(init_nondet_~i~0#1 < 5); 467#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 468#L28-3 [2022-07-22 03:11:25,262 INFO L754 eck$LassoCheckResult]: Loop: 468#L28-3 assume !!(rangesum_~i~1#1 < 5); 469#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 470#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 468#L28-3 [2022-07-22 03:11:25,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2022-07-22 03:11:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083322658] [2022-07-22 03:11:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,279 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2022-07-22 03:11:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726831979] [2022-07-22 03:11:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2022-07-22 03:11:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130509919] [2022-07-22 03:11:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 03:11:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:25,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130509919] [2022-07-22 03:11:25,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130509919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:11:25,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:11:25,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 03:11:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947477303] [2022-07-22 03:11:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:11:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:25,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 03:11:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 03:11:25,396 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-22 03:11:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:25,438 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-07-22 03:11:25,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 03:11:25,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2022-07-22 03:11:25,440 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:25,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2022-07-22 03:11:25,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-22 03:11:25,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 03:11:25,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2022-07-22 03:11:25,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:11:25,441 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-22 03:11:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2022-07-22 03:11:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-07-22 03:11:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.25) internal successors, (45), 35 states have internal predecessors, (45), 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-22 03:11:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-07-22 03:11:25,443 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-07-22 03:11:25,443 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-07-22 03:11:25,444 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 03:11:25,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2022-07-22 03:11:25,444 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:25,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:25,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:25,445 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2022-07-22 03:11:25,445 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:25,445 INFO L752 eck$LassoCheckResult]: Stem: 537#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(13, 2); 538#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 551#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 552#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 553#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 554#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 571#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 570#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 569#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 568#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 565#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 564#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 563#L17-3 assume !(init_nondet_~i~0#1 < 5); 545#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 546#L28-3 assume !!(rangesum_~i~1#1 < 5); 543#L29 assume !(rangesum_~i~1#1 > 2); 544#L28-2 [2022-07-22 03:11:25,445 INFO L754 eck$LassoCheckResult]: Loop: 544#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 547#L28-3 assume !!(rangesum_~i~1#1 < 5); 567#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 544#L28-2 [2022-07-22 03:11:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425498, now seen corresponding path program 1 times [2022-07-22 03:11:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598189922] [2022-07-22 03:11:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 5 times [2022-07-22 03:11:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634067919] [2022-07-22 03:11:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,479 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1574813624, now seen corresponding path program 1 times [2022-07-22 03:11:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080257795] [2022-07-22 03:11:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 03:11:25,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:25,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080257795] [2022-07-22 03:11:25,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080257795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:11:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674608421] [2022-07-22 03:11:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:25,540 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:25,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 03:11:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:25,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 03:11:25,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 03:11:25,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:11:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 03:11:25,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674608421] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:11:25,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 03:11:25,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-07-22 03:11:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566959033] [2022-07-22 03:11:25,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 03:11:25,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 03:11:25,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 03:11:25,683 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-22 03:11:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:25,758 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-22 03:11:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 03:11:25,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2022-07-22 03:11:25,761 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-22 03:11:25,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 66 transitions. [2022-07-22 03:11:25,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-07-22 03:11:25,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-07-22 03:11:25,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2022-07-22 03:11:25,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:11:25,765 INFO L369 hiAutomatonCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-07-22 03:11:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2022-07-22 03:11:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-07-22 03:11:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 53 states have internal predecessors, (63), 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-22 03:11:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-07-22 03:11:25,774 INFO L392 hiAutomatonCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-07-22 03:11:25,774 INFO L374 stractBuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-07-22 03:11:25,775 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 03:11:25,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2022-07-22 03:11:25,775 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:25,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:25,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:25,777 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 1, 1, 1, 1] [2022-07-22 03:11:25,777 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:25,777 INFO L752 eck$LassoCheckResult]: Stem: 749#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(13, 2); 750#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 762#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 763#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 764#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 765#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 789#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 788#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 787#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 786#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 785#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 779#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 778#L17-3 assume !(init_nondet_~i~0#1 < 5); 755#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 756#L28-3 assume !!(rangesum_~i~1#1 < 5); 757#L29 assume !(rangesum_~i~1#1 > 2); 758#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 759#L28-3 assume !!(rangesum_~i~1#1 < 5); 797#L29 assume !(rangesum_~i~1#1 > 2); 796#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 795#L28-3 assume !!(rangesum_~i~1#1 < 5); 793#L29 assume !(rangesum_~i~1#1 > 2); 784#L28-2 [2022-07-22 03:11:25,777 INFO L754 eck$LassoCheckResult]: Loop: 784#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 782#L28-3 assume !!(rangesum_~i~1#1 < 5); 783#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 784#L28-2 [2022-07-22 03:11:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1344808230, now seen corresponding path program 1 times [2022-07-22 03:11:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614123263] [2022-07-22 03:11:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 6 times [2022-07-22 03:11:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333228551] [2022-07-22 03:11:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:25,838 INFO L85 PathProgramCache]: Analyzing trace with hash 272987720, now seen corresponding path program 2 times [2022-07-22 03:11:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:25,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583774358] [2022-07-22 03:11:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:25,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:26,992 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:11:26,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:11:26,993 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:11:26,993 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:11:26,993 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:11:26,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:26,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:11:26,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:11:26,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration7_Lasso [2022-07-22 03:11:26,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:11:26,993 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:11:27,006 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-22 03:11:27,008 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-22 03:11:27,010 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-22 03:11:27,012 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-22 03:11:27,015 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-22 03:11:27,017 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-22 03:11:27,019 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-22 03:11:27,021 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-22 03:11:27,023 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-22 03:11:27,025 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-22 03:11:27,027 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-22 03:11:27,625 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-22 03:11:27,628 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-22 03:11:27,630 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-22 03:11:27,632 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-22 03:11:27,634 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-22 03:11:27,635 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-22 03:11:27,636 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-22 03:11:27,638 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-22 03:11:27,639 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-22 03:11:27,641 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-22 03:11:27,643 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-22 03:11:27,646 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-22 03:11:28,039 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:11:28,039 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:11:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,047 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-22 03:11:28,048 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-22 03:11:28,049 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-22 03:11:28,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:28,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:28,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:28,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,075 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-22 03:11:28,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,076 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-22 03:11:28,077 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-22 03:11:28,080 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-22 03:11:28,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:28,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:28,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:28,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,107 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-22 03:11:28,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,109 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-22 03:11:28,109 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-22 03:11:28,111 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-22 03:11:28,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:28,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:28,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:28,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,135 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-22 03:11:28,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,137 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-22 03:11:28,138 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-22 03:11:28,139 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-22 03:11:28,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:28,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,192 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:11:28,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 03:11:28,228 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-22 03:11:28,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:28,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:28,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:28,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-22 03:11:28,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,268 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:11:28,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 03:11:28,273 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-22 03:11:28,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:28,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:28,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:28,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:28,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,298 INFO L229 MonitoredProcess]: Starting monitored process 21 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-22 03:11:28,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 03:11:28,301 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-22 03:11:28,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:28,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:28,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:28,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-22 03:11:28,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,335 INFO L229 MonitoredProcess]: Starting monitored process 22 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-22 03:11:28,338 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-22 03:11:28,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 03:11:28,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:28,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:28,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:28,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-22 03:11:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,364 INFO L229 MonitoredProcess]: Starting monitored process 23 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-22 03:11:28,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 03:11:28,366 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-22 03:11:28,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:28,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,402 INFO L229 MonitoredProcess]: Starting monitored process 24 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-22 03:11:28,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 03:11:28,405 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-22 03:11:28,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:28,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:28,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:28,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:28,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,430 INFO L229 MonitoredProcess]: Starting monitored process 25 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-22 03:11:28,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 03:11:28,433 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-22 03:11:28,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:28,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,463 INFO L229 MonitoredProcess]: Starting monitored process 26 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-22 03:11:28,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 03:11:28,466 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-22 03:11:28,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:28,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,513 INFO L229 MonitoredProcess]: Starting monitored process 27 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-22 03:11:28,520 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-22 03:11:28,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 03:11:28,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 03:11:28,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,567 INFO L229 MonitoredProcess]: Starting monitored process 28 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-22 03:11:28,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 03:11:28,569 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-22 03:11:28,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 03:11:28,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,628 INFO L229 MonitoredProcess]: Starting monitored process 29 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-22 03:11:28,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 03:11:28,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:11:28,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 03:11:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,660 INFO L229 MonitoredProcess]: Starting monitored process 30 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-22 03:11:28,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 03:11:28,662 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-22 03:11:28,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 03:11:28,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,697 INFO L229 MonitoredProcess]: Starting monitored process 31 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-22 03:11:28,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 03:11:28,699 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-22 03:11:28,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 03:11:28,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,726 INFO L229 MonitoredProcess]: Starting monitored process 32 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-22 03:11:28,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 03:11:28,728 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-22 03:11:28,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:28,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,785 INFO L229 MonitoredProcess]: Starting monitored process 33 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-22 03:11:28,792 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-22 03:11:28,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 03:11:28,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:28,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:28,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,847 INFO L229 MonitoredProcess]: Starting monitored process 34 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-22 03:11:28,851 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-22 03:11:28,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 03:11:28,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:28,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:28,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:28,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:28,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:11:28,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:11:28,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:11:28,905 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-22 03:11:28,905 INFO L444 ModelExtractionUtils]: 5 out of 31 variables were initially zero. Simplification set additionally 23 variables to zero. [2022-07-22 03:11:28,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:28,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:28,908 INFO L229 MonitoredProcess]: Starting monitored process 35 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-22 03:11:28,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 03:11:28,910 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:11:28,917 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:11:28,917 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:11:28,917 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2, ULTIMATE.start_rangesum_~i~1#1) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 - 8*ULTIMATE.start_rangesum_~i~1#1 Supporting invariants [] [2022-07-22 03:11:28,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:29,037 INFO L293 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2022-07-22 03:11:29,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 03:11:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:29,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 03:11:29,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:29,134 WARN L261 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 03:11:29,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:29,174 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-22 03:11:29,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-22 03:11:29,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-22 03:11:29,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 66 states and 79 transitions. Complement of second has 8 states. [2022-07-22 03:11:29,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 03:11:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-22 03:11:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-07-22 03:11:29,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2022-07-22 03:11:29,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:29,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 25 letters. Loop has 3 letters. [2022-07-22 03:11:29,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:29,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 22 letters. Loop has 6 letters. [2022-07-22 03:11:29,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:29,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 79 transitions. [2022-07-22 03:11:29,255 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:29,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 64 states and 76 transitions. [2022-07-22 03:11:29,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-07-22 03:11:29,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-22 03:11:29,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 76 transitions. [2022-07-22 03:11:29,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:11:29,257 INFO L369 hiAutomatonCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-07-22 03:11:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 76 transitions. [2022-07-22 03:11:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-07-22 03:11:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 61 states have internal predecessors, (73), 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-22 03:11:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-07-22 03:11:29,260 INFO L392 hiAutomatonCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-07-22 03:11:29,260 INFO L374 stractBuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-07-22 03:11:29,260 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 03:11:29,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2022-07-22 03:11:29,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:29,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:29,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:29,262 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 2, 1, 1, 1, 1] [2022-07-22 03:11:29,262 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:29,262 INFO L752 eck$LassoCheckResult]: Stem: 1104#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(13, 2); 1105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 1120#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1121#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1122#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1123#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1151#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1150#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1149#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1148#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1147#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1139#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1138#L17-3 assume !(init_nondet_~i~0#1 < 5); 1110#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1111#L28-3 assume !!(rangesum_~i~1#1 < 5); 1158#L29 assume !(rangesum_~i~1#1 > 2); 1156#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1157#L28-3 assume !!(rangesum_~i~1#1 < 5); 1112#L29 assume !(rangesum_~i~1#1 > 2); 1113#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1116#L28-3 assume !!(rangesum_~i~1#1 < 5); 1131#L29 [2022-07-22 03:11:29,262 INFO L754 eck$LassoCheckResult]: Loop: 1131#L29 assume !(rangesum_~i~1#1 > 2); 1154#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1142#L28-3 assume !!(rangesum_~i~1#1 < 5); 1131#L29 [2022-07-22 03:11:29,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1567401565, now seen corresponding path program 2 times [2022-07-22 03:11:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:29,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353944373] [2022-07-22 03:11:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash 58645, now seen corresponding path program 1 times [2022-07-22 03:11:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:29,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788156285] [2022-07-22 03:11:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 424448051, now seen corresponding path program 3 times [2022-07-22 03:11:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:29,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662681295] [2022-07-22 03:11:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:29,326 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:11:29,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:11:29,327 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:11:29,327 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:11:29,327 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 03:11:29,327 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:29,327 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:11:29,327 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:11:29,327 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration8_Loop [2022-07-22 03:11:29,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:11:29,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:11:29,328 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-22 03:11:29,332 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-22 03:11:29,351 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:11:29,352 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 03:11:29,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:29,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:29,355 INFO L229 MonitoredProcess]: Starting monitored process 36 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-22 03:11:29,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 03:11:29,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 03:11:29,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 03:11:29,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:29,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:29,397 INFO L229 MonitoredProcess]: Starting monitored process 37 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-22 03:11:29,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 03:11:29,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 03:11:29,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 03:11:29,425 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 03:11:29,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:29,428 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:11:29,429 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:11:29,429 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:11:29,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:11:29,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:11:29,429 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:29,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:11:29,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:11:29,429 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration8_Loop [2022-07-22 03:11:29,429 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:11:29,429 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:11:29,429 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-22 03:11:29,434 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-22 03:11:29,448 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:11:29,449 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:11:29,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:29,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:29,450 INFO L229 MonitoredProcess]: Starting monitored process 38 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-22 03:11:29,456 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-22 03:11:29,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 03:11:29,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:29,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:29,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:29,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:29,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:29,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:29,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:29,465 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:11:29,467 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 03:11:29,467 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 03:11:29,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:29,468 INFO L229 MonitoredProcess]: Starting monitored process 39 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-22 03:11:29,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 03:11:29,470 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:11:29,470 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 03:11:29,470 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:11:29,470 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1#1) = -2*ULTIMATE.start_rangesum_~i~1#1 + 5 Supporting invariants [] [2022-07-22 03:11:29,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 03:11:29,486 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 03:11:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:29,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 03:11:29,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:29,542 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:11:29,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:29,573 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-22 03:11:29,574 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 03:11:29,574 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-22 03:11:29,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 17. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 82 states and 102 transitions. Complement of second has 7 states. [2022-07-22 03:11:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 03:11:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-22 03:11:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-07-22 03:11:29,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 3 letters. [2022-07-22 03:11:29,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:29,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 24 letters. Loop has 3 letters. [2022-07-22 03:11:29,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:29,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 6 letters. [2022-07-22 03:11:29,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:29,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 102 transitions. [2022-07-22 03:11:29,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-22 03:11:29,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 70 states and 84 transitions. [2022-07-22 03:11:29,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-07-22 03:11:29,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 03:11:29,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 84 transitions. [2022-07-22 03:11:29,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:11:29,600 INFO L369 hiAutomatonCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-07-22 03:11:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 84 transitions. [2022-07-22 03:11:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-22 03:11:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 66 states have internal predecessors, (80), 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-22 03:11:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-07-22 03:11:29,604 INFO L392 hiAutomatonCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-07-22 03:11:29,604 INFO L374 stractBuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-07-22 03:11:29,604 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 03:11:29,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2022-07-22 03:11:29,605 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-22 03:11:29,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:29,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:29,609 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:11:29,609 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:29,610 INFO L752 eck$LassoCheckResult]: Stem: 1345#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(13, 2); 1346#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 1361#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1362#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1363#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1364#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1392#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1391#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1390#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1389#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1388#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1385#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1384#L17-3 assume !(init_nondet_~i~0#1 < 5); 1355#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1356#L28-3 assume !!(rangesum_~i~1#1 < 5); 1351#L29 assume !(rangesum_~i~1#1 > 2); 1352#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1404#L28-3 assume !!(rangesum_~i~1#1 < 5); 1353#L29 assume !(rangesum_~i~1#1 > 2); 1354#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1357#L28-3 assume !!(rangesum_~i~1#1 < 5); 1400#L29 assume !(rangesum_~i~1#1 > 2); 1401#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1399#L28-3 assume !(rangesum_~i~1#1 < 5); 1371#L28-4 assume !(0 != rangesum_~cnt~0#1);rangesum_#res#1 := 0; 1365#L37 main_#t~ret5#1 := rangesum_#res#1;assume { :end_inline_rangesum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1349#L28-8 assume !!(rangesum_~i~1#1 < 5); 1350#L29-2 assume !(rangesum_~i~1#1 > 2); 1359#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1360#L28-8 assume !!(rangesum_~i~1#1 < 5); 1376#L29-2 assume !(rangesum_~i~1#1 > 2); 1377#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1387#L28-8 assume !!(rangesum_~i~1#1 < 5); 1386#L29-2 assume !(rangesum_~i~1#1 > 2); 1383#L28-7 [2022-07-22 03:11:29,610 INFO L754 eck$LassoCheckResult]: Loop: 1383#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1380#L28-8 assume !!(rangesum_~i~1#1 < 5); 1381#L29-2 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 1383#L28-7 [2022-07-22 03:11:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1909073688, now seen corresponding path program 1 times [2022-07-22 03:11:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:29,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980619141] [2022-07-22 03:11:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:29,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-22 03:11:29,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:29,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980619141] [2022-07-22 03:11:29,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980619141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:11:29,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:11:29,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 03:11:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129785810] [2022-07-22 03:11:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:11:29,674 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:11:29,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2022-07-22 03:11:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:29,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085203627] [2022-07-22 03:11:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 03:11:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 03:11:29,731 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-22 03:11:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:29,779 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-07-22 03:11:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 03:11:29,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 98 transitions. [2022-07-22 03:11:29,781 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2022-07-22 03:11:29,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 72 states and 86 transitions. [2022-07-22 03:11:29,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-22 03:11:29,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 03:11:29,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 86 transitions. [2022-07-22 03:11:29,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:11:29,783 INFO L369 hiAutomatonCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-07-22 03:11:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 86 transitions. [2022-07-22 03:11:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2022-07-22 03:11:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 61 states have internal predecessors, (72), 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-22 03:11:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-22 03:11:29,793 INFO L392 hiAutomatonCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-22 03:11:29,793 INFO L374 stractBuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-22 03:11:29,793 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 03:11:29,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 72 transitions. [2022-07-22 03:11:29,793 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-22 03:11:29,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:29,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:29,795 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:11:29,796 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:29,796 INFO L752 eck$LassoCheckResult]: Stem: 1500#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(13, 2); 1501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 1514#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1515#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1516#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1517#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1543#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1540#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1539#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1536#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1534#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1533#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1532#L17-3 assume !(init_nondet_~i~0#1 < 5); 1506#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1507#L28-3 assume !!(rangesum_~i~1#1 < 5); 1508#L29 assume !(rangesum_~i~1#1 > 2); 1509#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1555#L28-3 assume !!(rangesum_~i~1#1 < 5); 1510#L29 assume !(rangesum_~i~1#1 > 2); 1511#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1512#L28-3 assume !!(rangesum_~i~1#1 < 5); 1554#L29 assume !(rangesum_~i~1#1 > 2); 1552#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1553#L28-3 assume !!(rangesum_~i~1#1 < 5); 1545#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 1537#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1535#L28-3 assume !(rangesum_~i~1#1 < 5); 1529#L28-4 assume !(0 != rangesum_~cnt~0#1);rangesum_#res#1 := 0; 1520#L37 main_#t~ret5#1 := rangesum_#res#1;assume { :end_inline_rangesum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1504#L28-8 assume !!(rangesum_~i~1#1 < 5); 1505#L29-2 assume !(rangesum_~i~1#1 > 2); 1518#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1519#L28-8 assume !!(rangesum_~i~1#1 < 5); 1551#L29-2 assume !(rangesum_~i~1#1 > 2); 1550#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1549#L28-8 assume !!(rangesum_~i~1#1 < 5); 1548#L29-2 assume !(rangesum_~i~1#1 > 2); 1546#L28-7 [2022-07-22 03:11:29,796 INFO L754 eck$LassoCheckResult]: Loop: 1546#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1547#L28-8 assume !!(rangesum_~i~1#1 < 5); 1542#L29-2 assume !(rangesum_~i~1#1 > 2); 1546#L28-7 [2022-07-22 03:11:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1744047494, now seen corresponding path program 1 times [2022-07-22 03:11:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:29,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945512706] [2022-07-22 03:11:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:29,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 03:11:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:29,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945512706] [2022-07-22 03:11:29,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945512706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:11:29,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221948248] [2022-07-22 03:11:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:29,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:29,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:29,829 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:29,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-07-22 03:11:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:29,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 03:11:29,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 03:11:29,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 03:11:29,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221948248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:11:29,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 03:11:29,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-07-22 03:11:29,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131075059] [2022-07-22 03:11:29,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:11:29,927 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:11:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2022-07-22 03:11:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:29,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19910819] [2022-07-22 03:11:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:29,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:29,952 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:11:29,952 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:11:29,952 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:11:29,952 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:11:29,952 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 03:11:29,952 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:29,953 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:11:29,953 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:11:29,953 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration10_Loop [2022-07-22 03:11:29,953 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:11:29,953 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:11:29,954 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-22 03:11:29,955 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-22 03:11:29,974 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:11:29,974 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 03:11:29,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:29,976 INFO L229 MonitoredProcess]: Starting monitored process 41 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-22 03:11:29,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 03:11:29,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 03:11:29,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 03:11:30,004 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 03:11:30,005 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post3#1=0} Honda state: {ULTIMATE.start_rangesum_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 03:11:30,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:30,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:30,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:30,033 INFO L229 MonitoredProcess]: Starting monitored process 42 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-22 03:11:30,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 03:11:30,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 03:11:30,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 03:11:30,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:30,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:30,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:30,084 INFO L229 MonitoredProcess]: Starting monitored process 43 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-22 03:11:30,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 03:11:30,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 03:11:30,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 03:11:30,217 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 03:11:30,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:30,224 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:11:30,224 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:11:30,224 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:11:30,224 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:11:30,224 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:11:30,224 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:30,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:11:30,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:11:30,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration10_Loop [2022-07-22 03:11:30,225 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:11:30,225 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:11:30,225 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-22 03:11:30,227 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-22 03:11:30,243 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:11:30,243 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:11:30,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:30,244 INFO L229 MonitoredProcess]: Starting monitored process 44 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-22 03:11:30,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 03:11:30,247 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-22 03:11:30,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:30,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:30,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:30,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:30,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:30,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:30,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:30,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:11:30,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 03:11:30,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:30,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:30,275 INFO L229 MonitoredProcess]: Starting monitored process 45 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-22 03:11:30,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 03:11:30,278 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-22 03:11:30,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:11:30,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:11:30,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:11:30,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:11:30,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:11:30,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:11:30,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:11:30,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:11:30,288 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 03:11:30,288 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 03:11:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:11:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:30,336 INFO L229 MonitoredProcess]: Starting monitored process 46 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-22 03:11:30,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 03:11:30,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:11:30,338 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 03:11:30,338 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:11:30,338 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1#1) = -2*ULTIMATE.start_rangesum_~i~1#1 + 3 Supporting invariants [] [2022-07-22 03:11:30,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:30,357 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 03:11:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:30,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 03:11:30,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:30,479 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:11:30,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:30,493 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-22 03:11:30,494 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-22 03:11:30,494 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-22 03:11:30,532 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) Result 75 states and 88 transitions. Complement of second has 5 states. [2022-07-22 03:11:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 03:11:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-22 03:11:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-07-22 03:11:30,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 3 letters. [2022-07-22 03:11:30,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:30,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2022-07-22 03:11:30,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:30,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 6 letters. [2022-07-22 03:11:30,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:11:30,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 88 transitions. [2022-07-22 03:11:30,540 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-22 03:11:30,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 66 states and 77 transitions. [2022-07-22 03:11:30,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-22 03:11:30,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-22 03:11:30,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 77 transitions. [2022-07-22 03:11:30,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:11:30,541 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-07-22 03:11:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 77 transitions. [2022-07-22 03:11:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-07-22 03:11:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 64 states have internal predecessors, (76), 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-22 03:11:30,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 03:11:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-07-22 03:11:30,548 INFO L392 hiAutomatonCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-07-22 03:11:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:30,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 03:11:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 03:11:30,550 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-22 03:11:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:30,576 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2022-07-22 03:11:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 03:11:30,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 91 transitions. [2022-07-22 03:11:30,577 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:11:30,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 91 transitions. [2022-07-22 03:11:30,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-22 03:11:30,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 03:11:30,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2022-07-22 03:11:30,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:11:30,578 INFO L369 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2022-07-22 03:11:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2022-07-22 03:11:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2022-07-22 03:11:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 64 states have internal predecessors, (74), 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-22 03:11:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-07-22 03:11:30,582 INFO L392 hiAutomatonCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-07-22 03:11:30,582 INFO L374 stractBuchiCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-07-22 03:11:30,582 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 03:11:30,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 74 transitions. [2022-07-22 03:11:30,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-22 03:11:30,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:30,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:30,584 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:11:30,584 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:30,584 INFO L752 eck$LassoCheckResult]: Stem: 2029#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(13, 2); 2030#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 2046#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2047#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2048#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2049#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2079#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2078#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2077#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2076#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2075#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2068#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2067#L17-3 assume !(init_nondet_~i~0#1 < 5); 2037#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 2038#L28-3 assume !!(rangesum_~i~1#1 < 5); 2039#L29 assume !(rangesum_~i~1#1 > 2); 2040#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2086#L28-3 assume !!(rangesum_~i~1#1 < 5); 2041#L29 assume !(rangesum_~i~1#1 > 2); 2042#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2043#L28-3 assume !!(rangesum_~i~1#1 < 5); 2084#L29 assume !(rangesum_~i~1#1 > 2); 2081#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2082#L28-3 assume !!(rangesum_~i~1#1 < 5); 2074#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2071#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2070#L28-3 assume !(rangesum_~i~1#1 < 5); 2062#L28-4 assume 0 != rangesum_~cnt~0#1;rangesum_#res#1 := (if (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 <= 2147483647 then (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 else (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 - 4294967296); 2053#L37 main_#t~ret5#1 := rangesum_#res#1;assume { :end_inline_rangesum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 2054#L28-8 assume !!(rangesum_~i~1#1 < 5); 2073#L29-2 assume !(rangesum_~i~1#1 > 2); 2050#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2035#L28-8 assume !!(rangesum_~i~1#1 < 5); 2036#L29-2 assume !(rangesum_~i~1#1 > 2); 2066#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2087#L28-8 assume !!(rangesum_~i~1#1 < 5); 2083#L29-2 assume !(rangesum_~i~1#1 > 2); 2080#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2033#L28-8 assume !!(rangesum_~i~1#1 < 5); 2034#L29-2 [2022-07-22 03:11:30,584 INFO L754 eck$LassoCheckResult]: Loop: 2034#L29-2 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2065#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2069#L28-8 assume !!(rangesum_~i~1#1 < 5); 2034#L29-2 [2022-07-22 03:11:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 734232641, now seen corresponding path program 1 times [2022-07-22 03:11:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:30,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213739961] [2022-07-22 03:11:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:30,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:30,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 03:11:30,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95159471] [2022-07-22 03:11:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:30,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:30,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:30,600 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:30,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-07-22 03:11:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:11:30,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 03:11:30,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 03:11:30,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:11:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 03:11:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:30,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213739961] [2022-07-22 03:11:30,760 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 03:11:30,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95159471] [2022-07-22 03:11:30,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95159471] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:11:30,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 03:11:30,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-22 03:11:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658566585] [2022-07-22 03:11:30,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 03:11:30,763 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:11:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2022-07-22 03:11:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:30,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332401114] [2022-07-22 03:11:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:30,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:30,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:30,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 03:11:30,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 03:11:30,814 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-22 03:11:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:30,885 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2022-07-22 03:11:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 03:11:30,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 96 transitions. [2022-07-22 03:11:30,887 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-07-22 03:11:30,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 83 states and 95 transitions. [2022-07-22 03:11:30,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2022-07-22 03:11:30,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-07-22 03:11:30,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 95 transitions. [2022-07-22 03:11:30,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:11:30,888 INFO L369 hiAutomatonCegarLoop]: Abstraction has 83 states and 95 transitions. [2022-07-22 03:11:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 95 transitions. [2022-07-22 03:11:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2022-07-22 03:11:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 69 states have internal predecessors, (79), 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-22 03:11:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-07-22 03:11:30,890 INFO L392 hiAutomatonCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-07-22 03:11:30,890 INFO L374 stractBuchiCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-07-22 03:11:30,890 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 03:11:30,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 79 transitions. [2022-07-22 03:11:30,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-22 03:11:30,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:30,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:30,891 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:11:30,891 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:11:30,891 INFO L752 eck$LassoCheckResult]: Stem: 2416#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(13, 2); 2417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 2434#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2435#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2436#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2437#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2472#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2470#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2468#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2466#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2465#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2456#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2455#L17-3 assume !(init_nondet_~i~0#1 < 5); 2424#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 2425#L28-3 assume !!(rangesum_~i~1#1 < 5); 2426#L29 assume !(rangesum_~i~1#1 > 2); 2427#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2478#L28-3 assume !!(rangesum_~i~1#1 < 5); 2428#L29 assume !(rangesum_~i~1#1 > 2); 2429#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2480#L28-3 assume !!(rangesum_~i~1#1 < 5); 2477#L29 assume !(rangesum_~i~1#1 > 2); 2476#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2475#L28-3 assume !!(rangesum_~i~1#1 < 5); 2474#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2473#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2462#L28-3 assume !!(rangesum_~i~1#1 < 5); 2463#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2461#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2459#L28-3 assume !(rangesum_~i~1#1 < 5); 2448#L28-4 assume 0 != rangesum_~cnt~0#1;rangesum_#res#1 := (if (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 <= 2147483647 then (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 else (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 - 4294967296); 2441#L37 main_#t~ret5#1 := rangesum_#res#1;assume { :end_inline_rangesum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 2420#L28-8 assume !!(rangesum_~i~1#1 < 5); 2421#L29-2 assume !(rangesum_~i~1#1 > 2); 2438#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2439#L28-8 assume !!(rangesum_~i~1#1 < 5); 2453#L29-2 assume !(rangesum_~i~1#1 > 2); 2454#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2479#L28-8 assume !!(rangesum_~i~1#1 < 5); 2471#L29-2 assume !(rangesum_~i~1#1 > 2); 2469#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2467#L28-8 assume !!(rangesum_~i~1#1 < 5); 2451#L29-2 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2452#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2464#L28-8 assume !!(rangesum_~i~1#1 < 5); 2458#L29-2 [2022-07-22 03:11:30,892 INFO L754 eck$LassoCheckResult]: Loop: 2458#L29-2 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2460#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2457#L28-8 assume !!(rangesum_~i~1#1 < 5); 2458#L29-2 [2022-07-22 03:11:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:30,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1040814406, now seen corresponding path program 1 times [2022-07-22 03:11:30,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:30,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160042587] [2022-07-22 03:11:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:30,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:30,905 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 03:11:30,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049393590] [2022-07-22 03:11:30,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:30,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:30,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:30,907 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:30,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-07-22 03:11:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:30,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:31,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2022-07-22 03:11:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:31,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362175799] [2022-07-22 03:11:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:31,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,044 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1533007565, now seen corresponding path program 2 times [2022-07-22 03:11:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:31,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444228817] [2022-07-22 03:11:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:31,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 03:11:31,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414414242] [2022-07-22 03:11:31,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 03:11:31,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:31,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:31,064 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:31,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-07-22 03:11:31,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 03:11:31,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 03:11:31,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:11:31,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:11:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-22 03:11:31,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 03:11:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:11:31,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444228817] [2022-07-22 03:11:31,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 03:11:31,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414414242] [2022-07-22 03:11:31,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414414242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:11:31,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:11:31,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 03:11:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827817113] [2022-07-22 03:11:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:11:31,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:11:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 03:11:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 03:11:31,231 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. cyclomatic complexity: 16 Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-22 03:11:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:11:31,278 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-07-22 03:11:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 03:11:31,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 87 transitions. [2022-07-22 03:11:31,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-22 03:11:31,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 67 states and 71 transitions. [2022-07-22 03:11:31,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-22 03:11:31,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-07-22 03:11:31,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2022-07-22 03:11:31,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:11:31,281 INFO L369 hiAutomatonCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-07-22 03:11:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2022-07-22 03:11:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-07-22 03:11:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 55 states have internal predecessors, (60), 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-22 03:11:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-07-22 03:11:31,282 INFO L392 hiAutomatonCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-07-22 03:11:31,282 INFO L374 stractBuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-07-22 03:11:31,282 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 03:11:31,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2022-07-22 03:11:31,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-22 03:11:31,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:11:31,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:11:31,284 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:11:31,284 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:11:31,284 INFO L752 eck$LassoCheckResult]: Stem: 2720#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(13, 2); 2721#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 2741#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2742#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2743#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2744#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2749#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2775#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2774#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2772#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2771#L17-3 assume !!(init_nondet_~i~0#1 < 5);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 2759#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 2758#L17-3 assume !(init_nondet_~i~0#1 < 5); 2728#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 2729#L28-3 assume !!(rangesum_~i~1#1 < 5); 2730#L29 assume !(rangesum_~i~1#1 > 2); 2731#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2770#L28-3 assume !!(rangesum_~i~1#1 < 5); 2732#L29 assume !(rangesum_~i~1#1 > 2); 2733#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2737#L28-3 assume !!(rangesum_~i~1#1 < 5); 2752#L29 assume !(rangesum_~i~1#1 > 2); 2769#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2767#L28-3 assume !!(rangesum_~i~1#1 < 5); 2765#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2735#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2736#L28-3 assume !!(rangesum_~i~1#1 < 5); 2751#L29 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2763#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2761#L28-3 assume !(rangesum_~i~1#1 < 5); 2755#L28-4 assume 0 != rangesum_~cnt~0#1;rangesum_#res#1 := (if (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 <= 2147483647 then (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 else (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 - 4294967296); 2747#L37 main_#t~ret5#1 := rangesum_#res#1;assume { :end_inline_rangesum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 2748#L28-8 assume !!(rangesum_~i~1#1 < 5); 2756#L29-2 assume !(rangesum_~i~1#1 > 2); 2738#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2739#L28-8 assume !!(rangesum_~i~1#1 < 5); 2757#L29-2 assume !(rangesum_~i~1#1 > 2); 2740#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2726#L28-8 assume !!(rangesum_~i~1#1 < 5); 2727#L29-2 assume !(rangesum_~i~1#1 > 2); 2773#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2724#L28-8 assume !!(rangesum_~i~1#1 < 5); 2725#L29-2 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2768#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2766#L28-8 assume !!(rangesum_~i~1#1 < 5); 2764#L29-2 assume rangesum_~i~1#1 > 2;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2762#L28-7 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 2760#L28-8 assume !(rangesum_~i~1#1 < 5); 2753#L28-9 assume 0 != rangesum_~cnt~0#1;rangesum_#res#1 := (if (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 <= 2147483647 then (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 else (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 - 4294967296); 2745#L37-1 main_#t~ret8#1 := rangesum_#res#1;assume { :end_inline_rangesum } true;main_~ret2~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;main_~i~2#1 := 0; 2746#L54-3 [2022-07-22 03:11:31,284 INFO L754 eck$LassoCheckResult]: Loop: 2746#L54-3 assume !!(main_~i~2#1 < 4);call main_#t~mem11#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem11#1; 2750#L54-2 main_#t~post10#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2746#L54-3 [2022-07-22 03:11:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -46487371, now seen corresponding path program 1 times [2022-07-22 03:11:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:31,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4272541] [2022-07-22 03:11:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:31,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:31,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 03:11:31,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230415822] [2022-07-22 03:11:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:31,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:31,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:31,311 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:31,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-07-22 03:11:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:31,441 INFO L85 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2022-07-22 03:11:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:31,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909903196] [2022-07-22 03:11:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:31,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:11:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1724688201, now seen corresponding path program 1 times [2022-07-22 03:11:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:11:31,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966091962] [2022-07-22 03:11:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:11:31,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 03:11:31,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763729885] [2022-07-22 03:11:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:11:31,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:11:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:11:31,484 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:11:31,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-07-22 03:11:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:11:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:11:31,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:11:58,397 WARN L233 SmtUtils]: Spent 26.71s on a formula simplification. DAG size of input: 353 DAG size of output: 273 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-22 03:12:16,477 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:12:16,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:12:16,477 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:12:16,477 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:12:16,477 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:12:16,477 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:16,477 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:12:16,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:12:16,477 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration13_Lasso [2022-07-22 03:12:16,477 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:12:16,477 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:12:16,487 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-22 03:12:16,490 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-22 03:12:16,493 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-22 03:12:16,495 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-22 03:12:16,497 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-22 03:12:16,499 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-22 03:12:16,501 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-22 03:12:16,503 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-22 03:12:16,505 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-22 03:12:16,507 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-22 03:12:16,510 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-22 03:12:16,513 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-22 03:12:16,516 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-22 03:12:16,518 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-22 03:12:16,520 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-22 03:12:16,522 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-22 03:12:16,524 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-22 03:12:18,033 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-22 03:12:18,037 INFO L158 Benchmark]: Toolchain (without parser) took 56756.09ms. Allocated memory was 56.6MB in the beginning and 125.8MB in the end (delta: 69.2MB). Free memory was 34.3MB in the beginning and 63.1MB in the end (delta: -28.7MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2022-07-22 03:12:18,037 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:12:18,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.21ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 38.9MB in the end (delta: -4.7MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-22 03:12:18,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.52ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 36.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:12:18,039 INFO L158 Benchmark]: Boogie Preprocessor took 52.20ms. Allocated memory is still 56.6MB. Free memory was 36.9MB in the beginning and 35.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 03:12:18,039 INFO L158 Benchmark]: RCFGBuilder took 438.34ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.3MB in the beginning and 49.9MB in the end (delta: -14.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2022-07-22 03:12:18,040 INFO L158 Benchmark]: BuchiAutomizer took 55872.36ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 49.9MB in the beginning and 63.1MB in the end (delta: -13.2MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2022-07-22 03:12:18,042 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.13ms. Allocated memory is still 56.6MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.21ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 38.9MB in the end (delta: -4.7MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.52ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 36.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.20ms. Allocated memory is still 56.6MB. Free memory was 36.9MB in the beginning and 35.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.34ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.3MB in the beginning and 49.9MB in the end (delta: -14.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 55872.36ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 49.9MB in the beginning and 63.1MB in the end (delta: -13.2MB). Peak memory consumption was 80.0MB. 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-22 03:12:18,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-07-22 03:12:18,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-07-22 03:12:18,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-07-22 03:12:18,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-07-22 03:12:18,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-07-22 03:12:19,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-07-22 03:12:19,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-22 03:12:19,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-22 03:12:19,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-22 03:12:20,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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