./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/weaver/popl20-bad-counter-queue.wvr.c -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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:51:22,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:51:23,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:51:23,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:51:23,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:51:23,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:51:23,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:51:23,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:51:23,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:51:23,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:51:23,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:51:23,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:51:23,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:51:23,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:51:23,053 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:51:23,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:51:23,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:51:23,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:51:23,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:51:23,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:51:23,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:51:23,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:51:23,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:51:23,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:51:23,056 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-02-06 18:51:23,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:51:23,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:51:23,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:51:23,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:51:23,291 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:51:23,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-06 18:51:24,433 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bfc8e3da/d57d9ba5ccde48c9a3cafb024857a50a/FLAG8e606773f [2025-02-06 18:51:24,671 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:51:24,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-06 18:51:24,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bfc8e3da/d57d9ba5ccde48c9a3cafb024857a50a/FLAG8e606773f [2025-02-06 18:51:24,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bfc8e3da/d57d9ba5ccde48c9a3cafb024857a50a [2025-02-06 18:51:24,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:51:24,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:51:24,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:51:24,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:51:24,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:51:24,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b91a4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24, skipping insertion in model container [2025-02-06 18:51:24,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:51:24,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:51:24,871 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:51:24,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:51:24,895 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:51:24,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24 WrapperNode [2025-02-06 18:51:24,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:51:24,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:51:24,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:51:24,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:51:24,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,921 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 161 [2025-02-06 18:51:24,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:51:24,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:51:24,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:51:24,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:51:24,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,953 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 18:51:24,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:51:24,968 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:51:24,968 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:51:24,968 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:51:24,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (1/1) ... [2025-02-06 18:51:24,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:51:24,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:24,997 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-06 18:51:25,007 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-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:51:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:51:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:51:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:51:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:51:25,024 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:51:25,087 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:51:25,088 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:51:25,316 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:51:25,317 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:51:25,478 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:51:25,479 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:51:25,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:51:25 BoogieIcfgContainer [2025-02-06 18:51:25,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:51:25,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:51:25,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:51:25,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:51:25,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:51:24" (1/3) ... [2025-02-06 18:51:25,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6814d9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:51:25, skipping insertion in model container [2025-02-06 18:51:25,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:24" (2/3) ... [2025-02-06 18:51:25,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6814d9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:51:25, skipping insertion in model container [2025-02-06 18:51:25,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:51:25" (3/3) ... [2025-02-06 18:51:25,487 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-02-06 18:51:25,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:51:25,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 64 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-02-06 18:51:25,500 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:51:25,560 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:51:25,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions, 154 flow [2025-02-06 18:51:25,623 INFO L124 PetriNetUnfolderBase]: 7/68 cut-off events. [2025-02-06 18:51:25,627 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 18:51:25,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 68 events. 7/68 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2025-02-06 18:51:25,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 70 transitions, 154 flow [2025-02-06 18:51:25,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 66 transitions, 141 flow [2025-02-06 18:51:25,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:51:25,654 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;@58753ed5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:51:25,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-06 18:51:25,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:51:25,658 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-06 18:51:25,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:51:25,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:25,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 18:51:25,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:25,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash 470822, now seen corresponding path program 1 times [2025-02-06 18:51:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117865313] [2025-02-06 18:51:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:25,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:51:25,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:51:25,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:25,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:25,884 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-06 18:51:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:25,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117865313] [2025-02-06 18:51:25,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117865313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:25,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:25,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:51:25,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907839039] [2025-02-06 18:51:25,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:25,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:25,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:25,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-02-06 18:51:25,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 141 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-06 18:51:25,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:25,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-02-06 18:51:25,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:26,176 INFO L124 PetriNetUnfolderBase]: 425/1058 cut-off events. [2025-02-06 18:51:26,176 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 18:51:26,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1058 events. 425/1058 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6731 event pairs, 290 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 1674. Up to 666 conditions per place. [2025-02-06 18:51:26,186 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 32 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-02-06 18:51:26,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 219 flow [2025-02-06 18:51:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2025-02-06 18:51:26,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-02-06 18:51:26,196 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 141 flow. Second operand 4 states and 178 transitions. [2025-02-06 18:51:26,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 219 flow [2025-02-06 18:51:26,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 69 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:51:26,202 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 165 flow [2025-02-06 18:51:26,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2025-02-06 18:51:26,209 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2025-02-06 18:51:26,209 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 165 flow [2025-02-06 18:51:26,209 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-06 18:51:26,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:26,209 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 18:51:26,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:51:26,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:26,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:26,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1141734880, now seen corresponding path program 1 times [2025-02-06 18:51:26,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:26,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58443582] [2025-02-06 18:51:26,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:26,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:26,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:51:26,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:51:26,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:26,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:26,359 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-06 18:51:26,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:26,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58443582] [2025-02-06 18:51:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58443582] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:26,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789838571] [2025-02-06 18:51:26,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:26,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:26,363 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-06 18:51:26,364 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-06 18:51:26,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:51:26,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:51:26,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:26,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:26,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:51:26,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:26,458 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-06 18:51:26,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:51:26,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789838571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:26,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:51:26,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 18:51:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554565461] [2025-02-06 18:51:26,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:26,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:51:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:26,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:51:26,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:51:26,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-02-06 18:51:26,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 165 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-06 18:51:26,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:26,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-02-06 18:51:26,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:26,667 INFO L124 PetriNetUnfolderBase]: 425/1057 cut-off events. [2025-02-06 18:51:26,667 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 18:51:26,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1057 events. 425/1057 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6754 event pairs, 290 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 1731. Up to 661 conditions per place. [2025-02-06 18:51:26,673 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 28 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-02-06 18:51:26,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 231 flow [2025-02-06 18:51:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:51:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:51:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2025-02-06 18:51:26,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-02-06 18:51:26,674 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 165 flow. Second operand 6 states and 246 transitions. [2025-02-06 18:51:26,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 231 flow [2025-02-06 18:51:26,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:51:26,676 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 172 flow [2025-02-06 18:51:26,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2025-02-06 18:51:26,676 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2025-02-06 18:51:26,676 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 172 flow [2025-02-06 18:51:26,677 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-06 18:51:26,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:26,677 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-06 18:51:26,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 18:51:26,881 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-06 18:51:26,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:26,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:26,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1034043291, now seen corresponding path program 1 times [2025-02-06 18:51:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240483706] [2025-02-06 18:51:26,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:26,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:51:26,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:51:26,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:26,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240483706] [2025-02-06 18:51:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240483706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948949782] [2025-02-06 18:51:26,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:26,939 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-06 18:51:26,940 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-06 18:51:26,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:51:26,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:51:26,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:26,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:26,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:51:26,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:27,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948949782] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:27,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-06 18:51:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361304329] [2025-02-06 18:51:27,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:51:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:27,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:51:27,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:51:27,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-02-06 18:51:27,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 172 flow. Second operand has 12 states, 12 states have (on average 36.083333333333336) internal successors, (433), 12 states have internal predecessors, (433), 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-06 18:51:27,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:27,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-02-06 18:51:27,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:27,227 INFO L124 PetriNetUnfolderBase]: 428/1069 cut-off events. [2025-02-06 18:51:27,227 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 18:51:27,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 1069 events. 428/1069 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6860 event pairs, 290 based on Foata normal form. 3/863 useless extension candidates. Maximal degree in co-relation 1732. Up to 668 conditions per place. [2025-02-06 18:51:27,232 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 31 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2025-02-06 18:51:27,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 314 flow [2025-02-06 18:51:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:51:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:51:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 397 transitions. [2025-02-06 18:51:27,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5671428571428572 [2025-02-06 18:51:27,234 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 172 flow. Second operand 10 states and 397 transitions. [2025-02-06 18:51:27,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 314 flow [2025-02-06 18:51:27,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 268 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 18:51:27,236 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 224 flow [2025-02-06 18:51:27,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=224, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-02-06 18:51:27,236 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2025-02-06 18:51:27,236 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 224 flow [2025-02-06 18:51:27,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 36.083333333333336) internal successors, (433), 12 states have internal predecessors, (433), 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-06 18:51:27,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:27,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:27,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:51:27,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:27,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:27,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1120572038, now seen corresponding path program 1 times [2025-02-06 18:51:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:27,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491329888] [2025-02-06 18:51:27,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:27,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:27,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:51:27,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:51:27,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:27,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:27,476 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-06 18:51:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491329888] [2025-02-06 18:51:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491329888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984470733] [2025-02-06 18:51:27,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:27,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:27,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:27,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:27,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 70 [2025-02-06 18:51:27,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-06 18:51:27,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:27,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 70 [2025-02-06 18:51:27,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:27,673 INFO L124 PetriNetUnfolderBase]: 733/1642 cut-off events. [2025-02-06 18:51:27,673 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-02-06 18:51:27,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 1642 events. 733/1642 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11118 event pairs, 285 based on Foata normal form. 48/1379 useless extension candidates. Maximal degree in co-relation 2836. Up to 634 conditions per place. [2025-02-06 18:51:27,681 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 75 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2025-02-06 18:51:27,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 450 flow [2025-02-06 18:51:27,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-02-06 18:51:27,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-02-06 18:51:27,682 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 224 flow. Second operand 4 states and 195 transitions. [2025-02-06 18:51:27,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 450 flow [2025-02-06 18:51:27,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 108 transitions, 439 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 18:51:27,684 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 247 flow [2025-02-06 18:51:27,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2025-02-06 18:51:27,685 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2025-02-06 18:51:27,685 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 247 flow [2025-02-06 18:51:27,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-06 18:51:27,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:27,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:27,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:51:27,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:27,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash 377995251, now seen corresponding path program 1 times [2025-02-06 18:51:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334976414] [2025-02-06 18:51:27,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:51:27,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:51:27,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:27,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:27,799 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-06 18:51:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334976414] [2025-02-06 18:51:27,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334976414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:51:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894278022] [2025-02-06 18:51:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:27,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:27,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:27,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:27,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 70 [2025-02-06 18:51:27,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 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-06 18:51:27,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:27,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 70 [2025-02-06 18:51:27,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:28,017 INFO L124 PetriNetUnfolderBase]: 606/1560 cut-off events. [2025-02-06 18:51:28,017 INFO L125 PetriNetUnfolderBase]: For 320/352 co-relation queries the response was YES. [2025-02-06 18:51:28,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1560 events. 606/1560 cut-off events. For 320/352 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 11092 event pairs, 397 based on Foata normal form. 41/1342 useless extension candidates. Maximal degree in co-relation 2784. Up to 802 conditions per place. [2025-02-06 18:51:28,025 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 70 selfloop transitions, 5 changer transitions 2/111 dead transitions. [2025-02-06 18:51:28,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 111 transitions, 471 flow [2025-02-06 18:51:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:51:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:51:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2025-02-06 18:51:28,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-02-06 18:51:28,027 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 247 flow. Second operand 5 states and 252 transitions. [2025-02-06 18:51:28,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 111 transitions, 471 flow [2025-02-06 18:51:28,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:28,030 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 272 flow [2025-02-06 18:51:28,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-02-06 18:51:28,031 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2025-02-06 18:51:28,031 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 272 flow [2025-02-06 18:51:28,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 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-06 18:51:28,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:28,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:28,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:51:28,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:28,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1230790016, now seen corresponding path program 1 times [2025-02-06 18:51:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:28,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387850980] [2025-02-06 18:51:28,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:28,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:28,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:51:28,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:51:28,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:28,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:28,074 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-06 18:51:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387850980] [2025-02-06 18:51:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387850980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:28,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:28,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487505091] [2025-02-06 18:51:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:28,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:28,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:28,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:28,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:28,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 70 [2025-02-06 18:51:28,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-06 18:51:28,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:28,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 70 [2025-02-06 18:51:28,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:28,314 INFO L124 PetriNetUnfolderBase]: 1051/2435 cut-off events. [2025-02-06 18:51:28,314 INFO L125 PetriNetUnfolderBase]: For 867/901 co-relation queries the response was YES. [2025-02-06 18:51:28,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4862 conditions, 2435 events. 1051/2435 cut-off events. For 867/901 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17844 event pairs, 417 based on Foata normal form. 88/2153 useless extension candidates. Maximal degree in co-relation 4823. Up to 948 conditions per place. [2025-02-06 18:51:28,326 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 85 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2025-02-06 18:51:28,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 592 flow [2025-02-06 18:51:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-02-06 18:51:28,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6892857142857143 [2025-02-06 18:51:28,327 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 272 flow. Second operand 4 states and 193 transitions. [2025-02-06 18:51:28,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 592 flow [2025-02-06 18:51:28,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 118 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:51:28,331 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 301 flow [2025-02-06 18:51:28,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2025-02-06 18:51:28,332 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places. [2025-02-06 18:51:28,332 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 301 flow [2025-02-06 18:51:28,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-06 18:51:28,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:28,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:28,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:51:28,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:28,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash -500214700, now seen corresponding path program 1 times [2025-02-06 18:51:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11023614] [2025-02-06 18:51:28,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:28,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:51:28,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:51:28,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:28,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:28,392 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-06 18:51:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11023614] [2025-02-06 18:51:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11023614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:28,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:51:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631532765] [2025-02-06 18:51:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:28,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:28,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:28,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:28,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 70 [2025-02-06 18:51:28,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 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-06 18:51:28,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:28,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 70 [2025-02-06 18:51:28,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:28,560 INFO L124 PetriNetUnfolderBase]: 669/1731 cut-off events. [2025-02-06 18:51:28,560 INFO L125 PetriNetUnfolderBase]: For 816/873 co-relation queries the response was YES. [2025-02-06 18:51:28,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 1731 events. 669/1731 cut-off events. For 816/873 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12843 event pairs, 474 based on Foata normal form. 39/1567 useless extension candidates. Maximal degree in co-relation 3543. Up to 994 conditions per place. [2025-02-06 18:51:28,567 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 44 selfloop transitions, 2 changer transitions 14/94 dead transitions. [2025-02-06 18:51:28,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 456 flow [2025-02-06 18:51:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:51:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:51:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-02-06 18:51:28,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6657142857142857 [2025-02-06 18:51:28,568 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 301 flow. Second operand 5 states and 233 transitions. [2025-02-06 18:51:28,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 456 flow [2025-02-06 18:51:28,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:28,571 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 294 flow [2025-02-06 18:51:28,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2025-02-06 18:51:28,572 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 30 predicate places. [2025-02-06 18:51:28,572 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 294 flow [2025-02-06 18:51:28,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 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-06 18:51:28,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:28,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:28,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:51:28,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:28,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:28,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1113090695, now seen corresponding path program 1 times [2025-02-06 18:51:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:28,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923440684] [2025-02-06 18:51:28,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:28,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:51:28,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:51:28,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:28,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:28,745 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-06 18:51:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923440684] [2025-02-06 18:51:28,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923440684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609196648] [2025-02-06 18:51:28,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:28,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:28,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:28,748 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-06 18:51:28,751 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-06 18:51:28,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:51:28,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:51:28,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:28,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:28,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 18:51:28,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:28,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:51:28,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 18:51:28,872 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-06 18:51:28,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:28,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-06 18:51:28,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-06 18:51:28,933 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-06 18:51:28,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609196648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:28,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:28,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 18:51:28,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258740106] [2025-02-06 18:51:28,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:28,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:51:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:28,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:51:28,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:51:28,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 70 [2025-02-06 18:51:28,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 294 flow. Second operand has 13 states, 13 states have (on average 35.38461538461539) internal successors, (460), 13 states have internal predecessors, (460), 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-06 18:51:28,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:28,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 70 [2025-02-06 18:51:28,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:29,466 INFO L124 PetriNetUnfolderBase]: 1403/3495 cut-off events. [2025-02-06 18:51:29,467 INFO L125 PetriNetUnfolderBase]: For 1814/1913 co-relation queries the response was YES. [2025-02-06 18:51:29,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 3495 events. 1403/3495 cut-off events. For 1814/1913 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 27167 event pairs, 405 based on Foata normal form. 57/3166 useless extension candidates. Maximal degree in co-relation 7401. Up to 833 conditions per place. [2025-02-06 18:51:29,482 INFO L140 encePairwiseOnDemand]: 57/70 looper letters, 110 selfloop transitions, 18 changer transitions 0/160 dead transitions. [2025-02-06 18:51:29,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 160 transitions, 840 flow [2025-02-06 18:51:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:51:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:51:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 448 transitions. [2025-02-06 18:51:29,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-02-06 18:51:29,483 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 294 flow. Second operand 10 states and 448 transitions. [2025-02-06 18:51:29,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 160 transitions, 840 flow [2025-02-06 18:51:29,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 160 transitions, 796 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-02-06 18:51:29,489 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 385 flow [2025-02-06 18:51:29,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=385, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2025-02-06 18:51:29,490 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2025-02-06 18:51:29,490 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 385 flow [2025-02-06 18:51:29,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.38461538461539) internal successors, (460), 13 states have internal predecessors, (460), 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-06 18:51:29,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:29,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:29,498 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-06 18:51:29,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:29,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:29,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash -146103484, now seen corresponding path program 1 times [2025-02-06 18:51:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104726097] [2025-02-06 18:51:29,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:29,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:51:29,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:51:29,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:29,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:29,860 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-06 18:51:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104726097] [2025-02-06 18:51:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104726097] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971071333] [2025-02-06 18:51:29,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:29,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:29,862 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-06 18:51:29,863 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-06 18:51:29,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:51:29,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:51:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:29,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 18:51:29,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:29,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:51:29,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 18:51:29,972 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-06 18:51:29,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:30,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 18:51:30,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-06 18:51:30,043 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-06 18:51:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971071333] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:30,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 18:51:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367807599] [2025-02-06 18:51:30,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:30,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:51:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:30,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:51:30,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:51:30,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-02-06 18:51:30,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 385 flow. Second operand has 12 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 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-06 18:51:30,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:30,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-02-06 18:51:30,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:30,644 INFO L124 PetriNetUnfolderBase]: 1672/3706 cut-off events. [2025-02-06 18:51:30,644 INFO L125 PetriNetUnfolderBase]: For 2824/2941 co-relation queries the response was YES. [2025-02-06 18:51:30,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8650 conditions, 3706 events. 1672/3706 cut-off events. For 2824/2941 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 26961 event pairs, 498 based on Foata normal form. 91/3454 useless extension candidates. Maximal degree in co-relation 8611. Up to 1052 conditions per place. [2025-02-06 18:51:30,685 INFO L140 encePairwiseOnDemand]: 57/70 looper letters, 114 selfloop transitions, 18 changer transitions 0/161 dead transitions. [2025-02-06 18:51:30,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 161 transitions, 881 flow [2025-02-06 18:51:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:51:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:51:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 428 transitions. [2025-02-06 18:51:30,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2025-02-06 18:51:30,694 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 385 flow. Second operand 10 states and 428 transitions. [2025-02-06 18:51:30,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 161 transitions, 881 flow [2025-02-06 18:51:30,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 161 transitions, 869 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 18:51:30,709 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 435 flow [2025-02-06 18:51:30,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=435, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2025-02-06 18:51:30,710 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2025-02-06 18:51:30,710 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 435 flow [2025-02-06 18:51:30,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 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-06 18:51:30,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:30,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:30,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:51:30,911 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,SelfDestructingSolverStorable8 [2025-02-06 18:51:30,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:30,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash -234241253, now seen corresponding path program 1 times [2025-02-06 18:51:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932679040] [2025-02-06 18:51:30,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:30,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:51:30,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:51:30,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:30,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:51:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932679040] [2025-02-06 18:51:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932679040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:31,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:31,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:31,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995896210] [2025-02-06 18:51:31,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:31,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:31,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:31,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:31,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 70 [2025-02-06 18:51:31,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-06 18:51:31,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:31,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 70 [2025-02-06 18:51:31,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:31,806 INFO L124 PetriNetUnfolderBase]: 2855/6315 cut-off events. [2025-02-06 18:51:31,806 INFO L125 PetriNetUnfolderBase]: For 6715/6876 co-relation queries the response was YES. [2025-02-06 18:51:31,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15182 conditions, 6315 events. 2855/6315 cut-off events. For 6715/6876 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 52233 event pairs, 619 based on Foata normal form. 179/6011 useless extension candidates. Maximal degree in co-relation 15141. Up to 3087 conditions per place. [2025-02-06 18:51:31,834 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 144 selfloop transitions, 12 changer transitions 0/184 dead transitions. [2025-02-06 18:51:31,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 184 transitions, 1106 flow [2025-02-06 18:51:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:51:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:51:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 334 transitions. [2025-02-06 18:51:31,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816326530612244 [2025-02-06 18:51:31,837 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 435 flow. Second operand 7 states and 334 transitions. [2025-02-06 18:51:31,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 184 transitions, 1106 flow [2025-02-06 18:51:31,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 184 transitions, 1068 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-02-06 18:51:31,847 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 518 flow [2025-02-06 18:51:31,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=518, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2025-02-06 18:51:31,847 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2025-02-06 18:51:31,848 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 518 flow [2025-02-06 18:51:31,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-06 18:51:31,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:31,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:31,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:51:31,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:31,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1085268058, now seen corresponding path program 1 times [2025-02-06 18:51:31,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:31,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177825042] [2025-02-06 18:51:31,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:31,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:51:31,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:51:31,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:31,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:32,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177825042] [2025-02-06 18:51:32,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177825042] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936902112] [2025-02-06 18:51:32,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:32,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:32,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:32,010 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-06 18:51:32,011 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-06 18:51:32,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:51:32,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:51:32,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:32,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:32,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 18:51:32,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:32,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:51:32,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 18:51:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:32,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:32,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 18:51:32,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-06 18:51:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936902112] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:32,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:32,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 18:51:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645625846] [2025-02-06 18:51:32,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:32,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:51:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:32,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:51:32,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:51:32,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 70 [2025-02-06 18:51:32,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 518 flow. Second operand has 13 states, 13 states have (on average 35.69230769230769) internal successors, (464), 13 states have internal predecessors, (464), 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-06 18:51:32,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:32,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 70 [2025-02-06 18:51:32,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:33,102 INFO L124 PetriNetUnfolderBase]: 3060/7501 cut-off events. [2025-02-06 18:51:33,102 INFO L125 PetriNetUnfolderBase]: For 8527/8792 co-relation queries the response was YES. [2025-02-06 18:51:33,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18065 conditions, 7501 events. 3060/7501 cut-off events. For 8527/8792 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 65042 event pairs, 797 based on Foata normal form. 147/6871 useless extension candidates. Maximal degree in co-relation 18023. Up to 1955 conditions per place. [2025-02-06 18:51:33,139 INFO L140 encePairwiseOnDemand]: 57/70 looper letters, 166 selfloop transitions, 18 changer transitions 0/221 dead transitions. [2025-02-06 18:51:33,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 221 transitions, 1602 flow [2025-02-06 18:51:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:51:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:51:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 444 transitions. [2025-02-06 18:51:33,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2025-02-06 18:51:33,141 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 518 flow. Second operand 10 states and 444 transitions. [2025-02-06 18:51:33,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 221 transitions, 1602 flow [2025-02-06 18:51:33,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 221 transitions, 1588 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:33,153 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 621 flow [2025-02-06 18:51:33,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=621, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2025-02-06 18:51:33,154 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 54 predicate places. [2025-02-06 18:51:33,154 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 621 flow [2025-02-06 18:51:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.69230769230769) internal successors, (464), 13 states have internal predecessors, (464), 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-06 18:51:33,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:33,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:33,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 18:51:33,355 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,SelfDestructingSolverStorable10 [2025-02-06 18:51:33,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1328456199, now seen corresponding path program 1 times [2025-02-06 18:51:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:33,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397678810] [2025-02-06 18:51:33,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:33,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:51:33,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:51:33,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:33,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:33,416 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-06 18:51:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397678810] [2025-02-06 18:51:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397678810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:51:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323151496] [2025-02-06 18:51:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:33,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:51:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:33,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:51:33,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:51:33,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 70 [2025-02-06 18:51:33,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 621 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 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-06 18:51:33,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:33,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 70 [2025-02-06 18:51:33,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:34,372 INFO L124 PetriNetUnfolderBase]: 5279/12041 cut-off events. [2025-02-06 18:51:34,372 INFO L125 PetriNetUnfolderBase]: For 17651/18216 co-relation queries the response was YES. [2025-02-06 18:51:34,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32099 conditions, 12041 events. 5279/12041 cut-off events. For 17651/18216 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 108696 event pairs, 1349 based on Foata normal form. 358/11264 useless extension candidates. Maximal degree in co-relation 32050. Up to 5854 conditions per place. [2025-02-06 18:51:34,422 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 183 selfloop transitions, 27 changer transitions 0/240 dead transitions. [2025-02-06 18:51:34,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 240 transitions, 1722 flow [2025-02-06 18:51:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:51:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:51:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 411 transitions. [2025-02-06 18:51:34,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-02-06 18:51:34,423 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 621 flow. Second operand 9 states and 411 transitions. [2025-02-06 18:51:34,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 240 transitions, 1722 flow [2025-02-06 18:51:34,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 240 transitions, 1704 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 18:51:34,450 INFO L231 Difference]: Finished difference. Result has 126 places, 130 transitions, 805 flow [2025-02-06 18:51:34,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=805, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2025-02-06 18:51:34,451 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 60 predicate places. [2025-02-06 18:51:34,451 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 130 transitions, 805 flow [2025-02-06 18:51:34,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 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-06 18:51:34,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:34,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:34,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:51:34,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:34,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:34,452 INFO L85 PathProgramCache]: Analyzing trace with hash -716458850, now seen corresponding path program 1 times [2025-02-06 18:51:34,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:34,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891679517] [2025-02-06 18:51:34,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:34,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:51:34,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:51:34,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:34,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:34,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:34,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891679517] [2025-02-06 18:51:34,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891679517] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:34,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390628368] [2025-02-06 18:51:34,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:34,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:34,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:34,615 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-06 18:51:34,621 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-06 18:51:34,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:51:34,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:51:34,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:34,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:34,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 18:51:34,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:34,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:51:34,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 18:51:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:34,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:34,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-06 18:51:34,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-06 18:51:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390628368] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:34,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 18:51:34,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106502313] [2025-02-06 18:51:34,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:34,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:51:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:34,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:51:34,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:51:34,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-02-06 18:51:34,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 805 flow. Second operand has 13 states, 13 states have (on average 33.84615384615385) internal successors, (440), 13 states have internal predecessors, (440), 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-06 18:51:34,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:34,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-02-06 18:51:34,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:36,126 INFO L124 PetriNetUnfolderBase]: 4068/9107 cut-off events. [2025-02-06 18:51:36,126 INFO L125 PetriNetUnfolderBase]: For 17400/17829 co-relation queries the response was YES. [2025-02-06 18:51:36,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25623 conditions, 9107 events. 4068/9107 cut-off events. For 17400/17829 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 77673 event pairs, 1061 based on Foata normal form. 245/8580 useless extension candidates. Maximal degree in co-relation 25574. Up to 2868 conditions per place. [2025-02-06 18:51:36,171 INFO L140 encePairwiseOnDemand]: 57/70 looper letters, 208 selfloop transitions, 18 changer transitions 0/264 dead transitions. [2025-02-06 18:51:36,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 264 transitions, 2201 flow [2025-02-06 18:51:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:51:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:51:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 424 transitions. [2025-02-06 18:51:36,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2025-02-06 18:51:36,173 INFO L175 Difference]: Start difference. First operand has 126 places, 130 transitions, 805 flow. Second operand 10 states and 424 transitions. [2025-02-06 18:51:36,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 264 transitions, 2201 flow [2025-02-06 18:51:36,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 264 transitions, 2183 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:36,196 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 859 flow [2025-02-06 18:51:36,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=859, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-02-06 18:51:36,197 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 71 predicate places. [2025-02-06 18:51:36,197 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 859 flow [2025-02-06 18:51:36,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.84615384615385) internal successors, (440), 13 states have internal predecessors, (440), 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-06 18:51:36,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:36,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:36,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 18:51:36,402 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-06 18:51:36,402 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -848841406, now seen corresponding path program 1 times [2025-02-06 18:51:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638776566] [2025-02-06 18:51:36,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:36,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:51:36,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:51:36,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:36,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:36,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638776566] [2025-02-06 18:51:36,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638776566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:36,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:36,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:51:36,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593200000] [2025-02-06 18:51:36,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:36,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:36,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:36,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:36,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:36,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 70 [2025-02-06 18:51:36,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 859 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-06 18:51:36,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:36,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 70 [2025-02-06 18:51:36,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:37,432 INFO L124 PetriNetUnfolderBase]: 4494/10026 cut-off events. [2025-02-06 18:51:37,432 INFO L125 PetriNetUnfolderBase]: For 21137/21355 co-relation queries the response was YES. [2025-02-06 18:51:37,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30072 conditions, 10026 events. 4494/10026 cut-off events. For 21137/21355 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 86147 event pairs, 1666 based on Foata normal form. 302/9727 useless extension candidates. Maximal degree in co-relation 30017. Up to 3839 conditions per place. [2025-02-06 18:51:37,488 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 182 selfloop transitions, 21 changer transitions 0/233 dead transitions. [2025-02-06 18:51:37,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 233 transitions, 1900 flow [2025-02-06 18:51:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:51:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:51:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2025-02-06 18:51:37,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-02-06 18:51:37,490 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 859 flow. Second operand 6 states and 274 transitions. [2025-02-06 18:51:37,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 233 transitions, 1900 flow [2025-02-06 18:51:37,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 233 transitions, 1794 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-02-06 18:51:37,540 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 862 flow [2025-02-06 18:51:37,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=862, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-02-06 18:51:37,542 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 69 predicate places. [2025-02-06 18:51:37,542 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 862 flow [2025-02-06 18:51:37,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-06 18:51:37,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:37,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:37,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:51:37,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:37,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:37,543 INFO L85 PathProgramCache]: Analyzing trace with hash -848842399, now seen corresponding path program 1 times [2025-02-06 18:51:37,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:37,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208112992] [2025-02-06 18:51:37,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:37,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:37,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:51:37,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:51:37,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:37,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:37,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208112992] [2025-02-06 18:51:37,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208112992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:37,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:37,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712250309] [2025-02-06 18:51:37,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:37,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:37,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:37,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:37,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-02-06 18:51:37,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 862 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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-06 18:51:37,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:37,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-02-06 18:51:37,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:38,466 INFO L124 PetriNetUnfolderBase]: 4781/10367 cut-off events. [2025-02-06 18:51:38,467 INFO L125 PetriNetUnfolderBase]: For 20412/20768 co-relation queries the response was YES. [2025-02-06 18:51:38,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31409 conditions, 10367 events. 4781/10367 cut-off events. For 20412/20768 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 88075 event pairs, 1973 based on Foata normal form. 360/10064 useless extension candidates. Maximal degree in co-relation 31358. Up to 4310 conditions per place. [2025-02-06 18:51:38,511 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 131 selfloop transitions, 16 changer transitions 0/185 dead transitions. [2025-02-06 18:51:38,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 185 transitions, 1465 flow [2025-02-06 18:51:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-02-06 18:51:38,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-02-06 18:51:38,513 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 862 flow. Second operand 4 states and 196 transitions. [2025-02-06 18:51:38,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 185 transitions, 1465 flow [2025-02-06 18:51:38,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 185 transitions, 1430 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-06 18:51:38,559 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 893 flow [2025-02-06 18:51:38,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=893, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2025-02-06 18:51:38,559 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 71 predicate places. [2025-02-06 18:51:38,560 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 893 flow [2025-02-06 18:51:38,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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-06 18:51:38,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:38,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:38,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:51:38,560 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -735388388, now seen corresponding path program 1 times [2025-02-06 18:51:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488882094] [2025-02-06 18:51:38,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:38,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:51:38,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:51:38,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:38,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:38,637 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-06 18:51:38,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:38,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488882094] [2025-02-06 18:51:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488882094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:38,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:38,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:38,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43343860] [2025-02-06 18:51:38,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:38,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:38,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:38,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:38,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:38,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 70 [2025-02-06 18:51:38,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-06 18:51:38,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:38,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 70 [2025-02-06 18:51:38,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:39,730 INFO L124 PetriNetUnfolderBase]: 5261/11191 cut-off events. [2025-02-06 18:51:39,730 INFO L125 PetriNetUnfolderBase]: For 33222/33922 co-relation queries the response was YES. [2025-02-06 18:51:39,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35430 conditions, 11191 events. 5261/11191 cut-off events. For 33222/33922 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 95561 event pairs, 1596 based on Foata normal form. 448/11083 useless extension candidates. Maximal degree in co-relation 35378. Up to 6800 conditions per place. [2025-02-06 18:51:39,812 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 178 selfloop transitions, 19 changer transitions 0/234 dead transitions. [2025-02-06 18:51:39,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 234 transitions, 1918 flow [2025-02-06 18:51:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:51:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:51:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 334 transitions. [2025-02-06 18:51:39,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816326530612244 [2025-02-06 18:51:39,813 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 893 flow. Second operand 7 states and 334 transitions. [2025-02-06 18:51:39,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 234 transitions, 1918 flow [2025-02-06 18:51:39,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 234 transitions, 1887 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:51:39,878 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 1000 flow [2025-02-06 18:51:39,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1000, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-02-06 18:51:39,879 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 79 predicate places. [2025-02-06 18:51:39,879 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 1000 flow [2025-02-06 18:51:39,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-06 18:51:39,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:39,879 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-06 18:51:39,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:51:39,879 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:39,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash 330685333, now seen corresponding path program 2 times [2025-02-06 18:51:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:39,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942802285] [2025-02-06 18:51:39,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:51:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:39,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:51:39,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:51:39,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:51:39,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:51:39,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:39,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942802285] [2025-02-06 18:51:39,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942802285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:39,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784809428] [2025-02-06 18:51:39,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:51:39,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:39,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:39,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-06 18:51:39,932 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-06 18:51:39,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:51:39,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:51:39,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:51:39,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:39,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:51:39,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:51:40,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:51:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784809428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:40,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-06 18:51:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410342983] [2025-02-06 18:51:40,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:40,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:40,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:40,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:40,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-02-06 18:51:40,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 1000 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-06 18:51:40,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:40,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-02-06 18:51:40,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:40,806 INFO L124 PetriNetUnfolderBase]: 3372/8698 cut-off events. [2025-02-06 18:51:40,806 INFO L125 PetriNetUnfolderBase]: For 20970/21389 co-relation queries the response was YES. [2025-02-06 18:51:40,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27003 conditions, 8698 events. 3372/8698 cut-off events. For 20970/21389 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 80902 event pairs, 2230 based on Foata normal form. 213/8428 useless extension candidates. Maximal degree in co-relation 26951. Up to 5278 conditions per place. [2025-02-06 18:51:40,869 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 80 selfloop transitions, 15 changer transitions 0/142 dead transitions. [2025-02-06 18:51:40,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 1180 flow [2025-02-06 18:51:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2025-02-06 18:51:40,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-02-06 18:51:40,872 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 1000 flow. Second operand 4 states and 172 transitions. [2025-02-06 18:51:40,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 1180 flow [2025-02-06 18:51:40,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 142 transitions, 1166 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-06 18:51:40,932 INFO L231 Difference]: Finished difference. Result has 143 places, 142 transitions, 1006 flow [2025-02-06 18:51:40,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1006, PETRI_PLACES=143, PETRI_TRANSITIONS=142} [2025-02-06 18:51:40,932 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 77 predicate places. [2025-02-06 18:51:40,933 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 142 transitions, 1006 flow [2025-02-06 18:51:40,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-06 18:51:40,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:40,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:40,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 18:51:41,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:41,134 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1070770913, now seen corresponding path program 1 times [2025-02-06 18:51:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940099394] [2025-02-06 18:51:41,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:41,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:51:41,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:51:41,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:41,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940099394] [2025-02-06 18:51:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940099394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209054996] [2025-02-06 18:51:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:41,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:41,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:41,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:41,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 70 [2025-02-06 18:51:41,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 142 transitions, 1006 flow. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 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-06 18:51:41,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:41,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 70 [2025-02-06 18:51:41,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:41,890 INFO L124 PetriNetUnfolderBase]: 4646/10390 cut-off events. [2025-02-06 18:51:41,890 INFO L125 PetriNetUnfolderBase]: For 25534/25888 co-relation queries the response was YES. [2025-02-06 18:51:41,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33416 conditions, 10390 events. 4646/10390 cut-off events. For 25534/25888 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 90467 event pairs, 2436 based on Foata normal form. 329/10261 useless extension candidates. Maximal degree in co-relation 33297. Up to 5669 conditions per place. [2025-02-06 18:51:41,956 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 160 selfloop transitions, 7 changer transitions 0/205 dead transitions. [2025-02-06 18:51:41,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 205 transitions, 1771 flow [2025-02-06 18:51:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-02-06 18:51:41,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7107142857142857 [2025-02-06 18:51:41,957 INFO L175 Difference]: Start difference. First operand has 143 places, 142 transitions, 1006 flow. Second operand 4 states and 199 transitions. [2025-02-06 18:51:41,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 205 transitions, 1771 flow [2025-02-06 18:51:42,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 205 transitions, 1741 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:51:42,019 INFO L231 Difference]: Finished difference. Result has 145 places, 144 transitions, 1028 flow [2025-02-06 18:51:42,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1028, PETRI_PLACES=145, PETRI_TRANSITIONS=144} [2025-02-06 18:51:42,019 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 79 predicate places. [2025-02-06 18:51:42,020 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 144 transitions, 1028 flow [2025-02-06 18:51:42,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 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-06 18:51:42,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:42,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:42,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:51:42,020 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:42,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1322203071, now seen corresponding path program 1 times [2025-02-06 18:51:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488456164] [2025-02-06 18:51:42,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:42,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:51:42,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:51:42,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:42,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:42,072 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-06 18:51:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488456164] [2025-02-06 18:51:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488456164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:51:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831908620] [2025-02-06 18:51:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:42,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:51:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:42,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:51:42,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:51:42,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 70 [2025-02-06 18:51:42,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 144 transitions, 1028 flow. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 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-06 18:51:42,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:42,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 70 [2025-02-06 18:51:42,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:43,150 INFO L124 PetriNetUnfolderBase]: 6455/13295 cut-off events. [2025-02-06 18:51:43,150 INFO L125 PetriNetUnfolderBase]: For 45163/46217 co-relation queries the response was YES. [2025-02-06 18:51:43,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45060 conditions, 13295 events. 6455/13295 cut-off events. For 45163/46217 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 114393 event pairs, 1761 based on Foata normal form. 609/13185 useless extension candidates. Maximal degree in co-relation 44955. Up to 7688 conditions per place. [2025-02-06 18:51:43,236 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 211 selfloop transitions, 34 changer transitions 0/283 dead transitions. [2025-02-06 18:51:43,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 283 transitions, 2465 flow [2025-02-06 18:51:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:51:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:51:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 411 transitions. [2025-02-06 18:51:43,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-02-06 18:51:43,238 INFO L175 Difference]: Start difference. First operand has 145 places, 144 transitions, 1028 flow. Second operand 9 states and 411 transitions. [2025-02-06 18:51:43,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 283 transitions, 2465 flow [2025-02-06 18:51:43,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 283 transitions, 2463 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:43,344 INFO L231 Difference]: Finished difference. Result has 155 places, 163 transitions, 1261 flow [2025-02-06 18:51:43,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1261, PETRI_PLACES=155, PETRI_TRANSITIONS=163} [2025-02-06 18:51:43,344 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 89 predicate places. [2025-02-06 18:51:43,344 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 163 transitions, 1261 flow [2025-02-06 18:51:43,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 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-06 18:51:43,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:43,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:43,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:51:43,345 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:43,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:43,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2084498787, now seen corresponding path program 1 times [2025-02-06 18:51:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86321855] [2025-02-06 18:51:43,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:43,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:51:43,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:51:43,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86321855] [2025-02-06 18:51:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86321855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:43,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733239791] [2025-02-06 18:51:43,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:43,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:43,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:43,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:43,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-02-06 18:51:43,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 163 transitions, 1261 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-06 18:51:43,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:43,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-02-06 18:51:43,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:44,072 INFO L124 PetriNetUnfolderBase]: 4000/9598 cut-off events. [2025-02-06 18:51:44,072 INFO L125 PetriNetUnfolderBase]: For 29425/29801 co-relation queries the response was YES. [2025-02-06 18:51:44,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33590 conditions, 9598 events. 4000/9598 cut-off events. For 29425/29801 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 87289 event pairs, 1424 based on Foata normal form. 324/9781 useless extension candidates. Maximal degree in co-relation 33481. Up to 3474 conditions per place. [2025-02-06 18:51:44,133 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 187 selfloop transitions, 4 changer transitions 0/241 dead transitions. [2025-02-06 18:51:44,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 241 transitions, 2210 flow [2025-02-06 18:51:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2025-02-06 18:51:44,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7607142857142857 [2025-02-06 18:51:44,135 INFO L175 Difference]: Start difference. First operand has 155 places, 163 transitions, 1261 flow. Second operand 4 states and 213 transitions. [2025-02-06 18:51:44,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 241 transitions, 2210 flow [2025-02-06 18:51:44,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 241 transitions, 2196 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:44,249 INFO L231 Difference]: Finished difference. Result has 160 places, 164 transitions, 1274 flow [2025-02-06 18:51:44,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1274, PETRI_PLACES=160, PETRI_TRANSITIONS=164} [2025-02-06 18:51:44,249 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 94 predicate places. [2025-02-06 18:51:44,249 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 164 transitions, 1274 flow [2025-02-06 18:51:44,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-06 18:51:44,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:44,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:44,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:51:44,250 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:44,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:44,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1414901118, now seen corresponding path program 1 times [2025-02-06 18:51:44,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:44,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842603899] [2025-02-06 18:51:44,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:44,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:44,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:51:44,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:51:44,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:44,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:44,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:44,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842603899] [2025-02-06 18:51:44,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842603899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:44,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:44,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:44,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823636180] [2025-02-06 18:51:44,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:44,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:44,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:44,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:44,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:44,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-02-06 18:51:44,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 164 transitions, 1274 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-06 18:51:44,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:44,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-02-06 18:51:44,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:45,152 INFO L124 PetriNetUnfolderBase]: 5799/12012 cut-off events. [2025-02-06 18:51:45,152 INFO L125 PetriNetUnfolderBase]: For 43211/44157 co-relation queries the response was YES. [2025-02-06 18:51:45,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43061 conditions, 12012 events. 5799/12012 cut-off events. For 43211/44157 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 101905 event pairs, 2255 based on Foata normal form. 572/12393 useless extension candidates. Maximal degree in co-relation 42949. Up to 5343 conditions per place. [2025-02-06 18:51:45,241 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 192 selfloop transitions, 16 changer transitions 0/253 dead transitions. [2025-02-06 18:51:45,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 253 transitions, 2471 flow [2025-02-06 18:51:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-02-06 18:51:45,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6928571428571428 [2025-02-06 18:51:45,242 INFO L175 Difference]: Start difference. First operand has 160 places, 164 transitions, 1274 flow. Second operand 4 states and 194 transitions. [2025-02-06 18:51:45,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 253 transitions, 2471 flow [2025-02-06 18:51:45,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 253 transitions, 2462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:51:45,357 INFO L231 Difference]: Finished difference. Result has 164 places, 165 transitions, 1337 flow [2025-02-06 18:51:45,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1337, PETRI_PLACES=164, PETRI_TRANSITIONS=165} [2025-02-06 18:51:45,357 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 98 predicate places. [2025-02-06 18:51:45,357 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 165 transitions, 1337 flow [2025-02-06 18:51:45,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-06 18:51:45,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:45,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:45,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:51:45,358 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:45,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1414900125, now seen corresponding path program 1 times [2025-02-06 18:51:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:45,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-02-06 18:51:45,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:45,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:51:45,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:51:45,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:45,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-02-06 18:51:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465913524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:45,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:51:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287163388] [2025-02-06 18:51:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:45,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:45,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:45,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:45,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 70 [2025-02-06 18:51:45,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 165 transitions, 1337 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-06 18:51:45,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:45,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 70 [2025-02-06 18:51:45,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:46,290 INFO L124 PetriNetUnfolderBase]: 5391/11099 cut-off events. [2025-02-06 18:51:46,291 INFO L125 PetriNetUnfolderBase]: For 45914/46759 co-relation queries the response was YES. [2025-02-06 18:51:46,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41923 conditions, 11099 events. 5391/11099 cut-off events. For 45914/46759 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 92229 event pairs, 1912 based on Foata normal form. 528/11460 useless extension candidates. Maximal degree in co-relation 41810. Up to 4678 conditions per place. [2025-02-06 18:51:46,356 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 280 selfloop transitions, 21 changer transitions 0/338 dead transitions. [2025-02-06 18:51:46,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 338 transitions, 3445 flow [2025-02-06 18:51:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:51:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:51:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2025-02-06 18:51:46,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-02-06 18:51:46,358 INFO L175 Difference]: Start difference. First operand has 164 places, 165 transitions, 1337 flow. Second operand 6 states and 270 transitions. [2025-02-06 18:51:46,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 338 transitions, 3445 flow [2025-02-06 18:51:46,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 338 transitions, 3383 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-02-06 18:51:46,444 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 1336 flow [2025-02-06 18:51:46,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1336, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2025-02-06 18:51:46,445 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 101 predicate places. [2025-02-06 18:51:46,445 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 1336 flow [2025-02-06 18:51:46,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-06 18:51:46,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:46,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:46,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 18:51:46,446 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:46,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:46,446 INFO L85 PathProgramCache]: Analyzing trace with hash 702819835, now seen corresponding path program 1 times [2025-02-06 18:51:46,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:46,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053153281] [2025-02-06 18:51:46,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:46,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:51:46,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:51:46,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:46,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053153281] [2025-02-06 18:51:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053153281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211621101] [2025-02-06 18:51:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:46,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:46,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:46,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:46,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 70 [2025-02-06 18:51:46,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 1336 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-06 18:51:46,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:46,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 70 [2025-02-06 18:51:46,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:47,252 INFO L124 PetriNetUnfolderBase]: 5192/10817 cut-off events. [2025-02-06 18:51:47,252 INFO L125 PetriNetUnfolderBase]: For 46400/47272 co-relation queries the response was YES. [2025-02-06 18:51:47,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41493 conditions, 10817 events. 5192/10817 cut-off events. For 46400/47272 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 90608 event pairs, 2705 based on Foata normal form. 542/11161 useless extension candidates. Maximal degree in co-relation 41380. Up to 6418 conditions per place. [2025-02-06 18:51:47,335 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 205 selfloop transitions, 7 changer transitions 0/255 dead transitions. [2025-02-06 18:51:47,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 255 transitions, 2551 flow [2025-02-06 18:51:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-02-06 18:51:47,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7035714285714286 [2025-02-06 18:51:47,336 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 1336 flow. Second operand 4 states and 197 transitions. [2025-02-06 18:51:47,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 255 transitions, 2551 flow [2025-02-06 18:51:47,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 255 transitions, 2529 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 18:51:47,519 INFO L231 Difference]: Finished difference. Result has 170 places, 168 transitions, 1366 flow [2025-02-06 18:51:47,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1366, PETRI_PLACES=170, PETRI_TRANSITIONS=168} [2025-02-06 18:51:47,519 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 104 predicate places. [2025-02-06 18:51:47,519 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 168 transitions, 1366 flow [2025-02-06 18:51:47,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-06 18:51:47,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:47,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:47,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:51:47,520 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:47,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash -606080290, now seen corresponding path program 1 times [2025-02-06 18:51:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:47,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807032106] [2025-02-06 18:51:47,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:47,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:47,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:51:47,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:51:47,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807032106] [2025-02-06 18:51:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807032106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:47,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956145956] [2025-02-06 18:51:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:47,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:47,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:47,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:47,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-02-06 18:51:47,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 168 transitions, 1366 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-06 18:51:47,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:47,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-02-06 18:51:47,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:48,544 INFO L124 PetriNetUnfolderBase]: 4024/9234 cut-off events. [2025-02-06 18:51:48,544 INFO L125 PetriNetUnfolderBase]: For 39950/40621 co-relation queries the response was YES. [2025-02-06 18:51:48,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35911 conditions, 9234 events. 4024/9234 cut-off events. For 39950/40621 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 80972 event pairs, 1446 based on Foata normal form. 428/9621 useless extension candidates. Maximal degree in co-relation 35796. Up to 3479 conditions per place. [2025-02-06 18:51:48,630 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 197 selfloop transitions, 4 changer transitions 0/252 dead transitions. [2025-02-06 18:51:48,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 252 transitions, 2467 flow [2025-02-06 18:51:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2025-02-06 18:51:48,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7535714285714286 [2025-02-06 18:51:48,631 INFO L175 Difference]: Start difference. First operand has 170 places, 168 transitions, 1366 flow. Second operand 4 states and 211 transitions. [2025-02-06 18:51:48,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 252 transitions, 2467 flow [2025-02-06 18:51:48,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 252 transitions, 2465 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:48,799 INFO L231 Difference]: Finished difference. Result has 175 places, 169 transitions, 1385 flow [2025-02-06 18:51:48,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1385, PETRI_PLACES=175, PETRI_TRANSITIONS=169} [2025-02-06 18:51:48,800 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 109 predicate places. [2025-02-06 18:51:48,801 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 169 transitions, 1385 flow [2025-02-06 18:51:48,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-06 18:51:48,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:48,801 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:48,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 18:51:48,802 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:48,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1979385646, now seen corresponding path program 1 times [2025-02-06 18:51:48,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:48,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945554174] [2025-02-06 18:51:48,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:48,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:51:48,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:51:48,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:48,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945554174] [2025-02-06 18:51:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945554174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313408396] [2025-02-06 18:51:48,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:48,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:48,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:48,909 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-06 18:51:48,911 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-06 18:51:48,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:51:48,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:51:48,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:48,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:48,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 18:51:48,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:49,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:49,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313408396] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:49,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:49,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-06 18:51:49,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767116382] [2025-02-06 18:51:49,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:49,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 18:51:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:49,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 18:51:49,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-02-06 18:51:49,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 70 [2025-02-06 18:51:49,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 169 transitions, 1385 flow. Second operand has 20 states, 20 states have (on average 34.95) internal successors, (699), 20 states have internal predecessors, (699), 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-06 18:51:49,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:49,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 70 [2025-02-06 18:51:49,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:50,837 INFO L124 PetriNetUnfolderBase]: 6277/14444 cut-off events. [2025-02-06 18:51:50,837 INFO L125 PetriNetUnfolderBase]: For 64538/65525 co-relation queries the response was YES. [2025-02-06 18:51:50,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57522 conditions, 14444 events. 6277/14444 cut-off events. For 64538/65525 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 136107 event pairs, 3022 based on Foata normal form. 516/14876 useless extension candidates. Maximal degree in co-relation 53777. Up to 6396 conditions per place. [2025-02-06 18:51:50,946 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 303 selfloop transitions, 16 changer transitions 6/376 dead transitions. [2025-02-06 18:51:50,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 376 transitions, 3881 flow [2025-02-06 18:51:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:51:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:51:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 439 transitions. [2025-02-06 18:51:50,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6271428571428571 [2025-02-06 18:51:50,952 INFO L175 Difference]: Start difference. First operand has 175 places, 169 transitions, 1385 flow. Second operand 10 states and 439 transitions. [2025-02-06 18:51:50,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 376 transitions, 3881 flow [2025-02-06 18:51:51,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 376 transitions, 3866 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:51:51,179 INFO L231 Difference]: Finished difference. Result has 187 places, 174 transitions, 1477 flow [2025-02-06 18:51:51,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1477, PETRI_PLACES=187, PETRI_TRANSITIONS=174} [2025-02-06 18:51:51,180 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 121 predicate places. [2025-02-06 18:51:51,180 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 174 transitions, 1477 flow [2025-02-06 18:51:51,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 34.95) internal successors, (699), 20 states have internal predecessors, (699), 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-06 18:51:51,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:51,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:51,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 18:51:51,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:51,381 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:51,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1363412013, now seen corresponding path program 1 times [2025-02-06 18:51:51,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:51,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235390628] [2025-02-06 18:51:51,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:51,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:51:51,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:51:51,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:51,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:51,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:51,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235390628] [2025-02-06 18:51:51,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235390628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:51,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:51,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66746341] [2025-02-06 18:51:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:51,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:51,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:51,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:51,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 70 [2025-02-06 18:51:51,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 174 transitions, 1477 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-06 18:51:51,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:51,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 70 [2025-02-06 18:51:51,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:52,702 INFO L124 PetriNetUnfolderBase]: 7207/15537 cut-off events. [2025-02-06 18:51:52,702 INFO L125 PetriNetUnfolderBase]: For 76205/77241 co-relation queries the response was YES. [2025-02-06 18:51:52,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63361 conditions, 15537 events. 7207/15537 cut-off events. For 76205/77241 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 141365 event pairs, 2489 based on Foata normal form. 596/16051 useless extension candidates. Maximal degree in co-relation 59606. Up to 6043 conditions per place. [2025-02-06 18:51:52,839 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 203 selfloop transitions, 18 changer transitions 0/266 dead transitions. [2025-02-06 18:51:52,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 266 transitions, 2774 flow [2025-02-06 18:51:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2025-02-06 18:51:52,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-02-06 18:51:52,840 INFO L175 Difference]: Start difference. First operand has 187 places, 174 transitions, 1477 flow. Second operand 4 states and 189 transitions. [2025-02-06 18:51:52,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 266 transitions, 2774 flow [2025-02-06 18:51:53,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 266 transitions, 2749 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-06 18:51:53,149 INFO L231 Difference]: Finished difference. Result has 184 places, 172 transitions, 1471 flow [2025-02-06 18:51:53,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1471, PETRI_PLACES=184, PETRI_TRANSITIONS=172} [2025-02-06 18:51:53,151 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 118 predicate places. [2025-02-06 18:51:53,151 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 172 transitions, 1471 flow [2025-02-06 18:51:53,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-06 18:51:53,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:53,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:53,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 18:51:53,151 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 525775160, now seen corresponding path program 1 times [2025-02-06 18:51:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349378621] [2025-02-06 18:51:53,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:53,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:51:53,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:51:53,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:53,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:53,273 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-06 18:51:53,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:53,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349378621] [2025-02-06 18:51:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349378621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:53,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:53,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:51:53,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731826657] [2025-02-06 18:51:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 18:51:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:53,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 18:51:53,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:51:53,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 70 [2025-02-06 18:51:53,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 172 transitions, 1471 flow. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 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-06 18:51:53,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:53,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 70 [2025-02-06 18:51:53,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:56,724 INFO L124 PetriNetUnfolderBase]: 16136/31539 cut-off events. [2025-02-06 18:51:56,724 INFO L125 PetriNetUnfolderBase]: For 158136/159447 co-relation queries the response was YES. [2025-02-06 18:51:56,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130926 conditions, 31539 events. 16136/31539 cut-off events. For 158136/159447 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 289884 event pairs, 2298 based on Foata normal form. 978/32417 useless extension candidates. Maximal degree in co-relation 117981. Up to 10010 conditions per place. [2025-02-06 18:51:56,976 INFO L140 encePairwiseOnDemand]: 55/70 looper letters, 495 selfloop transitions, 145 changer transitions 0/674 dead transitions. [2025-02-06 18:51:56,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 674 transitions, 6851 flow [2025-02-06 18:51:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 18:51:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-02-06 18:51:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1196 transitions. [2025-02-06 18:51:56,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511520737327189 [2025-02-06 18:51:56,981 INFO L175 Difference]: Start difference. First operand has 184 places, 172 transitions, 1471 flow. Second operand 31 states and 1196 transitions. [2025-02-06 18:51:56,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 674 transitions, 6851 flow [2025-02-06 18:51:58,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 674 transitions, 6682 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-02-06 18:51:58,088 INFO L231 Difference]: Finished difference. Result has 223 places, 288 transitions, 3087 flow [2025-02-06 18:51:58,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3087, PETRI_PLACES=223, PETRI_TRANSITIONS=288} [2025-02-06 18:51:58,091 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 157 predicate places. [2025-02-06 18:51:58,091 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 288 transitions, 3087 flow [2025-02-06 18:51:58,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 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-06 18:51:58,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:58,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:58,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 18:51:58,091 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:51:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2128038507, now seen corresponding path program 1 times [2025-02-06 18:51:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:58,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627315461] [2025-02-06 18:51:58,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:58,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:51:58,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:51:58,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:58,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:51:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627315461] [2025-02-06 18:51:58,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627315461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:58,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:58,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:58,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626530937] [2025-02-06 18:51:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:58,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:58,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:58,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:58,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 70 [2025-02-06 18:51:58,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 288 transitions, 3087 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-06 18:51:58,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:58,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 70 [2025-02-06 18:51:58,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:52:01,245 INFO L124 PetriNetUnfolderBase]: 11360/24686 cut-off events. [2025-02-06 18:52:01,245 INFO L125 PetriNetUnfolderBase]: For 159367/161671 co-relation queries the response was YES. [2025-02-06 18:52:01,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107283 conditions, 24686 events. 11360/24686 cut-off events. For 159367/161671 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 239746 event pairs, 4068 based on Foata normal form. 899/25454 useless extension candidates. Maximal degree in co-relation 100728. Up to 10178 conditions per place. [2025-02-06 18:52:01,571 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 295 selfloop transitions, 36 changer transitions 0/396 dead transitions. [2025-02-06 18:52:01,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 396 transitions, 4932 flow [2025-02-06 18:52:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:52:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:52:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-02-06 18:52:01,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821428571428572 [2025-02-06 18:52:01,572 INFO L175 Difference]: Start difference. First operand has 223 places, 288 transitions, 3087 flow. Second operand 4 states and 191 transitions. [2025-02-06 18:52:01,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 396 transitions, 4932 flow [2025-02-06 18:52:02,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 396 transitions, 4674 flow, removed 34 selfloop flow, removed 11 redundant places. [2025-02-06 18:52:02,574 INFO L231 Difference]: Finished difference. Result has 214 places, 286 transitions, 2898 flow [2025-02-06 18:52:02,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2898, PETRI_PLACES=214, PETRI_TRANSITIONS=286} [2025-02-06 18:52:02,578 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 148 predicate places. [2025-02-06 18:52:02,578 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 286 transitions, 2898 flow [2025-02-06 18:52:02,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-06 18:52:02,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:52:02,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:52:02,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 18:52:02,579 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:52:02,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:52:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2128039500, now seen corresponding path program 1 times [2025-02-06 18:52:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:52:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362403492] [2025-02-06 18:52:02,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:52:02,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:52:02,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:52:02,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:02,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:02,729 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-06 18:52:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:52:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362403492] [2025-02-06 18:52:02,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362403492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:52:02,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:52:02,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:52:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404766204] [2025-02-06 18:52:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:52:02,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 18:52:02,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:52:02,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 18:52:02,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:52:02,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 70 [2025-02-06 18:52:02,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 286 transitions, 2898 flow. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 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-06 18:52:02,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:52:02,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 70 [2025-02-06 18:52:02,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:52:09,107 INFO L124 PetriNetUnfolderBase]: 23812/46316 cut-off events. [2025-02-06 18:52:09,107 INFO L125 PetriNetUnfolderBase]: For 303105/305288 co-relation queries the response was YES. [2025-02-06 18:52:09,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205774 conditions, 46316 events. 23812/46316 cut-off events. For 303105/305288 co-relation queries the response was YES. Maximal size of possible extension queue 1586. Compared 448550 event pairs, 3731 based on Foata normal form. 1390/47579 useless extension candidates. Maximal degree in co-relation 182981. Up to 17458 conditions per place. [2025-02-06 18:52:09,624 INFO L140 encePairwiseOnDemand]: 55/70 looper letters, 613 selfloop transitions, 197 changer transitions 0/850 dead transitions. [2025-02-06 18:52:09,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 850 transitions, 9666 flow [2025-02-06 18:52:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 18:52:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-02-06 18:52:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1189 transitions. [2025-02-06 18:52:09,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5479262672811059 [2025-02-06 18:52:09,626 INFO L175 Difference]: Start difference. First operand has 214 places, 286 transitions, 2898 flow. Second operand 31 states and 1189 transitions. [2025-02-06 18:52:09,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 850 transitions, 9666 flow [2025-02-06 18:52:12,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 850 transitions, 9477 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-02-06 18:52:12,287 INFO L231 Difference]: Finished difference. Result has 255 places, 402 transitions, 4788 flow [2025-02-06 18:52:12,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2840, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4788, PETRI_PLACES=255, PETRI_TRANSITIONS=402} [2025-02-06 18:52:12,290 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 189 predicate places. [2025-02-06 18:52:12,290 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 402 transitions, 4788 flow [2025-02-06 18:52:12,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 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-06 18:52:12,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:52:12,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:52:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 18:52:12,291 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:52:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:52:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1118162477, now seen corresponding path program 1 times [2025-02-06 18:52:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:52:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044294347] [2025-02-06 18:52:12,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:52:12,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:52:12,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:52:12,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:12,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:52:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:52:12,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044294347] [2025-02-06 18:52:12,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044294347] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:52:12,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127436292] [2025-02-06 18:52:12,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:12,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:52:12,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:52:12,426 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-06 18:52:12,427 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-06 18:52:12,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:52:12,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:52:12,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:12,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:12,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 18:52:12,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:52:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:52:12,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:52:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:52:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127436292] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:52:12,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:52:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-06 18:52:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64727775] [2025-02-06 18:52:12,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:52:12,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 18:52:12,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:52:12,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 18:52:12,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-02-06 18:52:12,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 70 [2025-02-06 18:52:12,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 402 transitions, 4788 flow. Second operand has 20 states, 20 states have (on average 35.05) internal successors, (701), 20 states have internal predecessors, (701), 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-06 18:52:12,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:52:12,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 70 [2025-02-06 18:52:12,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:52:16,711 INFO L124 PetriNetUnfolderBase]: 12411/27996 cut-off events. [2025-02-06 18:52:16,711 INFO L125 PetriNetUnfolderBase]: For 215321/217922 co-relation queries the response was YES. [2025-02-06 18:52:16,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128499 conditions, 27996 events. 12411/27996 cut-off events. For 215321/217922 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 282599 event pairs, 6454 based on Foata normal form. 1058/28917 useless extension candidates. Maximal degree in co-relation 119732. Up to 16160 conditions per place. [2025-02-06 18:52:16,944 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 386 selfloop transitions, 20 changer transitions 178/683 dead transitions. [2025-02-06 18:52:16,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 683 transitions, 9486 flow [2025-02-06 18:52:16,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:52:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:52:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 436 transitions. [2025-02-06 18:52:16,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2025-02-06 18:52:16,946 INFO L175 Difference]: Start difference. First operand has 255 places, 402 transitions, 4788 flow. Second operand 10 states and 436 transitions. [2025-02-06 18:52:16,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 683 transitions, 9486 flow [2025-02-06 18:52:18,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 683 transitions, 9110 flow, removed 60 selfloop flow, removed 12 redundant places. [2025-02-06 18:52:18,419 INFO L231 Difference]: Finished difference. Result has 256 places, 407 transitions, 4659 flow [2025-02-06 18:52:18,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4522, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4659, PETRI_PLACES=256, PETRI_TRANSITIONS=407} [2025-02-06 18:52:18,421 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 190 predicate places. [2025-02-06 18:52:18,421 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 407 transitions, 4659 flow [2025-02-06 18:52:18,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.05) internal successors, (701), 20 states have internal predecessors, (701), 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-06 18:52:18,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:52:18,421 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:52:18,652 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forcibly destroying the process [2025-02-06 18:52:18,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 18:52:18,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:52:18,653 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-06 18:52:18,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:52:18,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1730522072, now seen corresponding path program 2 times [2025-02-06 18:52:18,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:52:18,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237127682] [2025-02-06 18:52:18,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:52:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:52:18,661 WARN L724 oredProcess$PipePump]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] The stream was forcibly closed: stdIn [2025-02-06 18:52:18,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 18:52:18,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:52:18,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:52:18,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:52:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:52:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237127682] [2025-02-06 18:52:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237127682] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:52:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304126862] [2025-02-06 18:52:19,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:52:19,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:52:19,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:52:19,075 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-06 18:52:19,082 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-06 18:52:19,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 18:52:19,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:52:19,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:52:19,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:19,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 18:52:19,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:52:19,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 18:52:19,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 18:52:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:52:19,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:52:19,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-06 18:52:19,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-06 18:52:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:52:19,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304126862] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:52:19,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:52:19,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2025-02-06 18:52:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251068612] [2025-02-06 18:52:19,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:52:19,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 18:52:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:52:19,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 18:52:19,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2025-02-06 18:52:19,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 70 [2025-02-06 18:52:19,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 407 transitions, 4659 flow. Second operand has 26 states, 26 states have (on average 31.807692307692307) internal successors, (827), 26 states have internal predecessors, (827), 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-06 18:52:19,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:52:19,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 70 [2025-02-06 18:52:19,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:52:32,015 INFO L124 PetriNetUnfolderBase]: 31416/68360 cut-off events. [2025-02-06 18:52:32,016 INFO L125 PetriNetUnfolderBase]: For 518842/526892 co-relation queries the response was YES. [2025-02-06 18:52:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312073 conditions, 68360 events. 31416/68360 cut-off events. For 518842/526892 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 753017 event pairs, 4597 based on Foata normal form. 3243/71485 useless extension candidates. Maximal degree in co-relation 298524. Up to 8679 conditions per place. [2025-02-06 18:52:33,304 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 1555 selfloop transitions, 178 changer transitions 192/2022 dead transitions. [2025-02-06 18:52:33,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 2022 transitions, 26665 flow [2025-02-06 18:52:33,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 18:52:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-02-06 18:52:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1555 transitions. [2025-02-06 18:52:33,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6346938775510204 [2025-02-06 18:52:33,307 INFO L175 Difference]: Start difference. First operand has 256 places, 407 transitions, 4659 flow. Second operand 35 states and 1555 transitions. [2025-02-06 18:52:33,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 2022 transitions, 26665 flow