./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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-ext/11_fmaxsymopt.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:54:04,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:54:04,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:54:04,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:54:04,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:54:04,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:54:04,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:54:04,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:54:04,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:54:04,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:54:04,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:54:04,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:54:04,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:54:04,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:54:04,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:54:04,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:54:04,921 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-02-08 13:54:05,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:54:05,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:54:05,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:54:05,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:54:05,157 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:54:05,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-02-08 13:54:06,425 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd9ed283f/a9865f35f4e644388179366beee089e8/FLAG2ff0def04 [2025-02-08 13:54:06,759 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:54:06,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-02-08 13:54:06,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd9ed283f/a9865f35f4e644388179366beee089e8/FLAG2ff0def04 [2025-02-08 13:54:06,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd9ed283f/a9865f35f4e644388179366beee089e8 [2025-02-08 13:54:06,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:54:06,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:54:06,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:54:06,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:54:06,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:54:06,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06, skipping insertion in model container [2025-02-08 13:54:06,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:54:07,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:54:07,091 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:54:07,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:54:07,171 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:54:07,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07 WrapperNode [2025-02-08 13:54:07,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:54:07,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:54:07,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:54:07,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:54:07,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,208 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-02-08 13:54:07,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:54:07,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:54:07,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:54:07,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:54:07,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,232 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-02-08 13:54:07,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:54:07,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:54:07,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:54:07,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:54:07,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:54:07,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:07,288 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-02-08 13:54:07,299 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-02-08 13:54:07,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:54:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:54:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:54:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 13:54:07,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 13:54:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:54:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:54:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:54:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 13:54:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:54:07,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:54:07,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:54:07,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:54:07,317 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 13:54:07,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:54:07,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:54:07,318 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 13:54:07,412 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:54:07,413 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:54:07,589 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 13:54:07,589 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:54:07,705 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:54:07,705 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:54:07,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:07 BoogieIcfgContainer [2025-02-08 13:54:07,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:54:07,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:54:07,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:54:07,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:54:07,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:54:06" (1/3) ... [2025-02-08 13:54:07,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108d50ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:07, skipping insertion in model container [2025-02-08 13:54:07,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (2/3) ... [2025-02-08 13:54:07,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108d50ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:07, skipping insertion in model container [2025-02-08 13:54:07,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:07" (3/3) ... [2025-02-08 13:54:07,727 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-02-08 13:54:07,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:54:07,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 13:54:07,756 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 13:54:07,801 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:07,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 74 flow [2025-02-08 13:54:07,848 INFO L124 PetriNetUnfolderBase]: 3/37 cut-off events. [2025-02-08 13:54:07,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:07,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-02-08 13:54:07,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 35 transitions, 74 flow [2025-02-08 13:54:07,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 35 transitions, 74 flow [2025-02-08 13:54:07,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:07,871 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;@11112720, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:07,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 13:54:07,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:07,875 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 13:54:07,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:07,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:07,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 13:54:07,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:07,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 259395, now seen corresponding path program 1 times [2025-02-08 13:54:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64905397] [2025-02-08 13:54:07,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:07,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:54:07,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:54:07,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:08,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64905397] [2025-02-08 13:54:08,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64905397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:08,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:08,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236565390] [2025-02-08 13:54:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:08,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:08,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:08,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:08,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-02-08 13:54:08,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-02-08 13:54:08,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:08,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-02-08 13:54:08,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:08,181 INFO L124 PetriNetUnfolderBase]: 24/101 cut-off events. [2025-02-08 13:54:08,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:08,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 101 events. 24/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 279 event pairs, 20 based on Foata normal form. 4/94 useless extension candidates. Maximal degree in co-relation 143. Up to 64 conditions per place. [2025-02-08 13:54:08,183 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 19 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-02-08 13:54:08,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 118 flow [2025-02-08 13:54:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-08 13:54:08,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2025-02-08 13:54:08,193 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 74 flow. Second operand 4 states and 79 transitions. [2025-02-08 13:54:08,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 118 flow [2025-02-08 13:54:08,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:08,198 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 94 flow [2025-02-08 13:54:08,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-02-08 13:54:08,202 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-02-08 13:54:08,202 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 94 flow [2025-02-08 13:54:08,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-02-08 13:54:08,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:08,203 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:08,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:54:08,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:08,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash -862086802, now seen corresponding path program 1 times [2025-02-08 13:54:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190070091] [2025-02-08 13:54:08,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:08,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:08,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:08,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:08,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190070091] [2025-02-08 13:54:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190070091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:08,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151460879] [2025-02-08 13:54:08,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:08,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:08,302 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-02-08 13:54:08,303 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-02-08 13:54:08,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:08,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:08,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:54:08,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:54:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151460879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:08,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:54:08,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:54:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511540762] [2025-02-08 13:54:08,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:08,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:54:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:08,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:54:08,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:54:08,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-02-08 13:54:08,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-08 13:54:08,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:08,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-02-08 13:54:08,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:08,564 INFO L124 PetriNetUnfolderBase]: 24/100 cut-off events. [2025-02-08 13:54:08,564 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 13:54:08,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 100 events. 24/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 271 event pairs, 20 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 163. Up to 59 conditions per place. [2025-02-08 13:54:08,565 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 15 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2025-02-08 13:54:08,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 132 flow [2025-02-08 13:54:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:54:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 13:54:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2025-02-08 13:54:08,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-08 13:54:08,567 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 94 flow. Second operand 6 states and 100 transitions. [2025-02-08 13:54:08,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 132 flow [2025-02-08 13:54:08,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:54:08,568 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 100 flow [2025-02-08 13:54:08,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2025-02-08 13:54:08,568 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-02-08 13:54:08,568 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 100 flow [2025-02-08 13:54:08,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-08 13:54:08,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:08,569 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:54:08,577 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-02-08 13:54:08,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:08,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:08,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -954886875, now seen corresponding path program 1 times [2025-02-08 13:54:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:08,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111077133] [2025-02-08 13:54:08,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:08,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:08,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:08,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:54:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111077133] [2025-02-08 13:54:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111077133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:08,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:08,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207864207] [2025-02-08 13:54:08,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:08,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:08,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:08,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:08,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-02-08 13:54:08,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:08,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:08,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-02-08 13:54:08,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:08,863 INFO L124 PetriNetUnfolderBase]: 24/99 cut-off events. [2025-02-08 13:54:08,864 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 13:54:08,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 99 events. 24/99 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 269 event pairs, 20 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 159. Up to 62 conditions per place. [2025-02-08 13:54:08,865 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 16 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2025-02-08 13:54:08,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 136 flow [2025-02-08 13:54:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-08 13:54:08,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-02-08 13:54:08,866 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 100 flow. Second operand 3 states and 58 transitions. [2025-02-08 13:54:08,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 136 flow [2025-02-08 13:54:08,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 114 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 13:54:08,867 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 82 flow [2025-02-08 13:54:08,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-02-08 13:54:08,868 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-02-08 13:54:08,868 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 82 flow [2025-02-08 13:54:08,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:08,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:08,868 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:08,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:54:08,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1450625275, now seen corresponding path program 1 times [2025-02-08 13:54:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703680746] [2025-02-08 13:54:08,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:08,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:08,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:08,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703680746] [2025-02-08 13:54:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703680746] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036489536] [2025-02-08 13:54:08,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:08,934 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-02-08 13:54:08,936 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-02-08 13:54:08,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:08,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:08,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:54:08,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036489536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:09,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 13:54:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69518914] [2025-02-08 13:54:09,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:09,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:54:09,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:09,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:54:09,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:54:09,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-02-08 13:54:09,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 82 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-02-08 13:54:09,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:09,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-02-08 13:54:09,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:09,135 INFO L124 PetriNetUnfolderBase]: 24/103 cut-off events. [2025-02-08 13:54:09,135 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 13:54:09,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 103 events. 24/103 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 263 event pairs, 20 based on Foata normal form. 2/96 useless extension candidates. Maximal degree in co-relation 152. Up to 60 conditions per place. [2025-02-08 13:54:09,136 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 16 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-02-08 13:54:09,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 143 flow [2025-02-08 13:54:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:54:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 13:54:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2025-02-08 13:54:09,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2025-02-08 13:54:09,137 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 82 flow. Second operand 7 states and 116 transitions. [2025-02-08 13:54:09,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 143 flow [2025-02-08 13:54:09,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:09,138 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 108 flow [2025-02-08 13:54:09,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-02-08 13:54:09,139 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2025-02-08 13:54:09,139 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 108 flow [2025-02-08 13:54:09,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-02-08 13:54:09,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:09,139 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 13:54:09,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:54:09,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:09,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:09,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:09,344 INFO L85 PathProgramCache]: Analyzing trace with hash 145245925, now seen corresponding path program 2 times [2025-02-08 13:54:09,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:09,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844143637] [2025-02-08 13:54:09,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:09,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:09,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 13:54:09,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 13:54:09,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:54:09,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844143637] [2025-02-08 13:54:09,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844143637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545701428] [2025-02-08 13:54:09,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:09,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:09,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:09,486 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-02-08 13:54:09,491 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-02-08 13:54:09,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 13:54:09,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 13:54:09,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:54:09,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:09,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:54:09,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545701428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:09,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:09,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-08 13:54:09,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357143043] [2025-02-08 13:54:09,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:09,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 13:54:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:09,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 13:54:09,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 13:54:09,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-02-08 13:54:09,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 108 flow. Second operand has 15 states, 15 states have (on average 14.333333333333334) internal successors, (215), 15 states have internal predecessors, (215), 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-02-08 13:54:09,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:09,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-02-08 13:54:09,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:09,786 INFO L124 PetriNetUnfolderBase]: 24/112 cut-off events. [2025-02-08 13:54:09,787 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 13:54:09,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 112 events. 24/112 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 263 event pairs, 20 based on Foata normal form. 3/106 useless extension candidates. Maximal degree in co-relation 154. Up to 60 conditions per place. [2025-02-08 13:54:09,788 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 16 selfloop transitions, 13 changer transitions 0/42 dead transitions. [2025-02-08 13:54:09,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 42 transitions, 202 flow [2025-02-08 13:54:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 13:54:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 13:54:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 201 transitions. [2025-02-08 13:54:09,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44175824175824174 [2025-02-08 13:54:09,805 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 108 flow. Second operand 13 states and 201 transitions. [2025-02-08 13:54:09,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 42 transitions, 202 flow [2025-02-08 13:54:09,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:09,807 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 181 flow [2025-02-08 13:54:09,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=181, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-02-08 13:54:09,807 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-02-08 13:54:09,807 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 181 flow [2025-02-08 13:54:09,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.333333333333334) internal successors, (215), 15 states have internal predecessors, (215), 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-02-08 13:54:09,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:09,808 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-02-08 13:54:09,814 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-02-08 13:54:10,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:10,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:10,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2084647750, now seen corresponding path program 3 times [2025-02-08 13:54:10,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:10,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814177830] [2025-02-08 13:54:10,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:54:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:10,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 7 equivalence classes. [2025-02-08 13:54:10,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 13:54:10,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 13:54:10,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:10,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:10,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 13:54:10,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 13:54:10,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:10,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:10,090 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:10,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 13:54:10,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-08 13:54:10,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-08 13:54:10,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-08 13:54:10,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-08 13:54:10,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-08 13:54:10,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-08 13:54:10,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-08 13:54:10,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-08 13:54:10,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-08 13:54:10,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-08 13:54:10,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:54:10,094 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-02-08 13:54:10,095 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:10,095 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 13:54:10,124 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:10,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 128 flow [2025-02-08 13:54:10,133 INFO L124 PetriNetUnfolderBase]: 5/64 cut-off events. [2025-02-08 13:54:10,133 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 13:54:10,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 64 events. 5/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 191 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 49. Up to 3 conditions per place. [2025-02-08 13:54:10,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 59 transitions, 128 flow [2025-02-08 13:54:10,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 59 transitions, 128 flow [2025-02-08 13:54:10,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:10,135 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;@11112720, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:10,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 13:54:10,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:10,137 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 13:54:10,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:10,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:10,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 13:54:10,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:10,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash 317982, now seen corresponding path program 1 times [2025-02-08 13:54:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:10,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684936755] [2025-02-08 13:54:10,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:10,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:10,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:54:10,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:54:10,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684936755] [2025-02-08 13:54:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684936755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:10,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:10,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:10,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696086559] [2025-02-08 13:54:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:10,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:10,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:10,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:10,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:10,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-02-08 13:54:10,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-02-08 13:54:10,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:10,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-02-08 13:54:10,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:10,324 INFO L124 PetriNetUnfolderBase]: 640/1297 cut-off events. [2025-02-08 13:54:10,324 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-08 13:54:10,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 1297 events. 640/1297 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7434 event pairs, 570 based on Foata normal form. 70/1268 useless extension candidates. Maximal degree in co-relation 1247. Up to 1043 conditions per place. [2025-02-08 13:54:10,331 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 31 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-02-08 13:54:10,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 194 flow [2025-02-08 13:54:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-02-08 13:54:10,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2025-02-08 13:54:10,333 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 128 flow. Second operand 4 states and 136 transitions. [2025-02-08 13:54:10,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 194 flow [2025-02-08 13:54:10,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:10,334 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 146 flow [2025-02-08 13:54:10,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-02-08 13:54:10,334 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2025-02-08 13:54:10,334 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 146 flow [2025-02-08 13:54:10,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-02-08 13:54:10,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:10,336 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:54:10,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 883337102, now seen corresponding path program 1 times [2025-02-08 13:54:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872605618] [2025-02-08 13:54:10,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:10,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:10,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:10,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872605618] [2025-02-08 13:54:10,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872605618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:10,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352759690] [2025-02-08 13:54:10,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:10,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:10,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:10,395 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-02-08 13:54:10,398 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-02-08 13:54:10,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:10,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:10,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:54:10,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:54:10,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352759690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:10,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:54:10,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:54:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831089858] [2025-02-08 13:54:10,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:10,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:54:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:10,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:54:10,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:54:10,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-02-08 13:54:10,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-02-08 13:54:10,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:10,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-02-08 13:54:10,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:10,663 INFO L124 PetriNetUnfolderBase]: 640/1296 cut-off events. [2025-02-08 13:54:10,664 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-08 13:54:10,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 1296 events. 640/1296 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7403 event pairs, 570 based on Foata normal form. 1/1198 useless extension candidates. Maximal degree in co-relation 2371. Up to 1038 conditions per place. [2025-02-08 13:54:10,671 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 27 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2025-02-08 13:54:10,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 208 flow [2025-02-08 13:54:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:54:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 13:54:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-02-08 13:54:10,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028248587570622 [2025-02-08 13:54:10,672 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 146 flow. Second operand 6 states and 178 transitions. [2025-02-08 13:54:10,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 208 flow [2025-02-08 13:54:10,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 57 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:54:10,674 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 152 flow [2025-02-08 13:54:10,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2025-02-08 13:54:10,674 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2025-02-08 13:54:10,674 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 152 flow [2025-02-08 13:54:10,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-02-08 13:54:10,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:10,674 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:54:10,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:54:10,875 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-02-08 13:54:10,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1613646656, now seen corresponding path program 1 times [2025-02-08 13:54:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605162295] [2025-02-08 13:54:10,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:10,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:10,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:54:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:10,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605162295] [2025-02-08 13:54:10,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605162295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:10,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335670058] [2025-02-08 13:54:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:10,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:10,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:10,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:10,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:10,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-02-08 13:54:10,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-02-08 13:54:10,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:10,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-02-08 13:54:10,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,032 INFO L124 PetriNetUnfolderBase]: 640/1295 cut-off events. [2025-02-08 13:54:11,033 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 13:54:11,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2392 conditions, 1295 events. 640/1295 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7444 event pairs, 570 based on Foata normal form. 1/1198 useless extension candidates. Maximal degree in co-relation 2367. Up to 1041 conditions per place. [2025-02-08 13:54:11,040 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 28 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-02-08 13:54:11,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 56 transitions, 212 flow [2025-02-08 13:54:11,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-02-08 13:54:11,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5819209039548022 [2025-02-08 13:54:11,041 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 152 flow. Second operand 3 states and 103 transitions. [2025-02-08 13:54:11,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 56 transitions, 212 flow [2025-02-08 13:54:11,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 190 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 13:54:11,043 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 134 flow [2025-02-08 13:54:11,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-02-08 13:54:11,044 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-02-08 13:54:11,044 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 134 flow [2025-02-08 13:54:11,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-02-08 13:54:11,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:54:11,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:11,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1404763032, now seen corresponding path program 1 times [2025-02-08 13:54:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-02-08 13:54:11,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:11,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:11,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:11,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-02-08 13:54:11,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170087145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595825607] [2025-02-08 13:54:11,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:11,098 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-02-08 13:54:11,100 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-02-08 13:54:11,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:11,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:11,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:54:11,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:11,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595825607] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:11,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 13:54:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004065338] [2025-02-08 13:54:11,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:11,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:54:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:11,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:54:11,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:54:11,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-02-08 13:54:11,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 134 flow. Second operand has 10 states, 10 states have (on average 25.4) internal successors, (254), 10 states have internal predecessors, (254), 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-02-08 13:54:11,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:11,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-02-08 13:54:11,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,356 INFO L124 PetriNetUnfolderBase]: 640/1299 cut-off events. [2025-02-08 13:54:11,356 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-08 13:54:11,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 1299 events. 640/1299 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7401 event pairs, 570 based on Foata normal form. 2/1204 useless extension candidates. Maximal degree in co-relation 2360. Up to 1039 conditions per place. [2025-02-08 13:54:11,362 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 28 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2025-02-08 13:54:11,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 219 flow [2025-02-08 13:54:11,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:54:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 13:54:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2025-02-08 13:54:11,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4963680387409201 [2025-02-08 13:54:11,364 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 134 flow. Second operand 7 states and 205 transitions. [2025-02-08 13:54:11,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 219 flow [2025-02-08 13:54:11,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:11,367 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 160 flow [2025-02-08 13:54:11,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2025-02-08 13:54:11,367 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2025-02-08 13:54:11,367 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 160 flow [2025-02-08 13:54:11,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.4) internal successors, (254), 10 states have internal predecessors, (254), 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-02-08 13:54:11,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,368 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:54:11,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 13:54:11,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:11,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash -628491672, now seen corresponding path program 2 times [2025-02-08 13:54:11,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892372393] [2025-02-08 13:54:11,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 13:54:11,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-02-08 13:54:11,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:54:11,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:54:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892372393] [2025-02-08 13:54:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892372393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:11,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:11,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351475432] [2025-02-08 13:54:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:11,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:11,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:11,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:11,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:11,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-02-08 13:54:11,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:11,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:11,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-02-08 13:54:11,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,763 INFO L124 PetriNetUnfolderBase]: 698/1534 cut-off events. [2025-02-08 13:54:11,763 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 13:54:11,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2734 conditions, 1534 events. 698/1534 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9513 event pairs, 75 based on Foata normal form. 36/1513 useless extension candidates. Maximal degree in co-relation 2694. Up to 976 conditions per place. [2025-02-08 13:54:11,769 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 48 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-02-08 13:54:11,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 291 flow [2025-02-08 13:54:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-02-08 13:54:11,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 13:54:11,770 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 160 flow. Second operand 3 states and 118 transitions. [2025-02-08 13:54:11,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 291 flow [2025-02-08 13:54:11,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 72 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:11,772 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 158 flow [2025-02-08 13:54:11,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2025-02-08 13:54:11,774 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2025-02-08 13:54:11,774 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 158 flow [2025-02-08 13:54:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:11,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,774 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:54:11,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1991594953, now seen corresponding path program 1 times [2025-02-08 13:54:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111236102] [2025-02-08 13:54:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 13:54:11,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 13:54:11,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:54:11,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:11,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111236102] [2025-02-08 13:54:11,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111236102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:11,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:11,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501267730] [2025-02-08 13:54:11,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:11,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:11,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:11,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:11,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-02-08 13:54:11,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:11,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:11,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-02-08 13:54:11,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,955 INFO L124 PetriNetUnfolderBase]: 640/1299 cut-off events. [2025-02-08 13:54:11,956 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-08 13:54:11,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 1299 events. 640/1299 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7198 event pairs, 264 based on Foata normal form. 36/1287 useless extension candidates. Maximal degree in co-relation 2434. Up to 882 conditions per place. [2025-02-08 13:54:11,960 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 47 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-02-08 13:54:11,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 287 flow [2025-02-08 13:54:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-02-08 13:54:11,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6610169491525424 [2025-02-08 13:54:11,961 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 158 flow. Second operand 3 states and 117 transitions. [2025-02-08 13:54:11,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 287 flow [2025-02-08 13:54:11,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:11,963 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 156 flow [2025-02-08 13:54:11,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-02-08 13:54:11,963 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2025-02-08 13:54:11,963 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 156 flow [2025-02-08 13:54:11,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:11,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,963 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:54:11,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:11,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1412472962, now seen corresponding path program 1 times [2025-02-08 13:54:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625326289] [2025-02-08 13:54:11,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:54:11,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:54:11,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:12,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625326289] [2025-02-08 13:54:12,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625326289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:12,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998185862] [2025-02-08 13:54:12,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:12,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:12,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:12,071 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-02-08 13:54:12,072 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-02-08 13:54:12,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:54:12,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:54:12,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:12,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:54:12,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:12,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998185862] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:12,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-08 13:54:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293880675] [2025-02-08 13:54:12,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:12,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 13:54:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:12,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 13:54:12,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 13:54:12,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-02-08 13:54:12,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 156 flow. Second operand has 15 states, 15 states have (on average 25.4) internal successors, (381), 15 states have internal predecessors, (381), 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-02-08 13:54:12,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:12,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-02-08 13:54:12,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:12,387 INFO L124 PetriNetUnfolderBase]: 640/1306 cut-off events. [2025-02-08 13:54:12,387 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-02-08 13:54:12,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2498 conditions, 1306 events. 640/1306 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7402 event pairs, 570 based on Foata normal form. 3/1214 useless extension candidates. Maximal degree in co-relation 2432. Up to 1039 conditions per place. [2025-02-08 13:54:12,392 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 28 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2025-02-08 13:54:12,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 63 transitions, 274 flow [2025-02-08 13:54:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 13:54:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 13:54:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 356 transitions. [2025-02-08 13:54:12,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4641460234680574 [2025-02-08 13:54:12,394 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 156 flow. Second operand 13 states and 356 transitions. [2025-02-08 13:54:12,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 63 transitions, 274 flow [2025-02-08 13:54:12,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 63 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:12,395 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 229 flow [2025-02-08 13:54:12,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=229, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2025-02-08 13:54:12,396 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2025-02-08 13:54:12,396 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 229 flow [2025-02-08 13:54:12,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 25.4) internal successors, (381), 15 states have internal predecessors, (381), 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-02-08 13:54:12,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:12,396 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 13:54:12,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:54:12,597 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,SelfDestructingSolverStorable12 [2025-02-08 13:54:12,597 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:12,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1215136754, now seen corresponding path program 2 times [2025-02-08 13:54:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056640750] [2025-02-08 13:54:12,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:12,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 13:54:12,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 13:54:12,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:54:12,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:12,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:12,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 13:54:12,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 13:54:12,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:12,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:12,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:12,631 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:12,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 13:54:12,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-02-08 13:54:12,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-02-08 13:54:12,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-02-08 13:54:12,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:54:12,632 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-02-08 13:54:12,633 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:12,633 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 13:54:12,651 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:12,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 83 transitions, 184 flow [2025-02-08 13:54:12,657 INFO L124 PetriNetUnfolderBase]: 7/91 cut-off events. [2025-02-08 13:54:12,657 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 13:54:12,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 91 events. 7/91 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 317 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 72. Up to 4 conditions per place. [2025-02-08 13:54:12,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 83 transitions, 184 flow [2025-02-08 13:54:12,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 83 transitions, 184 flow [2025-02-08 13:54:12,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:12,660 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;@11112720, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:12,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 13:54:12,661 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:12,661 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 13:54:12,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:12,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:12,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 13:54:12,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 400401, now seen corresponding path program 1 times [2025-02-08 13:54:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697226770] [2025-02-08 13:54:12,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:12,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:54:12,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:54:12,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:12,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:12,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:12,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697226770] [2025-02-08 13:54:12,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697226770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:12,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:12,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420835339] [2025-02-08 13:54:12,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:12,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:12,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:12,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:12,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:12,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:12,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-02-08 13:54:12,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:12,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:12,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:13,771 INFO L124 PetriNetUnfolderBase]: 11409/17871 cut-off events. [2025-02-08 13:54:13,772 INFO L125 PetriNetUnfolderBase]: For 787/787 co-relation queries the response was YES. [2025-02-08 13:54:13,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34201 conditions, 17871 events. 11409/17871 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 126233 event pairs, 10250 based on Foata normal form. 1159/18127 useless extension candidates. Maximal degree in co-relation 11279. Up to 15805 conditions per place. [2025-02-08 13:54:13,873 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 43 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-02-08 13:54:13,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 81 transitions, 272 flow [2025-02-08 13:54:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-02-08 13:54:13,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813253012048193 [2025-02-08 13:54:13,875 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 184 flow. Second operand 4 states and 193 transitions. [2025-02-08 13:54:13,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 81 transitions, 272 flow [2025-02-08 13:54:13,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 270 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:13,877 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 198 flow [2025-02-08 13:54:13,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-02-08 13:54:13,879 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 4 predicate places. [2025-02-08 13:54:13,879 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 198 flow [2025-02-08 13:54:13,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-02-08 13:54:13,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:13,879 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:13,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:54:13,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:13,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash -956203346, now seen corresponding path program 1 times [2025-02-08 13:54:13,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:13,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032962766] [2025-02-08 13:54:13,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:13,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:13,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:13,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:13,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:13,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032962766] [2025-02-08 13:54:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032962766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082765050] [2025-02-08 13:54:13,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:13,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:13,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:13,930 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-02-08 13:54:13,931 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-02-08 13:54:13,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:13,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:13,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:13,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:13,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:54:13,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:14,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:54:14,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082765050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:14,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:54:14,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:54:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974533572] [2025-02-08 13:54:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:14,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:54:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:14,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:54:14,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:54:14,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:14,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 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-02-08 13:54:14,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:14,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:14,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:14,938 INFO L124 PetriNetUnfolderBase]: 11409/17870 cut-off events. [2025-02-08 13:54:14,939 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2025-02-08 13:54:14,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34090 conditions, 17870 events. 11409/17870 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 126066 event pairs, 10250 based on Foata normal form. 1/16968 useless extension candidates. Maximal degree in co-relation 34070. Up to 15800 conditions per place. [2025-02-08 13:54:15,009 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 39 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2025-02-08 13:54:15,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 80 transitions, 284 flow [2025-02-08 13:54:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:54:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 13:54:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 256 transitions. [2025-02-08 13:54:15,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5140562248995983 [2025-02-08 13:54:15,011 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 198 flow. Second operand 6 states and 256 transitions. [2025-02-08 13:54:15,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 80 transitions, 284 flow [2025-02-08 13:54:15,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 80 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:54:15,012 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 204 flow [2025-02-08 13:54:15,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2025-02-08 13:54:15,013 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-02-08 13:54:15,013 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 204 flow [2025-02-08 13:54:15,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 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-02-08 13:54:15,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:15,013 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:54:15,019 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-02-08 13:54:15,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:15,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:15,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 422467699, now seen corresponding path program 1 times [2025-02-08 13:54:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34690175] [2025-02-08 13:54:15,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:15,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:15,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:15,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:15,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:15,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:54:15,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:15,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34690175] [2025-02-08 13:54:15,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34690175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:15,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:15,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:15,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135324517] [2025-02-08 13:54:15,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:15,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:15,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:15,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:15,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:15,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-02-08 13:54:15,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:15,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:15,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:16,547 INFO L124 PetriNetUnfolderBase]: 11409/17869 cut-off events. [2025-02-08 13:54:16,547 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2025-02-08 13:54:16,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34092 conditions, 17869 events. 11409/17869 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 126119 event pairs, 10250 based on Foata normal form. 1/16968 useless extension candidates. Maximal degree in co-relation 34066. Up to 15803 conditions per place. [2025-02-08 13:54:16,606 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 40 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-02-08 13:54:16,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 79 transitions, 288 flow [2025-02-08 13:54:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-02-08 13:54:16,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5943775100401606 [2025-02-08 13:54:16,608 INFO L175 Difference]: Start difference. First operand has 90 places, 80 transitions, 204 flow. Second operand 3 states and 148 transitions. [2025-02-08 13:54:16,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 79 transitions, 288 flow [2025-02-08 13:54:16,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 79 transitions, 266 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 13:54:16,610 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 186 flow [2025-02-08 13:54:16,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-02-08 13:54:16,610 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2025-02-08 13:54:16,610 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 186 flow [2025-02-08 13:54:16,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-02-08 13:54:16,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:16,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:16,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:54:16,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1498463441, now seen corresponding path program 1 times [2025-02-08 13:54:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40189398] [2025-02-08 13:54:16,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:16,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:16,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:16,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:16,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40189398] [2025-02-08 13:54:16,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40189398] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:16,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410891279] [2025-02-08 13:54:16,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:16,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:16,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:16,646 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-02-08 13:54:16,647 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-02-08 13:54:16,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:16,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:16,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:16,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:16,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:54:16,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:16,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:16,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410891279] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:16,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:16,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 13:54:16,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515622056] [2025-02-08 13:54:16,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:16,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:54:16,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:16,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:54:16,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:54:16,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:16,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 186 flow. Second operand has 10 states, 10 states have (on average 36.4) internal successors, (364), 10 states have internal predecessors, (364), 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-02-08 13:54:16,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:16,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:16,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:17,626 INFO L124 PetriNetUnfolderBase]: 11409/17873 cut-off events. [2025-02-08 13:54:17,626 INFO L125 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2025-02-08 13:54:17,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34095 conditions, 17873 events. 11409/17873 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 126054 event pairs, 10250 based on Foata normal form. 2/16974 useless extension candidates. Maximal degree in co-relation 34059. Up to 15801 conditions per place. [2025-02-08 13:54:17,693 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 40 selfloop transitions, 7 changer transitions 0/82 dead transitions. [2025-02-08 13:54:17,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 82 transitions, 295 flow [2025-02-08 13:54:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:54:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 13:54:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 294 transitions. [2025-02-08 13:54:17,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2025-02-08 13:54:17,695 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 186 flow. Second operand 7 states and 294 transitions. [2025-02-08 13:54:17,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 82 transitions, 295 flow [2025-02-08 13:54:17,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 82 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:17,696 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 212 flow [2025-02-08 13:54:17,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2025-02-08 13:54:17,696 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 8 predicate places. [2025-02-08 13:54:17,697 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 212 flow [2025-02-08 13:54:17,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.4) internal successors, (364), 10 states have internal predecessors, (364), 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-02-08 13:54:17,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:17,697 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:17,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 13:54:17,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 13:54:17,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:17,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash 539369969, now seen corresponding path program 2 times [2025-02-08 13:54:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:17,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328730285] [2025-02-08 13:54:17,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:17,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:17,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 13:54:17,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-02-08 13:54:17,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:54:17,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:54:17,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:17,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328730285] [2025-02-08 13:54:17,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328730285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:17,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:17,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970626035] [2025-02-08 13:54:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:17,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:17,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:17,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:17,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:17,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-02-08 13:54:17,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:17,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:17,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:18,882 INFO L124 PetriNetUnfolderBase]: 12446/21367 cut-off events. [2025-02-08 13:54:18,883 INFO L125 PetriNetUnfolderBase]: For 463/463 co-relation queries the response was YES. [2025-02-08 13:54:18,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39068 conditions, 21367 events. 12446/21367 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 176668 event pairs, 1538 based on Foata normal form. 399/21118 useless extension candidates. Maximal degree in co-relation 39027. Up to 14759 conditions per place. [2025-02-08 13:54:18,966 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 72 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-02-08 13:54:18,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 107 transitions, 420 flow [2025-02-08 13:54:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-02-08 13:54:18,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028112449799196 [2025-02-08 13:54:18,968 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 212 flow. Second operand 3 states and 175 transitions. [2025-02-08 13:54:18,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 107 transitions, 420 flow [2025-02-08 13:54:18,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 107 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:18,969 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 210 flow [2025-02-08 13:54:18,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2025-02-08 13:54:18,974 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-02-08 13:54:18,974 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 210 flow [2025-02-08 13:54:18,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-02-08 13:54:18,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:18,974 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 13:54:18,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:18,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -459399757, now seen corresponding path program 1 times [2025-02-08 13:54:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417465964] [2025-02-08 13:54:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:18,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 13:54:18,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 13:54:18,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:18,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:54:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417465964] [2025-02-08 13:54:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417465964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:19,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559948024] [2025-02-08 13:54:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:19,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:19,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:19,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:19,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:19,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:19,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-02-08 13:54:19,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:19,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:19,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:20,258 INFO L124 PetriNetUnfolderBase]: 11409/17861 cut-off events. [2025-02-08 13:54:20,259 INFO L125 PetriNetUnfolderBase]: For 1098/1098 co-relation queries the response was YES. [2025-02-08 13:54:20,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34887 conditions, 17861 events. 11409/17861 cut-off events. For 1098/1098 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 124401 event pairs, 6275 based on Foata normal form. 399/17738 useless extension candidates. Maximal degree in co-relation 34847. Up to 13323 conditions per place. [2025-02-08 13:54:20,315 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 71 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2025-02-08 13:54:20,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 106 transitions, 416 flow [2025-02-08 13:54:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-02-08 13:54:20,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2025-02-08 13:54:20,316 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 210 flow. Second operand 3 states and 174 transitions. [2025-02-08 13:54:20,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 106 transitions, 416 flow [2025-02-08 13:54:20,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 106 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:20,320 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 208 flow [2025-02-08 13:54:20,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2025-02-08 13:54:20,320 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2025-02-08 13:54:20,320 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 208 flow [2025-02-08 13:54:20,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-02-08 13:54:20,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:20,321 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:20,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 13:54:20,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:20,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:20,321 INFO L85 PathProgramCache]: Analyzing trace with hash -350612497, now seen corresponding path program 1 times [2025-02-08 13:54:20,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:20,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361690138] [2025-02-08 13:54:20,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:20,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:20,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:54:20,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:54:20,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:20,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:20,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361690138] [2025-02-08 13:54:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361690138] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869662946] [2025-02-08 13:54:20,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:20,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:20,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:20,385 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-02-08 13:54:20,386 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-02-08 13:54:20,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:54:20,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:54:20,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:20,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:20,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:54:20,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:20,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:20,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869662946] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:20,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:20,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-08 13:54:20,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072159083] [2025-02-08 13:54:20,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:20,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 13:54:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:20,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 13:54:20,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 13:54:20,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:20,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 208 flow. Second operand has 15 states, 15 states have (on average 36.46666666666667) internal successors, (547), 15 states have internal predecessors, (547), 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-02-08 13:54:20,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:20,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:20,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:21,385 INFO L124 PetriNetUnfolderBase]: 11409/17880 cut-off events. [2025-02-08 13:54:21,386 INFO L125 PetriNetUnfolderBase]: For 1099/1099 co-relation queries the response was YES. [2025-02-08 13:54:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34924 conditions, 17880 events. 11409/17880 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 126125 event pairs, 10250 based on Foata normal form. 3/16984 useless extension candidates. Maximal degree in co-relation 34857. Up to 15801 conditions per place. [2025-02-08 13:54:21,481 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 40 selfloop transitions, 13 changer transitions 0/86 dead transitions. [2025-02-08 13:54:21,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 86 transitions, 350 flow [2025-02-08 13:54:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 13:54:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 13:54:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 511 transitions. [2025-02-08 13:54:21,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4735866543095459 [2025-02-08 13:54:21,485 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 208 flow. Second operand 13 states and 511 transitions. [2025-02-08 13:54:21,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 86 transitions, 350 flow [2025-02-08 13:54:21,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 86 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:21,497 INFO L231 Difference]: Finished difference. Result has 102 places, 86 transitions, 281 flow [2025-02-08 13:54:21,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=281, PETRI_PLACES=102, PETRI_TRANSITIONS=86} [2025-02-08 13:54:21,498 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 19 predicate places. [2025-02-08 13:54:21,498 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 86 transitions, 281 flow [2025-02-08 13:54:21,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 36.46666666666667) internal successors, (547), 15 states have internal predecessors, (547), 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-02-08 13:54:21,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:21,499 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:21,504 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-02-08 13:54:21,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:21,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:21,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1937419860, now seen corresponding path program 2 times [2025-02-08 13:54:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-02-08 13:54:21,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:21,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:21,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 13:54:21,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 28 statements. [2025-02-08 13:54:21,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:54:21,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 13:54:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-02-08 13:54:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739129655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:21,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449806614] [2025-02-08 13:54:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:21,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:21,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:21,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:21,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:21,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 86 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-02-08 13:54:21,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:21,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:21,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:22,842 INFO L124 PetriNetUnfolderBase]: 12443/18957 cut-off events. [2025-02-08 13:54:22,842 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2025-02-08 13:54:22,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36689 conditions, 18957 events. 12443/18957 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 129813 event pairs, 4775 based on Foata normal form. 396/18983 useless extension candidates. Maximal degree in co-relation 36602. Up to 14696 conditions per place. [2025-02-08 13:54:22,941 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 77 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-02-08 13:54:22,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 110 transitions, 492 flow [2025-02-08 13:54:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-02-08 13:54:22,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2025-02-08 13:54:22,942 INFO L175 Difference]: Start difference. First operand has 102 places, 86 transitions, 281 flow. Second operand 3 states and 174 transitions. [2025-02-08 13:54:22,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 110 transitions, 492 flow [2025-02-08 13:54:22,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 110 transitions, 482 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 13:54:22,944 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 273 flow [2025-02-08 13:54:22,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2025-02-08 13:54:22,945 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 16 predicate places. [2025-02-08 13:54:22,945 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 273 flow [2025-02-08 13:54:22,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-02-08 13:54:22,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:22,945 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:22,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 13:54:22,945 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash 69526895, now seen corresponding path program 1 times [2025-02-08 13:54:22,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-02-08 13:54:22,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:22,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:54:22,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:54:22,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:22,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 13:54:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-02-08 13:54:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78794410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016461498] [2025-02-08 13:54:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:23,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:23,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:23,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:23,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:23,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-02-08 13:54:23,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:23,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:23,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:23,923 INFO L124 PetriNetUnfolderBase]: 11409/19912 cut-off events. [2025-02-08 13:54:23,923 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2025-02-08 13:54:23,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36969 conditions, 19912 events. 11409/19912 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 163890 event pairs, 1565 based on Foata normal form. 396/19722 useless extension candidates. Maximal degree in co-relation 36886. Up to 13266 conditions per place. [2025-02-08 13:54:24,025 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 76 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-02-08 13:54:24,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 482 flow [2025-02-08 13:54:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-02-08 13:54:24,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6947791164658634 [2025-02-08 13:54:24,026 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 273 flow. Second operand 3 states and 173 transitions. [2025-02-08 13:54:24,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 482 flow [2025-02-08 13:54:24,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 109 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:24,030 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 271 flow [2025-02-08 13:54:24,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2025-02-08 13:54:24,031 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 15 predicate places. [2025-02-08 13:54:24,031 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 271 flow [2025-02-08 13:54:24,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-02-08 13:54:24,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:24,031 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:24,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 13:54:24,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 136612922, now seen corresponding path program 1 times [2025-02-08 13:54:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:24,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-02-08 13:54:24,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:24,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:54:24,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:54:24,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:24,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 13:54:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:24,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-02-08 13:54:24,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136880358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:24,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:24,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:54:24,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999798975] [2025-02-08 13:54:24,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:24,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:24,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:24,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:24,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:24,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:24,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-08 13:54:24,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:24,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:24,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:25,085 INFO L124 PetriNetUnfolderBase]: 12446/19468 cut-off events. [2025-02-08 13:54:25,086 INFO L125 PetriNetUnfolderBase]: For 1088/1088 co-relation queries the response was YES. [2025-02-08 13:54:25,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38069 conditions, 19468 events. 12446/19468 cut-off events. For 1088/1088 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 138849 event pairs, 5654 based on Foata normal form. 399/19012 useless extension candidates. Maximal degree in co-relation 37986. Up to 11887 conditions per place. [2025-02-08 13:54:25,177 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 102 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-02-08 13:54:25,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 135 transitions, 613 flow [2025-02-08 13:54:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2025-02-08 13:54:25,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-02-08 13:54:25,179 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 271 flow. Second operand 4 states and 236 transitions. [2025-02-08 13:54:25,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 135 transitions, 613 flow [2025-02-08 13:54:25,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 135 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:25,196 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 273 flow [2025-02-08 13:54:25,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2025-02-08 13:54:25,196 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 15 predicate places. [2025-02-08 13:54:25,197 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 273 flow [2025-02-08 13:54:25,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-08 13:54:25,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:25,197 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:25,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 13:54:25,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:25,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -59966315, now seen corresponding path program 1 times [2025-02-08 13:54:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-02-08 13:54:25,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:25,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 13:54:25,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 13:54:25,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:25,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 13:54:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:25,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-02-08 13:54:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587925555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:25,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:25,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:54:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482953144] [2025-02-08 13:54:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:25,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:25,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:25,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-02-08 13:54:25,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-08 13:54:25,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:25,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-02-08 13:54:25,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:27,070 INFO L124 PetriNetUnfolderBase]: 22178/35163 cut-off events. [2025-02-08 13:54:27,073 INFO L125 PetriNetUnfolderBase]: For 2438/2438 co-relation queries the response was YES. [2025-02-08 13:54:27,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69340 conditions, 35163 events. 22178/35163 cut-off events. For 2438/2438 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 278721 event pairs, 11218 based on Foata normal form. 399/34833 useless extension candidates. Maximal degree in co-relation 69257. Up to 17649 conditions per place. [2025-02-08 13:54:27,310 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 112 selfloop transitions, 4 changer transitions 0/145 dead transitions. [2025-02-08 13:54:27,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 145 transitions, 655 flow [2025-02-08 13:54:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-02-08 13:54:27,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7409638554216867 [2025-02-08 13:54:27,312 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 273 flow. Second operand 4 states and 246 transitions. [2025-02-08 13:54:27,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 145 transitions, 655 flow [2025-02-08 13:54:27,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 145 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 13:54:27,372 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 292 flow [2025-02-08 13:54:27,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2025-02-08 13:54:27,373 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 17 predicate places. [2025-02-08 13:54:27,373 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 292 flow [2025-02-08 13:54:27,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-08 13:54:27,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:27,373 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:27,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 13:54:27,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash 461305415, now seen corresponding path program 1 times [2025-02-08 13:54:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:27,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881911690] [2025-02-08 13:54:27,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:27,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:27,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 13:54:27,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 13:54:27,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:27,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:27,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:27,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 13:54:27,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 13:54:27,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:27,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:27,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:27,400 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:27,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-02-08 13:54:27,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-02-08 13:54:27,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-02-08 13:54:27,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-02-08 13:54:27,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-02-08 13:54:27,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 13:54:27,402 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:27,402 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:27,402 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 13:54:27,422 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:27,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 107 transitions, 242 flow [2025-02-08 13:54:27,427 INFO L124 PetriNetUnfolderBase]: 9/118 cut-off events. [2025-02-08 13:54:27,427 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 13:54:27,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 118 events. 9/118 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 451 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 99. Up to 5 conditions per place. [2025-02-08 13:54:27,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 107 transitions, 242 flow [2025-02-08 13:54:27,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 107 transitions, 242 flow [2025-02-08 13:54:27,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:27,429 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;@11112720, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:27,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 13:54:27,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:27,430 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 13:54:27,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:27,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:27,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 13:54:27,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 13:54:27,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash 506652, now seen corresponding path program 1 times [2025-02-08 13:54:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139130057] [2025-02-08 13:54:27,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:27,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:54:27,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:54:27,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:27,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:27,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139130057] [2025-02-08 13:54:27,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139130057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:27,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:27,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794694622] [2025-02-08 13:54:27,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:27,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:27,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:27,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:27,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:27,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 107 [2025-02-08 13:54:27,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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-02-08 13:54:27,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:27,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 107 [2025-02-08 13:54:27,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:41,350 INFO L124 PetriNetUnfolderBase]: 173791/242014 cut-off events. [2025-02-08 13:54:41,350 INFO L125 PetriNetUnfolderBase]: For 14759/14759 co-relation queries the response was YES. [2025-02-08 13:54:41,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471305 conditions, 242014 events. 173791/242014 cut-off events. For 14759/14759 co-relation queries the response was YES. Maximal size of possible extension queue 7906. Compared 1887691 event pairs, 156660 based on Foata normal form. 17131/250208 useless extension candidates. Maximal degree in co-relation 54719. Up to 222110 conditions per place. [2025-02-08 13:54:42,493 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 55 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-02-08 13:54:42,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 352 flow [2025-02-08 13:54:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-02-08 13:54:42,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5841121495327103 [2025-02-08 13:54:42,495 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 242 flow. Second operand 4 states and 250 transitions. [2025-02-08 13:54:42,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 352 flow [2025-02-08 13:54:42,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 346 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:42,501 INFO L231 Difference]: Finished difference. Result has 111 places, 104 transitions, 250 flow [2025-02-08 13:54:42,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2025-02-08 13:54:42,501 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2025-02-08 13:54:42,501 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 250 flow [2025-02-08 13:54:42,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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-02-08 13:54:42,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:42,501 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:42,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 13:54:42,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 13:54:42,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2085740850, now seen corresponding path program 1 times [2025-02-08 13:54:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992384844] [2025-02-08 13:54:42,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:42,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:42,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:42,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:42,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992384844] [2025-02-08 13:54:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992384844] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205411651] [2025-02-08 13:54:42,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:42,535 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-02-08 13:54:42,537 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-02-08 13:54:42,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:42,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:42,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:42,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:42,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:54:42,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:42,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:54:42,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205411651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:42,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:54:42,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:54:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583714935] [2025-02-08 13:54:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:42,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:54:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:42,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:54:42,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:54:42,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 107 [2025-02-08 13:54:42,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 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-02-08 13:54:42,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:42,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 107 [2025-02-08 13:54:42,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand