./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/max05-1.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 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:50:39,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:50:39,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:50:39,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:50:39,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:50:39,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:50:39,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:50:39,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:50:39,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:50:39,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:50:39,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:50:39,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:50:39,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:50:39,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:50:39,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:50:39,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:50:39,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:50:39,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:50:39,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:50:39,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:50:39,298 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:50:39,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:50:39,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:50:39,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:50:39,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:50:39,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:50:39,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:50:39,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:50:39,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:50:39,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:50:39,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:50:39,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:50:39,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:50:39,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:50:39,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:50:39,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:50:39,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:50:39,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:50:39,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:50:39,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:50:39,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:50:39,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:50:39,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:50:39,331 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:50:39,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:50:39,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:50:39,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:50:39,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:50:39,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:50:39,336 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:50:39,336 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:50:39,336 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:50:39,337 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:50:39,337 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:50:39,337 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:50:39,337 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:50:39,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:50:39,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:50:39,338 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:50:39,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:50:39,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:50:39,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:50:39,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:50:39,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:50:39,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:50:39,340 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:50:39,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:50:39,351 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:50:39,351 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:50:39,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:50:39,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:50:39,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:50:39,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:50:39,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:50:39,353 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:50:39,353 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 -> 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 [2022-07-13 04:50:39,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:50:39,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:50:39,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:50:39,572 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:50:39,573 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:50:39,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2022-07-13 04:50:39,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12b7a2c4/80edb8365e88419089ff24025afd646f/FLAG99a07574b [2022-07-13 04:50:40,000 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:50:40,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2022-07-13 04:50:40,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12b7a2c4/80edb8365e88419089ff24025afd646f/FLAG99a07574b [2022-07-13 04:50:40,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12b7a2c4/80edb8365e88419089ff24025afd646f [2022-07-13 04:50:40,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:50:40,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:50:40,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:50:40,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:50:40,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:50:40,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3d8192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40, skipping insertion in model container [2022-07-13 04:50:40,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:50:40,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:50:40,558 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/max05-1.i[1284,1297] [2022-07-13 04:50:40,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:50:40,565 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:50:40,579 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/max05-1.i[1284,1297] [2022-07-13 04:50:40,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:50:40,588 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:50:40,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40 WrapperNode [2022-07-13 04:50:40,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:50:40,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:50:40,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:50:40,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:50:40,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,611 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-07-13 04:50:40,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:50:40,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:50:40,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:50:40,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:50:40,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:50:40,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:50:40,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:50:40,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:50:40,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (1/1) ... [2022-07-13 04:50:40,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:40,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:40,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:40,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 04:50:40,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:50:40,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:50:40,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:50:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:50:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:50:40,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:50:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:50:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:50:40,749 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:50:40,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:50:40,902 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:50:40,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:50:40,907 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 04:50:40,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:50:40 BoogieIcfgContainer [2022-07-13 04:50:40,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:50:40,909 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:50:40,909 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:50:40,912 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:50:40,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:50:40,927 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:50:40" (1/3) ... [2022-07-13 04:50:40,928 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61275209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:50:40, skipping insertion in model container [2022-07-13 04:50:40,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:50:40,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:40" (2/3) ... [2022-07-13 04:50:40,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61275209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:50:40, skipping insertion in model container [2022-07-13 04:50:40,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:50:40,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:50:40" (3/3) ... [2022-07-13 04:50:40,930 INFO L354 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2022-07-13 04:50:40,968 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:50:40,969 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:50:40,969 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:50:40,969 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:50:40,969 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:50:40,969 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:50:40,969 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:50:40,970 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:50:40,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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-13 04:50:40,987 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2022-07-13 04:50:40,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:40,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:40,991 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:50:40,991 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:50:40,991 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:50:40,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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-13 04:50:40,994 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2022-07-13 04:50:40,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:40,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:40,994 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:50:40,994 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:50:40,999 INFO L752 eck$LassoCheckResult]: Stem: 18#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(10, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 16#L34-3true [2022-07-13 04:50:40,999 INFO L754 eck$LassoCheckResult]: Loop: 16#L34-3true assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 10#L34-2true main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16#L34-3true [2022-07-13 04:50:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:41,003 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 04:50:41,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:41,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193045010] [2022-07-13 04:50:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:41,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:41,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:41,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-13 04:50:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:41,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111162070] [2022-07-13 04:50:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:41,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:41,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-13 04:50:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:41,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465693477] [2022-07-13 04:50:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:41,150 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:41,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:41,417 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:50:41,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:50:41,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:50:41,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:50:41,418 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:50:41,418 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:50:41,418 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:50:41,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2022-07-13 04:50:41,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:50:41,418 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:50:41,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-13 04:50:41,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,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-13 04:50:41,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:41,779 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:50:41,781 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:50:41,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:41,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 04:50:41,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 04:50:41,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 04:50:41,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:41,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 04:50:41,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:41,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 04:50:41,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:41,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:41,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:41,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:42,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:42,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:42,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:42,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:42,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:50:42,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:42,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:50:42,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:42,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:42,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:42,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:42,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:42,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:50:42,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:42,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,168 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-13 04:50:42,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:42,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:50:42,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:42,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,217 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:42,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 04:50:42,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:50:42,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:50:42,288 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-13 04:50:42,289 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-13 04:50:42,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:42,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 04:50:42,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:50:42,348 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:50:42,348 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:50:42,348 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-07-13 04:50:42,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,399 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-13 04:50:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:50:42,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 04:50:42,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:42,485 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 04:50:42,486 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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-13 04:50:42,542 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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 84 states and 119 transitions. Complement of second has 8 states. [2022-07-13 04:50:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:50:42,547 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-13 04:50:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-07-13 04:50:42,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-13 04:50:42,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:42,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 04:50:42,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:42,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-13 04:50:42,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:42,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2022-07-13 04:50:42,553 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:42,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2022-07-13 04:50:42,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-13 04:50:42,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-13 04:50:42,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2022-07-13 04:50:42,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:42,557 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-13 04:50:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2022-07-13 04:50:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-13 04:50:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:50:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-07-13 04:50:42,574 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-13 04:50:42,574 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-13 04:50:42,574 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:50:42,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-07-13 04:50:42,575 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:42,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:42,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:42,576 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:50:42,576 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:42,576 INFO L752 eck$LassoCheckResult]: Stem: 177#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(10, 2); 178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 188#L34-3 assume !(main_~i~1#1 < 5); 181#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 182#L20-3 [2022-07-13 04:50:42,576 INFO L754 eck$LassoCheckResult]: Loop: 182#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 195#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 196#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 197#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 182#L20-3 [2022-07-13 04:50:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-13 04:50:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11442138] [2022-07-13 04:50:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:42,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11442138] [2022-07-13 04:50:42,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11442138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:50:42,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:50:42,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:50:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664651955] [2022-07-13 04:50:42,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:50:42,605 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:50:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2022-07-13 04:50:42,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556249854] [2022-07-13 04:50:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:42,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:42,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:42,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:50:42,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:50:42,652 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 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-13 04:50:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:42,659 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-07-13 04:50:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:50:42,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2022-07-13 04:50:42,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:42,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2022-07-13 04:50:42,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-13 04:50:42,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-13 04:50:42,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2022-07-13 04:50:42,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:42,662 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-13 04:50:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2022-07-13 04:50:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-13 04:50:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-13 04:50:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-13 04:50:42,664 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-13 04:50:42,664 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-13 04:50:42,664 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:50:42,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2022-07-13 04:50:42,665 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:42,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:42,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:42,665 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:50:42,665 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:42,665 INFO L752 eck$LassoCheckResult]: Stem: 234#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(10, 2); 235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 245#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 248#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 249#L34-3 assume !(main_~i~1#1 < 5); 238#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 239#L20-3 [2022-07-13 04:50:42,665 INFO L754 eck$LassoCheckResult]: Loop: 239#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 252#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 253#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 254#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 239#L20-3 [2022-07-13 04:50:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-13 04:50:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183628207] [2022-07-13 04:50:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:42,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:42,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183628207] [2022-07-13 04:50:42,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183628207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:50:42,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40283412] [2022-07-13 04:50:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:50:42,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,700 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-13 04:50:42,701 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-13 04:50:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 04:50:42,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:42,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:50:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:42,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40283412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:50:42,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:50:42,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 04:50:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916712700] [2022-07-13 04:50:42,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:50:42,767 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:50:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2022-07-13 04:50:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056320337] [2022-07-13 04:50:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:42,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:42,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:42,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:50:42,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:50:42,830 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 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-13 04:50:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:42,848 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-07-13 04:50:42,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 04:50:42,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2022-07-13 04:50:42,850 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:42,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2022-07-13 04:50:42,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-13 04:50:42,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-13 04:50:42,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2022-07-13 04:50:42,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:42,851 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-13 04:50:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2022-07-13 04:50:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 04:50:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:50:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-13 04:50:42,856 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-13 04:50:42,856 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-13 04:50:42,856 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:50:42,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2022-07-13 04:50:42,857 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:42,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:42,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:42,857 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-13 04:50:42,857 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:42,857 INFO L752 eck$LassoCheckResult]: Stem: 330#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(10, 2); 331#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 341#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 344#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 345#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 353#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 358#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 357#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 356#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 355#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 354#L34-3 assume !(main_~i~1#1 < 5); 334#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 335#L20-3 [2022-07-13 04:50:42,857 INFO L754 eck$LassoCheckResult]: Loop: 335#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 348#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 349#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 350#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 335#L20-3 [2022-07-13 04:50:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-13 04:50:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601602513] [2022-07-13 04:50:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,944 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-13 04:50:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:42,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601602513] [2022-07-13 04:50:42,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601602513] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:50:42,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164427374] [2022-07-13 04:50:42,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 04:50:42,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:50:42,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,989 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-13 04:50:43,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-13 04:50:43,068 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-13 04:50:43,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 04:50:43,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 04:50:43,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 04:50:43,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:43,126 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-13 04:50:43,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:50:43,141 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-13 04:50:43,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164427374] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:50:43,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:50:43,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-13 04:50:43,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453991462] [2022-07-13 04:50:43,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:50:43,142 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:50:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2022-07-13 04:50:43,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:43,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433607162] [2022-07-13 04:50:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:43,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 04:50:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-13 04:50:43,185 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 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-13 04:50:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:43,202 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-07-13 04:50:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:50:43,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2022-07-13 04:50:43,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:43,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2022-07-13 04:50:43,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-13 04:50:43,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-13 04:50:43,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2022-07-13 04:50:43,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:43,205 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-13 04:50:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2022-07-13 04:50:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-13 04:50:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:50:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-13 04:50:43,207 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-13 04:50:43,207 INFO L374 stractBuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-13 04:50:43,208 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:50:43,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2022-07-13 04:50:43,208 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:43,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:43,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:43,209 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2022-07-13 04:50:43,209 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:43,209 INFO L752 eck$LassoCheckResult]: Stem: 473#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(10, 2); 474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 482#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 485#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 486#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 494#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 501#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 500#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 499#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 498#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 497#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 496#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 495#L34-3 assume !(main_~i~1#1 < 5); 475#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 476#L20-3 [2022-07-13 04:50:43,209 INFO L754 eck$LassoCheckResult]: Loop: 476#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 489#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 490#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 491#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 476#L20-3 [2022-07-13 04:50:43,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2022-07-13 04:50:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:43,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678501077] [2022-07-13 04:50:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,223 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2022-07-13 04:50:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917717794] [2022-07-13 04:50:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,238 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2022-07-13 04:50:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:43,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838705031] [2022-07-13 04:50:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,258 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:43,806 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:50:43,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:50:43,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:50:43,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:50:43,806 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:50:43,806 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:43,806 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:50:43,806 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:50:43,806 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration5_Lasso [2022-07-13 04:50:43,806 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:50:43,806 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:50:43,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:43,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:43,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:43,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:43,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:43,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:43,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:50:43,914 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 04:50:43,917 INFO L158 Benchmark]: Toolchain (without parser) took 3488.15ms. Allocated memory was 86.0MB in the beginning and 144.7MB in the end (delta: 58.7MB). Free memory was 62.4MB in the beginning and 107.9MB in the end (delta: -45.4MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2022-07-13 04:50:43,917 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:50:43,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.88ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 62.3MB in the beginning and 88.7MB in the end (delta: -26.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 04:50:43,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.00ms. Allocated memory is still 119.5MB. Free memory was 88.5MB in the beginning and 86.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:50:43,918 INFO L158 Benchmark]: Boogie Preprocessor took 14.79ms. Allocated memory is still 119.5MB. Free memory was 86.8MB in the beginning and 85.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:50:43,918 INFO L158 Benchmark]: RCFGBuilder took 281.53ms. Allocated memory is still 119.5MB. Free memory was 85.3MB in the beginning and 72.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 04:50:43,919 INFO L158 Benchmark]: BuchiAutomizer took 3007.01ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 72.5MB in the beginning and 107.9MB in the end (delta: -35.4MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-07-13 04:50:43,920 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.88ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 62.3MB in the beginning and 88.7MB in the end (delta: -26.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.00ms. Allocated memory is still 119.5MB. Free memory was 88.5MB in the beginning and 86.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.79ms. Allocated memory is still 119.5MB. Free memory was 86.8MB in the beginning and 85.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 281.53ms. Allocated memory is still 119.5MB. Free memory was 85.3MB in the beginning and 72.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3007.01ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 72.5MB in the beginning and 107.9MB in the end (delta: -35.4MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:50:43,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:44,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:44,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null