./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-100.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:57:51,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:57:51,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:57:51,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:57:51,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:57:51,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:57:51,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:57:51,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:57:51,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:57:51,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:57:51,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:57:51,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:57:51,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:57:51,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:57:51,666 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:57:51,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:57:51,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:57:51,667 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:57:51,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:57:51,668 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:51,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:51,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:51,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:51,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:51,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:57:51,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:57:51,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:57:51,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:57:51,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:57:51,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:57:51,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:57:51,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:57:51,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:57:51,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:57:51,670 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G ! overflow) ) 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 -> 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 [2025-01-10 06:57:51,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:57:51,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:57:51,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:57:51,905 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:57:51,905 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:57:51,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-100.i [2025-01-10 06:57:53,210 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e99db2e21/04f8c944d448442ea4965b783c1bdcdc/FLAG29440697d [2025-01-10 06:57:53,535 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:57:53,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-100.i [2025-01-10 06:57:53,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e99db2e21/04f8c944d448442ea4965b783c1bdcdc/FLAG29440697d [2025-01-10 06:57:53,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e99db2e21/04f8c944d448442ea4965b783c1bdcdc [2025-01-10 06:57:53,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:57:53,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:57:53,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:53,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:57:53,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:57:53,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:53,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a81c88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53, skipping insertion in model container [2025-01-10 06:57:53,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:53,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:57:54,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:54,071 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:57:54,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:54,145 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:57:54,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54 WrapperNode [2025-01-10 06:57:54,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:54,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:54,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:57:54,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:57:54,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,190 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 85 [2025-01-10 06:57:54,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:54,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:57:54,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:57:54,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:57:54,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,214 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:57:54,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:57:54,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:57:54,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:57:54,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:57:54,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:54,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:54,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:57:54,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:57:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:57:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 06:57:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 06:57:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 06:57:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 06:57:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:57:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:57:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:57:54,270 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:57:54,378 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:57:54,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:57:54,508 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:57:54,509 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:57:54,591 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:57:54,591 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:57:54,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:54 BoogieIcfgContainer [2025-01-10 06:57:54,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:57:54,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:57:54,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:57:54,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:57:54,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:57:53" (1/3) ... [2025-01-10 06:57:54,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0ee290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:54, skipping insertion in model container [2025-01-10 06:57:54,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (2/3) ... [2025-01-10 06:57:54,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0ee290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:54, skipping insertion in model container [2025-01-10 06:57:54,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:54" (3/3) ... [2025-01-10 06:57:54,600 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2025-01-10 06:57:54,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:57:54,612 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-01-10 06:57:54,612 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:57:54,650 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:57:54,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 78 flow [2025-01-10 06:57:54,697 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-01-10 06:57:54,699 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:54,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 2/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-10 06:57:54,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 78 flow [2025-01-10 06:57:54,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 28 transitions, 65 flow [2025-01-10 06:57:54,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:54,728 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69a4ff1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:54,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 06:57:54,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:54,732 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:57:54,732 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:57:54,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:54,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:57:54,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:54,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash -690020229, now seen corresponding path program 1 times [2025-01-10 06:57:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:54,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135327841] [2025-01-10 06:57:54,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:57:54,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:57:54,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:54,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135327841] [2025-01-10 06:57:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135327841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:54,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:54,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:54,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420021337] [2025-01-10 06:57:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:54,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:54,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:54,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:54,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:54,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:54,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:54,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:54,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,035 INFO L124 PetriNetUnfolderBase]: 123/288 cut-off events. [2025-01-10 06:57:55,035 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:57:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 288 events. 123/288 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1314 event pairs, 96 based on Foata normal form. 11/229 useless extension candidates. Maximal degree in co-relation 474. Up to 211 conditions per place. [2025-01-10 06:57:55,038 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 17 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-01-10 06:57:55,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 99 flow [2025-01-10 06:57:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 06:57:55,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-10 06:57:55,048 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 65 flow. Second operand 3 states and 52 transitions. [2025-01-10 06:57:55,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 99 flow [2025-01-10 06:57:55,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:55,053 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 60 flow [2025-01-10 06:57:55,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2025-01-10 06:57:55,057 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-01-10 06:57:55,057 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 60 flow [2025-01-10 06:57:55,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:55,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:57:55,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:55,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 84209668, now seen corresponding path program 1 times [2025-01-10 06:57:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065472330] [2025-01-10 06:57:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:55,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:55,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065472330] [2025-01-10 06:57:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065472330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:55,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200218383] [2025-01-10 06:57:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:55,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:55,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:55,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:55,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:55,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:55,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,157 INFO L124 PetriNetUnfolderBase]: 107/255 cut-off events. [2025-01-10 06:57:55,157 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:55,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 255 events. 107/255 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1114 event pairs, 82 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 448. Up to 184 conditions per place. [2025-01-10 06:57:55,159 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 16 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-01-10 06:57:55,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 92 flow [2025-01-10 06:57:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-01-10 06:57:55,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-01-10 06:57:55,161 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 60 flow. Second operand 3 states and 51 transitions. [2025-01-10 06:57:55,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 92 flow [2025-01-10 06:57:55,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 91 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:55,162 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 59 flow [2025-01-10 06:57:55,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-01-10 06:57:55,162 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-01-10 06:57:55,162 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 59 flow [2025-01-10 06:57:55,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:55,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:57:55,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:55,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash 84470805, now seen corresponding path program 1 times [2025-01-10 06:57:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844114385] [2025-01-10 06:57:55,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:55,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:55,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844114385] [2025-01-10 06:57:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844114385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40829131] [2025-01-10 06:57:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:55,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:55,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:55,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:55,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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) [2025-01-10 06:57:55,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:55,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,327 INFO L124 PetriNetUnfolderBase]: 213/434 cut-off events. [2025-01-10 06:57:55,328 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:55,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 434 events. 213/434 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1936 event pairs, 118 based on Foata normal form. 14/363 useless extension candidates. Maximal degree in co-relation 819. Up to 253 conditions per place. [2025-01-10 06:57:55,330 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 38 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-01-10 06:57:55,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 190 flow [2025-01-10 06:57:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-10 06:57:55,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-01-10 06:57:55,331 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 59 flow. Second operand 4 states and 87 transitions. [2025-01-10 06:57:55,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 190 flow [2025-01-10 06:57:55,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:55,335 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 80 flow [2025-01-10 06:57:55,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2025-01-10 06:57:55,335 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-01-10 06:57:55,335 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 80 flow [2025-01-10 06:57:55,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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) [2025-01-10 06:57:55,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,336 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:57:55,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:55,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -380803832, now seen corresponding path program 1 times [2025-01-10 06:57:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922753159] [2025-01-10 06:57:55,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:55,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:55,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922753159] [2025-01-10 06:57:55,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922753159] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:55,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861873054] [2025-01-10 06:57:55,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:55,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:55,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:55,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:57:55,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:55,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:55,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:55,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:57:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861873054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:57:55,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:57:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645085555] [2025-01-10 06:57:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:55,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:55,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:55,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:55,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:55,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,677 INFO L124 PetriNetUnfolderBase]: 193/378 cut-off events. [2025-01-10 06:57:55,677 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-01-10 06:57:55,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 378 events. 193/378 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1598 event pairs, 23 based on Foata normal form. 14/349 useless extension candidates. Maximal degree in co-relation 839. Up to 94 conditions per place. [2025-01-10 06:57:55,682 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 53 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-01-10 06:57:55,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 65 transitions, 277 flow [2025-01-10 06:57:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2025-01-10 06:57:55,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6510416666666666 [2025-01-10 06:57:55,684 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 80 flow. Second operand 6 states and 125 transitions. [2025-01-10 06:57:55,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 65 transitions, 277 flow [2025-01-10 06:57:55,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:55,686 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 84 flow [2025-01-10 06:57:55,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2025-01-10 06:57:55,686 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-01-10 06:57:55,686 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 84 flow [2025-01-10 06:57:55,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:55,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:57:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:55,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 432839176, now seen corresponding path program 1 times [2025-01-10 06:57:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681164557] [2025-01-10 06:57:55,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:55,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:55,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681164557] [2025-01-10 06:57:55,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681164557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:55,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242384337] [2025-01-10 06:57:55,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:55,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:55,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:55,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:55,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) [2025-01-10 06:57:55,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:55,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,027 INFO L124 PetriNetUnfolderBase]: 303/592 cut-off events. [2025-01-10 06:57:56,028 INFO L125 PetriNetUnfolderBase]: For 404/414 co-relation queries the response was YES. [2025-01-10 06:57:56,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 592 events. 303/592 cut-off events. For 404/414 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2645 event pairs, 189 based on Foata normal form. 18/547 useless extension candidates. Maximal degree in co-relation 1399. Up to 387 conditions per place. [2025-01-10 06:57:56,030 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 39 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-01-10 06:57:56,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 256 flow [2025-01-10 06:57:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-01-10 06:57:56,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-01-10 06:57:56,032 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 84 flow. Second operand 4 states and 82 transitions. [2025-01-10 06:57:56,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 256 flow [2025-01-10 06:57:56,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 229 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:56,033 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 97 flow [2025-01-10 06:57:56,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2025-01-10 06:57:56,034 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2025-01-10 06:57:56,034 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 97 flow [2025-01-10 06:57:56,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) [2025-01-10 06:57:56,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,034 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:57:56,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:56,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1079983378, now seen corresponding path program 1 times [2025-01-10 06:57:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688733900] [2025-01-10 06:57:56,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:56,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:56,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688733900] [2025-01-10 06:57:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688733900] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951736195] [2025-01-10 06:57:56,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:56,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:56,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:56,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:57:56,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:56,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:56,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:56,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951736195] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:56,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:56,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:57:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705576738] [2025-01-10 06:57:56,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:56,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:56,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:56,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 97 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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) [2025-01-10 06:57:56,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:56,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,490 INFO L124 PetriNetUnfolderBase]: 568/1106 cut-off events. [2025-01-10 06:57:56,490 INFO L125 PetriNetUnfolderBase]: For 712/776 co-relation queries the response was YES. [2025-01-10 06:57:56,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2764 conditions, 1106 events. 568/1106 cut-off events. For 712/776 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5518 event pairs, 151 based on Foata normal form. 60/1159 useless extension candidates. Maximal degree in co-relation 2754. Up to 315 conditions per place. [2025-01-10 06:57:56,498 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 115 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2025-01-10 06:57:56,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 131 transitions, 699 flow [2025-01-10 06:57:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2025-01-10 06:57:56,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684375 [2025-01-10 06:57:56,503 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 97 flow. Second operand 10 states and 219 transitions. [2025-01-10 06:57:56,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 131 transitions, 699 flow [2025-01-10 06:57:56,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 131 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:56,509 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 159 flow [2025-01-10 06:57:56,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=159, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2025-01-10 06:57:56,510 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2025-01-10 06:57:56,510 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 159 flow [2025-01-10 06:57:56,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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) [2025-01-10 06:57:56,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,510 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:57:56,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:56,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1220362402, now seen corresponding path program 1 times [2025-01-10 06:57:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402949995] [2025-01-10 06:57:56,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:56,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402949995] [2025-01-10 06:57:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402949995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534990275] [2025-01-10 06:57:56,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:56,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:56,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:56,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:57:56,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:56,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:56,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:56,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:57:56,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534990275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:57:56,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:57:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057336655] [2025-01-10 06:57:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:56,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:56,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:56,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:56,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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) [2025-01-10 06:57:56,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:56,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,029 INFO L124 PetriNetUnfolderBase]: 595/1154 cut-off events. [2025-01-10 06:57:57,029 INFO L125 PetriNetUnfolderBase]: For 1230/1244 co-relation queries the response was YES. [2025-01-10 06:57:57,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 1154 events. 595/1154 cut-off events. For 1230/1244 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5706 event pairs, 156 based on Foata normal form. 39/1145 useless extension candidates. Maximal degree in co-relation 3172. Up to 317 conditions per place. [2025-01-10 06:57:57,034 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 84 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2025-01-10 06:57:57,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 695 flow [2025-01-10 06:57:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-01-10 06:57:57,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-10 06:57:57,035 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 159 flow. Second operand 6 states and 116 transitions. [2025-01-10 06:57:57,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 695 flow [2025-01-10 06:57:57,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 645 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:57,039 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 155 flow [2025-01-10 06:57:57,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-01-10 06:57:57,039 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2025-01-10 06:57:57,039 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 155 flow [2025-01-10 06:57:57,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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) [2025-01-10 06:57:57,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,040 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:57:57,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:57,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:57,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,242 INFO L85 PathProgramCache]: Analyzing trace with hash -823470907, now seen corresponding path program 1 times [2025-01-10 06:57:57,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458112543] [2025-01-10 06:57:57,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:57,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:57,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458112543] [2025-01-10 06:57:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458112543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696306350] [2025-01-10 06:57:57,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:57,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:57,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:57,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:57:57,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:57,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:57,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:57,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:57,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696306350] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:57,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:57:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718505460] [2025-01-10 06:57:57,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:57,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:57,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:57,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 155 flow. Second operand has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 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) [2025-01-10 06:57:57,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:57,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,792 INFO L124 PetriNetUnfolderBase]: 1099/2138 cut-off events. [2025-01-10 06:57:57,792 INFO L125 PetriNetUnfolderBase]: For 2525/2551 co-relation queries the response was YES. [2025-01-10 06:57:57,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6036 conditions, 2138 events. 1099/2138 cut-off events. For 2525/2551 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 11680 event pairs, 372 based on Foata normal form. 117/2246 useless extension candidates. Maximal degree in co-relation 6022. Up to 736 conditions per place. [2025-01-10 06:57:57,808 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 149 selfloop transitions, 9 changer transitions 0/164 dead transitions. [2025-01-10 06:57:57,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 164 transitions, 1155 flow [2025-01-10 06:57:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2025-01-10 06:57:57,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.621875 [2025-01-10 06:57:57,809 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 155 flow. Second operand 10 states and 199 transitions. [2025-01-10 06:57:57,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 164 transitions, 1155 flow [2025-01-10 06:57:57,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 164 transitions, 1140 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:57,817 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 210 flow [2025-01-10 06:57:57,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=210, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-01-10 06:57:57,819 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2025-01-10 06:57:57,820 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 210 flow [2025-01-10 06:57:57,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 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) [2025-01-10 06:57:57,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,821 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:57:58,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:57:58,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:58,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1574024859, now seen corresponding path program 2 times [2025-01-10 06:57:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183865549] [2025-01-10 06:57:58,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 06:57:58,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-01-10 06:57:58,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:58,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183865549] [2025-01-10 06:57:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183865549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047035129] [2025-01-10 06:57:58,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:58,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:58,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:57:58,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 06:57:58,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-01-10 06:57:58,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:58,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:57:58,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:58,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047035129] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:58,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:58,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:57:58,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731428307] [2025-01-10 06:57:58,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:58,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:58,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:57:58,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 210 flow. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 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) [2025-01-10 06:57:58,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:57:58,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:59,094 INFO L124 PetriNetUnfolderBase]: 2694/5145 cut-off events. [2025-01-10 06:57:59,095 INFO L125 PetriNetUnfolderBase]: For 8651/8686 co-relation queries the response was YES. [2025-01-10 06:57:59,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15558 conditions, 5145 events. 2694/5145 cut-off events. For 8651/8686 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 34116 event pairs, 334 based on Foata normal form. 72/5216 useless extension candidates. Maximal degree in co-relation 15542. Up to 1195 conditions per place. [2025-01-10 06:57:59,119 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 30 changer transitions 6/160 dead transitions. [2025-01-10 06:57:59,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 160 transitions, 1219 flow [2025-01-10 06:57:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2025-01-10 06:57:59,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-01-10 06:57:59,121 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 210 flow. Second operand 10 states and 148 transitions. [2025-01-10 06:57:59,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 160 transitions, 1219 flow [2025-01-10 06:57:59,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 160 transitions, 1149 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:59,149 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 470 flow [2025-01-10 06:57:59,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=470, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-01-10 06:57:59,150 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2025-01-10 06:57:59,150 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 470 flow [2025-01-10 06:57:59,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 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) [2025-01-10 06:57:59,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,150 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:57:59,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:59,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:59,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash -174267233, now seen corresponding path program 2 times [2025-01-10 06:57:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814025568] [2025-01-10 06:57:59,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:59,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 06:57:59,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 24 statements. [2025-01-10 06:57:59,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:59,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:59,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814025568] [2025-01-10 06:57:59,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814025568] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822227238] [2025-01-10 06:57:59,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:59,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:59,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:59,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:59,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:57:59,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 06:57:59,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 24 statements. [2025-01-10 06:57:59,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:59,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:57:59,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:59,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822227238] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:59,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:57:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522886686] [2025-01-10 06:57:59,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:59,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:59,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:59,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:59,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:57:59,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 470 flow. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 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) [2025-01-10 06:57:59,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:59,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:57:59,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:00,325 INFO L124 PetriNetUnfolderBase]: 3414/6353 cut-off events. [2025-01-10 06:58:00,325 INFO L125 PetriNetUnfolderBase]: For 14797/14825 co-relation queries the response was YES. [2025-01-10 06:58:00,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21418 conditions, 6353 events. 3414/6353 cut-off events. For 14797/14825 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 42771 event pairs, 392 based on Foata normal form. 98/6449 useless extension candidates. Maximal degree in co-relation 21396. Up to 1641 conditions per place. [2025-01-10 06:58:00,373 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 77 selfloop transitions, 18 changer transitions 98/197 dead transitions. [2025-01-10 06:58:00,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 197 transitions, 1803 flow [2025-01-10 06:58:00,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:58:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:58:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2025-01-10 06:58:00,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.459375 [2025-01-10 06:58:00,374 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 470 flow. Second operand 10 states and 147 transitions. [2025-01-10 06:58:00,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 197 transitions, 1803 flow [2025-01-10 06:58:00,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 197 transitions, 1802 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:00,427 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 556 flow [2025-01-10 06:58:00,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=556, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2025-01-10 06:58:00,428 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2025-01-10 06:58:00,428 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 556 flow [2025-01-10 06:58:00,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 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) [2025-01-10 06:58:00,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:00,428 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:00,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:58:00,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:58:00,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:58:00,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 343368654, now seen corresponding path program 1 times [2025-01-10 06:58:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:00,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570676894] [2025-01-10 06:58:00,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:00,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:58:00,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:58:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:00,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:00,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570676894] [2025-01-10 06:58:00,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570676894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:00,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489084429] [2025-01-10 06:58:00,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:00,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:00,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:00,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:00,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:58:00,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:58:00,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:58:00,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:00,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:00,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:58:00,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:00,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:00,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489084429] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:00,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:00,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-01-10 06:58:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164273978] [2025-01-10 06:58:00,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:00,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:58:00,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:00,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:58:00,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-10 06:58:00,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:58:00,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 556 flow. Second operand has 24 states, 24 states have (on average 12.333333333333334) internal successors, (296), 24 states have internal predecessors, (296), 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) [2025-01-10 06:58:00,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:00,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:58:00,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:01,837 INFO L124 PetriNetUnfolderBase]: 2805/5594 cut-off events. [2025-01-10 06:58:01,837 INFO L125 PetriNetUnfolderBase]: For 27005/27261 co-relation queries the response was YES. [2025-01-10 06:58:01,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22770 conditions, 5594 events. 2805/5594 cut-off events. For 27005/27261 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 36202 event pairs, 340 based on Foata normal form. 192/5774 useless extension candidates. Maximal degree in co-relation 22741. Up to 931 conditions per place. [2025-01-10 06:58:01,870 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 540 selfloop transitions, 42 changer transitions 80/672 dead transitions. [2025-01-10 06:58:01,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 672 transitions, 7118 flow [2025-01-10 06:58:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:58:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:58:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 486 transitions. [2025-01-10 06:58:01,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6903409090909091 [2025-01-10 06:58:01,872 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 556 flow. Second operand 22 states and 486 transitions. [2025-01-10 06:58:01,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 672 transitions, 7118 flow [2025-01-10 06:58:01,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 672 transitions, 6691 flow, removed 213 selfloop flow, removed 4 redundant places. [2025-01-10 06:58:01,905 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 885 flow [2025-01-10 06:58:01,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=885, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2025-01-10 06:58:01,906 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2025-01-10 06:58:01,906 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 885 flow [2025-01-10 06:58:01,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.333333333333334) internal successors, (296), 24 states have internal predecessors, (296), 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) [2025-01-10 06:58:01,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:01,907 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:01,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:58:02,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:02,111 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:58:02,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash -306167316, now seen corresponding path program 1 times [2025-01-10 06:58:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316551200] [2025-01-10 06:58:02,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:02,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:02,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:58:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:58:02,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:02,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316551200] [2025-01-10 06:58:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316551200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755191910] [2025-01-10 06:58:02,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:02,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:02,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:02,227 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:02,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:58:02,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:58:02,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:58:02,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:02,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:02,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:58:02,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:02,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:02,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755191910] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:02,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-01-10 06:58:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011487120] [2025-01-10 06:58:02,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:02,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:58:02,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:02,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:58:02,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-10 06:58:02,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:58:02,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 885 flow. Second operand has 24 states, 24 states have (on average 12.333333333333334) internal successors, (296), 24 states have internal predecessors, (296), 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) [2025-01-10 06:58:02,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:02,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:58:02,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:03,604 INFO L124 PetriNetUnfolderBase]: 5540/11056 cut-off events. [2025-01-10 06:58:03,604 INFO L125 PetriNetUnfolderBase]: For 63997/64055 co-relation queries the response was YES. [2025-01-10 06:58:03,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47591 conditions, 11056 events. 5540/11056 cut-off events. For 63997/64055 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 79361 event pairs, 926 based on Foata normal form. 474/11518 useless extension candidates. Maximal degree in co-relation 47559. Up to 1936 conditions per place. [2025-01-10 06:58:03,660 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 1054 selfloop transitions, 42 changer transitions 20/1126 dead transitions. [2025-01-10 06:58:03,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 1126 transitions, 14497 flow [2025-01-10 06:58:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:58:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:58:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 436 transitions. [2025-01-10 06:58:03,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2025-01-10 06:58:03,664 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 885 flow. Second operand 22 states and 436 transitions. [2025-01-10 06:58:03,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 1126 transitions, 14497 flow [2025-01-10 06:58:03,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 1126 transitions, 12061 flow, removed 840 selfloop flow, removed 9 redundant places. [2025-01-10 06:58:03,744 INFO L231 Difference]: Finished difference. Result has 122 places, 116 transitions, 1137 flow [2025-01-10 06:58:03,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1137, PETRI_PLACES=122, PETRI_TRANSITIONS=116} [2025-01-10 06:58:03,746 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 89 predicate places. [2025-01-10 06:58:03,746 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 116 transitions, 1137 flow [2025-01-10 06:58:03,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.333333333333334) internal successors, (296), 24 states have internal predecessors, (296), 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) [2025-01-10 06:58:03,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:03,747 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:03,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:58:03,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:03,948 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:58:03,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash -949289214, now seen corresponding path program 2 times [2025-01-10 06:58:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:03,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87526806] [2025-01-10 06:58:03,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:03,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:03,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:58:03,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:58:03,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:03,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:04,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:04,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87526806] [2025-01-10 06:58:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87526806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109780084] [2025-01-10 06:58:04,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:04,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:04,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:04,011 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:04,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:58:04,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:58:04,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:58:04,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:04,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:04,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:58:04,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:04,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109780084] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:04,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:04,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:58:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946268951] [2025-01-10 06:58:04,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:04,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:58:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:04,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:58:04,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:58:04,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:58:04,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 116 transitions, 1137 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 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) [2025-01-10 06:58:04,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:04,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:58:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:05,198 INFO L124 PetriNetUnfolderBase]: 5436/11030 cut-off events. [2025-01-10 06:58:05,198 INFO L125 PetriNetUnfolderBase]: For 61141/61144 co-relation queries the response was YES. [2025-01-10 06:58:05,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47739 conditions, 11030 events. 5436/11030 cut-off events. For 61141/61144 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 79184 event pairs, 1701 based on Foata normal form. 70/11098 useless extension candidates. Maximal degree in co-relation 47701. Up to 4612 conditions per place. [2025-01-10 06:58:05,255 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 60 selfloop transitions, 3 changer transitions 130/197 dead transitions. [2025-01-10 06:58:05,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 197 transitions, 2371 flow [2025-01-10 06:58:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:58:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:58:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2025-01-10 06:58:05,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2025-01-10 06:58:05,262 INFO L175 Difference]: Start difference. First operand has 122 places, 116 transitions, 1137 flow. Second operand 8 states and 107 transitions. [2025-01-10 06:58:05,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 197 transitions, 2371 flow [2025-01-10 06:58:05,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 197 transitions, 2029 flow, removed 83 selfloop flow, removed 20 redundant places. [2025-01-10 06:58:05,397 INFO L231 Difference]: Finished difference. Result has 108 places, 64 transitions, 480 flow [2025-01-10 06:58:05,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=480, PETRI_PLACES=108, PETRI_TRANSITIONS=64} [2025-01-10 06:58:05,398 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2025-01-10 06:58:05,398 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 64 transitions, 480 flow [2025-01-10 06:58:05,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 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) [2025-01-10 06:58:05,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:05,399 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:05,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:58:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:05,600 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:58:05,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1602165612, now seen corresponding path program 2 times [2025-01-10 06:58:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515537823] [2025-01-10 06:58:05,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:05,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:58:05,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:58:05,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:05,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:05,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515537823] [2025-01-10 06:58:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515537823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145033470] [2025-01-10 06:58:05,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:05,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:05,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:05,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:05,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:58:05,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:58:05,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:58:05,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:05,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:05,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:58:05,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:05,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145033470] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:05,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:58:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241749461] [2025-01-10 06:58:05,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:05,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:58:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:05,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:58:05,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:58:05,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:58:05,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 64 transitions, 480 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 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) [2025-01-10 06:58:05,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:05,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:58:05,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:06,351 INFO L124 PetriNetUnfolderBase]: 2616/5512 cut-off events. [2025-01-10 06:58:06,352 INFO L125 PetriNetUnfolderBase]: For 19791/19791 co-relation queries the response was YES. [2025-01-10 06:58:06,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19829 conditions, 5512 events. 2616/5512 cut-off events. For 19791/19791 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 34602 event pairs, 368 based on Foata normal form. 79/5590 useless extension candidates. Maximal degree in co-relation 19801. Up to 2191 conditions per place. [2025-01-10 06:58:06,368 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 0 selfloop transitions, 0 changer transitions 122/122 dead transitions. [2025-01-10 06:58:06,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 122 transitions, 1093 flow [2025-01-10 06:58:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:58:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:58:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-01-10 06:58:06,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-01-10 06:58:06,370 INFO L175 Difference]: Start difference. First operand has 108 places, 64 transitions, 480 flow. Second operand 8 states and 96 transitions. [2025-01-10 06:58:06,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 122 transitions, 1093 flow [2025-01-10 06:58:06,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 122 transitions, 835 flow, removed 27 selfloop flow, removed 24 redundant places. [2025-01-10 06:58:06,404 INFO L231 Difference]: Finished difference. Result has 83 places, 0 transitions, 0 flow [2025-01-10 06:58:06,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=83, PETRI_TRANSITIONS=0} [2025-01-10 06:58:06,404 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 50 predicate places. [2025-01-10 06:58:06,404 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 0 transitions, 0 flow [2025-01-10 06:58:06,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 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) [2025-01-10 06:58:06,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-01-10 06:58:06,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-01-10 06:58:06,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 06:58:06,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 06:58:06,608 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:06,616 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:58:06,616 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:58:06,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:58:06 BasicIcfg [2025-01-10 06:58:06,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:58:06,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:58:06,622 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:58:06,622 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:58:06,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:54" (3/4) ... [2025-01-10 06:58:06,624 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:58:06,626 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f1 [2025-01-10 06:58:06,626 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f2 [2025-01-10 06:58:06,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-01-10 06:58:06,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 06:58:06,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 06:58:06,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 06:58:06,681 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:58:06,681 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:58:06,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:58:06,683 INFO L158 Benchmark]: Toolchain (without parser) took 12892.72ms. Allocated memory was 142.6MB in the beginning and 922.7MB in the end (delta: 780.1MB). Free memory was 104.3MB in the beginning and 198.4MB in the end (delta: -94.0MB). Peak memory consumption was 683.4MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,684 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:58:06,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.83ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 84.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.91ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 82.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,685 INFO L158 Benchmark]: Boogie Preprocessor took 35.39ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 81.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:58:06,686 INFO L158 Benchmark]: RCFGBuilder took 365.28ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 59.3MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,686 INFO L158 Benchmark]: TraceAbstraction took 12027.45ms. Allocated memory was 142.6MB in the beginning and 922.7MB in the end (delta: 780.1MB). Free memory was 58.3MB in the beginning and 202.4MB in the end (delta: -144.2MB). Peak memory consumption was 633.1MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,686 INFO L158 Benchmark]: Witness Printer took 59.54ms. Allocated memory is still 922.7MB. Free memory was 202.4MB in the beginning and 198.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:58:06,687 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.83ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 84.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.91ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 82.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.39ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 81.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.28ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 59.3MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12027.45ms. Allocated memory was 142.6MB in the beginning and 922.7MB in the end (delta: 780.1MB). Free memory was 58.3MB in the beginning and 202.4MB in the end (delta: -144.2MB). Peak memory consumption was 633.1MB. Max. memory is 16.1GB. * Witness Printer took 59.54ms. Allocated memory is still 922.7MB. Free memory was 202.4MB in the beginning and 198.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 761]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 761]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 770]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 770]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1780 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1730 mSDsluCounter, 603 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 580 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2981 IncrementalHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 23 mSDtfsCounter, 2981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1137occurred in iteration=12, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 499 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 1767 SizeOfPredicates, 42 NumberOfNonLiveVariables, 770 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 1006/1376 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:58:06,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE