./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 01186d000498d57447d1d7ea86dd893215c56febea2169abeb96f12030a58ea4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:27:45,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:27:45,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:27:45,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:27:45,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:27:45,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:27:45,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:27:45,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:27:45,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:27:45,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:27:45,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:27:45,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:27:45,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:27:45,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:27:45,344 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:27:45,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:27:45,345 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:27:45,346 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:27:45,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:27:45,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:27:45,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:27:45,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:27:45,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:27:45,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:45,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:27:45,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:27:45,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:27:45,348 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/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 -> 01186d000498d57447d1d7ea86dd893215c56febea2169abeb96f12030a58ea4 [2025-03-04 15:27:45,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:27:45,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:27:45,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:27:45,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:27:45,592 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:27:45,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c [2025-03-04 15:27:46,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7c5f338/4be838f6e1a8466d92c10131379e9f9d/FLAGc4fec88fd [2025-03-04 15:27:47,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:27:47,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c [2025-03-04 15:27:47,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7c5f338/4be838f6e1a8466d92c10131379e9f9d/FLAGc4fec88fd [2025-03-04 15:27:47,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7c5f338/4be838f6e1a8466d92c10131379e9f9d [2025-03-04 15:27:47,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:27:47,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:27:47,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:47,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:27:47,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:27:47,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fd9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47, skipping insertion in model container [2025-03-04 15:27:47,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:27:47,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:47,491 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:27:47,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:47,528 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:27:47,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47 WrapperNode [2025-03-04 15:27:47,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:47,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:47,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:27:47,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:27:47,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,558 INFO L138 Inliner]: procedures = 24, calls = 49, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 331 [2025-03-04 15:27:47,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:47,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:27:47,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:27:47,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:27:47,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,581 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 15:27:47,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:27:47,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:27:47,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:27:47,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:27:47,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (1/1) ... [2025-03-04 15:27:47,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:47,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:27:47,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:27:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:27:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:27:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:27:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:27:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:27:47,641 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:27:47,733 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:27:47,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:27:48,101 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:27:48,101 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:27:48,404 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:27:48,405 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:27:48,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:48 BoogieIcfgContainer [2025-03-04 15:27:48,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:27:48,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:27:48,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:27:48,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:27:48,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:27:47" (1/3) ... [2025-03-04 15:27:48,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1fae64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:48, skipping insertion in model container [2025-03-04 15:27:48,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:47" (2/3) ... [2025-03-04 15:27:48,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1fae64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:48, skipping insertion in model container [2025-03-04 15:27:48,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:48" (3/3) ... [2025-03-04 15:27:48,412 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2025-03-04 15:27:48,428 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:27:48,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-ring-nondet.wvr.c that has 4 procedures, 81 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-04 15:27:48,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:27:48,513 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:27:48,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 90 transitions, 201 flow [2025-03-04 15:27:48,588 INFO L124 PetriNetUnfolderBase]: 10/87 cut-off events. [2025-03-04 15:27:48,590 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:27:48,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 10/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 342 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-03-04 15:27:48,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 90 transitions, 201 flow [2025-03-04 15:27:48,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 85 transitions, 185 flow [2025-03-04 15:27:48,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:27:48,626 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;@481ac39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:27:48,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-04 15:27:48,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:27:48,631 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:27:48,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:27:48,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:48,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:27:48,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:48,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash 913602, now seen corresponding path program 1 times [2025-03-04 15:27:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:48,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083687513] [2025-03-04 15:27:48,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:48,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:27:48,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:27:48,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:48,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083687513] [2025-03-04 15:27:48,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083687513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:48,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:48,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:48,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533459872] [2025-03-04 15:27:48,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:48,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:48,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:48,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:48,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:48,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2025-03-04 15:27:48,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-04 15:27:48,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:48,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2025-03-04 15:27:48,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:50,218 INFO L124 PetriNetUnfolderBase]: 9137/14557 cut-off events. [2025-03-04 15:27:50,219 INFO L125 PetriNetUnfolderBase]: For 451/451 co-relation queries the response was YES. [2025-03-04 15:27:50,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27647 conditions, 14557 events. 9137/14557 cut-off events. For 451/451 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 104572 event pairs, 8468 based on Foata normal form. 3/8765 useless extension candidates. Maximal degree in co-relation 26874. Up to 12592 conditions per place. [2025-03-04 15:27:50,325 INFO L140 encePairwiseOnDemand]: 66/90 looper letters, 58 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2025-03-04 15:27:50,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 86 transitions, 323 flow [2025-03-04 15:27:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-03-04 15:27:50,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2025-03-04 15:27:50,339 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 185 flow. Second operand 4 states and 166 transitions. [2025-03-04 15:27:50,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 86 transitions, 323 flow [2025-03-04 15:27:50,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 314 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:50,358 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 248 flow [2025-03-04 15:27:50,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2025-03-04 15:27:50,365 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2025-03-04 15:27:50,365 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 248 flow [2025-03-04 15:27:50,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-04 15:27:50,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:50,366 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:27:50,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:27:50,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:50,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1448131869, now seen corresponding path program 1 times [2025-03-04 15:27:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:50,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043043270] [2025-03-04 15:27:50,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:50,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:50,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:50,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:50,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043043270] [2025-03-04 15:27:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043043270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269505535] [2025-03-04 15:27:50,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:50,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:50,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:50,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:50,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:27:50,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:50,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:50,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:50,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:50,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:50,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:50,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:50,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269505535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:50,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:50,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:27:50,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241046469] [2025-03-04 15:27:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:50,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:50,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:50,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:27:50,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2025-03-04 15:27:50,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 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-03-04 15:27:50,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:50,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2025-03-04 15:27:50,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:51,772 INFO L124 PetriNetUnfolderBase]: 9137/14554 cut-off events. [2025-03-04 15:27:51,773 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-03-04 15:27:51,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27545 conditions, 14554 events. 9137/14554 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 104601 event pairs, 8468 based on Foata normal form. 3/8767 useless extension candidates. Maximal degree in co-relation 27472. Up to 12577 conditions per place. [2025-03-04 15:27:51,857 INFO L140 encePairwiseOnDemand]: 77/90 looper letters, 48 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2025-03-04 15:27:51,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 366 flow [2025-03-04 15:27:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-03-04 15:27:51,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3592592592592593 [2025-03-04 15:27:51,859 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 248 flow. Second operand 6 states and 194 transitions. [2025-03-04 15:27:51,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 366 flow [2025-03-04 15:27:51,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:51,860 INFO L231 Difference]: Finished difference. Result has 82 places, 83 transitions, 270 flow [2025-03-04 15:27:51,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=82, PETRI_TRANSITIONS=83} [2025-03-04 15:27:51,861 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2025-03-04 15:27:51,861 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 83 transitions, 270 flow [2025-03-04 15:27:51,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 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-03-04 15:27:51,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:51,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:27:51,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:27:52,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:52,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:52,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1942415800, now seen corresponding path program 1 times [2025-03-04 15:27:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755440908] [2025-03-04 15:27:52,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:52,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:52,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:52,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:52,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:52,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755440908] [2025-03-04 15:27:52,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755440908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913399023] [2025-03-04 15:27:52,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:52,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:52,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:52,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:52,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:27:52,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:52,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:52,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:52,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:52,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:52,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:52,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913399023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:52,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:27:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559835278] [2025-03-04 15:27:52,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:52,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:27:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:52,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:27:52,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:27:52,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2025-03-04 15:27:52,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 83 transitions, 270 flow. Second operand has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 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-03-04 15:27:52,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:52,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2025-03-04 15:27:52,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:53,465 INFO L124 PetriNetUnfolderBase]: 9146/14590 cut-off events. [2025-03-04 15:27:53,465 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-03-04 15:27:53,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27686 conditions, 14590 events. 9146/14590 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 105054 event pairs, 8468 based on Foata normal form. 9/8809 useless extension candidates. Maximal degree in co-relation 27474. Up to 12592 conditions per place. [2025-03-04 15:27:53,567 INFO L140 encePairwiseOnDemand]: 77/90 looper letters, 55 selfloop transitions, 37 changer transitions 0/110 dead transitions. [2025-03-04 15:27:53,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 110 transitions, 628 flow [2025-03-04 15:27:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 311 transitions. [2025-03-04 15:27:53,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34555555555555556 [2025-03-04 15:27:53,571 INFO L175 Difference]: Start difference. First operand has 82 places, 83 transitions, 270 flow. Second operand 10 states and 311 transitions. [2025-03-04 15:27:53,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 110 transitions, 628 flow [2025-03-04 15:27:53,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 110 transitions, 545 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:53,577 INFO L231 Difference]: Finished difference. Result has 89 places, 110 transitions, 485 flow [2025-03-04 15:27:53,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=485, PETRI_PLACES=89, PETRI_TRANSITIONS=110} [2025-03-04 15:27:53,577 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 4 predicate places. [2025-03-04 15:27:53,578 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 110 transitions, 485 flow [2025-03-04 15:27:53,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 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-03-04 15:27:53,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:53,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:53,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:53,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:27:53,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:53,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash 662357030, now seen corresponding path program 1 times [2025-03-04 15:27:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267812651] [2025-03-04 15:27:53,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:53,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:27:53,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:27:53,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:53,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267812651] [2025-03-04 15:27:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267812651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:53,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372123960] [2025-03-04 15:27:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:53,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:53,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:53,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:53,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:27:53,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 110 transitions, 485 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:53,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:53,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:27:53,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:54,870 INFO L124 PetriNetUnfolderBase]: 9286/14888 cut-off events. [2025-03-04 15:27:54,870 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-04 15:27:54,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28341 conditions, 14888 events. 9286/14888 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 107103 event pairs, 8591 based on Foata normal form. 135/9195 useless extension candidates. Maximal degree in co-relation 28183. Up to 12618 conditions per place. [2025-03-04 15:27:54,948 INFO L140 encePairwiseOnDemand]: 78/90 looper letters, 125 selfloop transitions, 10 changer transitions 1/157 dead transitions. [2025-03-04 15:27:54,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 157 transitions, 1007 flow [2025-03-04 15:27:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2025-03-04 15:27:54,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 15:27:54,949 INFO L175 Difference]: Start difference. First operand has 89 places, 110 transitions, 485 flow. Second operand 5 states and 225 transitions. [2025-03-04 15:27:54,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 157 transitions, 1007 flow [2025-03-04 15:27:54,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 157 transitions, 947 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:54,954 INFO L231 Difference]: Finished difference. Result has 93 places, 117 transitions, 550 flow [2025-03-04 15:27:54,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=550, PETRI_PLACES=93, PETRI_TRANSITIONS=117} [2025-03-04 15:27:54,955 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 8 predicate places. [2025-03-04 15:27:54,955 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 117 transitions, 550 flow [2025-03-04 15:27:54,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:54,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:54,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:54,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:27:54,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:54,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 366889654, now seen corresponding path program 1 times [2025-03-04 15:27:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588050532] [2025-03-04 15:27:54,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:54,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:27:54,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:27:54,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:54,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:55,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588050532] [2025-03-04 15:27:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588050532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:55,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318452047] [2025-03-04 15:27:55,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:55,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:55,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:55,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:55,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:55,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:27:55,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 117 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-03-04 15:27:55,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:55,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:27:55,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:55,918 INFO L124 PetriNetUnfolderBase]: 9001/14205 cut-off events. [2025-03-04 15:27:55,918 INFO L125 PetriNetUnfolderBase]: For 1123/1123 co-relation queries the response was YES. [2025-03-04 15:27:55,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29285 conditions, 14205 events. 9001/14205 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 99141 event pairs, 3331 based on Foata normal form. 253/8604 useless extension candidates. Maximal degree in co-relation 29129. Up to 10420 conditions per place. [2025-03-04 15:27:55,977 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 121 selfloop transitions, 2 changer transitions 1/145 dead transitions. [2025-03-04 15:27:55,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 145 transitions, 867 flow [2025-03-04 15:27:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-03-04 15:27:55,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6074074074074074 [2025-03-04 15:27:55,978 INFO L175 Difference]: Start difference. First operand has 93 places, 117 transitions, 550 flow. Second operand 3 states and 164 transitions. [2025-03-04 15:27:55,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 145 transitions, 867 flow [2025-03-04 15:27:55,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 145 transitions, 863 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:55,982 INFO L231 Difference]: Finished difference. Result has 95 places, 117 transitions, 551 flow [2025-03-04 15:27:55,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=551, PETRI_PLACES=95, PETRI_TRANSITIONS=117} [2025-03-04 15:27:55,982 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 10 predicate places. [2025-03-04 15:27:55,982 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 117 transitions, 551 flow [2025-03-04 15:27:55,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-03-04 15:27:55,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:55,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:55,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:27:55,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:55,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash 576747691, now seen corresponding path program 1 times [2025-03-04 15:27:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:55,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300380402] [2025-03-04 15:27:55,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:55,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:55,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:27:56,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:27:56,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:56,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300380402] [2025-03-04 15:27:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300380402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198890176] [2025-03-04 15:27:56,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:56,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:56,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:56,150 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:56,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:27:56,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:27:56,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:27:56,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:56,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:56,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:27:56,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:56,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:56,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198890176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:56,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:56,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 15:27:56,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143040545] [2025-03-04 15:27:56,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:56,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:56,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:56,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:56,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:27:56,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:27:56,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 117 transitions, 551 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-03-04 15:27:56,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:56,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:27:56,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:57,006 INFO L124 PetriNetUnfolderBase]: 7533/11904 cut-off events. [2025-03-04 15:27:57,006 INFO L125 PetriNetUnfolderBase]: For 1467/1467 co-relation queries the response was YES. [2025-03-04 15:27:57,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24887 conditions, 11904 events. 7533/11904 cut-off events. For 1467/1467 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 79926 event pairs, 6642 based on Foata normal form. 0/7870 useless extension candidates. Maximal degree in co-relation 24730. Up to 10463 conditions per place. [2025-03-04 15:27:57,067 INFO L140 encePairwiseOnDemand]: 87/90 looper letters, 93 selfloop transitions, 1 changer transitions 0/115 dead transitions. [2025-03-04 15:27:57,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 731 flow [2025-03-04 15:27:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-03-04 15:27:57,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2025-03-04 15:27:57,069 INFO L175 Difference]: Start difference. First operand has 95 places, 117 transitions, 551 flow. Second operand 3 states and 134 transitions. [2025-03-04 15:27:57,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 115 transitions, 731 flow [2025-03-04 15:27:57,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 115 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:57,072 INFO L231 Difference]: Finished difference. Result has 94 places, 115 transitions, 543 flow [2025-03-04 15:27:57,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=94, PETRI_TRANSITIONS=115} [2025-03-04 15:27:57,074 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 9 predicate places. [2025-03-04 15:27:57,074 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 543 flow [2025-03-04 15:27:57,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-03-04 15:27:57,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:57,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:57,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:57,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:57,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:57,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:57,276 INFO L85 PathProgramCache]: Analyzing trace with hash 176957543, now seen corresponding path program 1 times [2025-03-04 15:27:57,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:57,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703434429] [2025-03-04 15:27:57,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:57,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:27:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:27:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:57,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703434429] [2025-03-04 15:27:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703434429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407402572] [2025-03-04 15:27:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:57,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:57,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:57,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:57,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:27:57,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03-04 15:27:57,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:57,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:27:57,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:58,202 INFO L124 PetriNetUnfolderBase]: 7113/11359 cut-off events. [2025-03-04 15:27:58,203 INFO L125 PetriNetUnfolderBase]: For 1564/1588 co-relation queries the response was YES. [2025-03-04 15:27:58,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23488 conditions, 11359 events. 7113/11359 cut-off events. For 1564/1588 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 73310 event pairs, 3508 based on Foata normal form. 72/7562 useless extension candidates. Maximal degree in co-relation 23470. Up to 9321 conditions per place. [2025-03-04 15:27:58,264 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 110 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-03-04 15:27:58,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 822 flow [2025-03-04 15:27:58,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2025-03-04 15:27:58,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704 [2025-03-04 15:27:58,266 INFO L175 Difference]: Start difference. First operand has 94 places, 115 transitions, 543 flow. Second operand 3 states and 154 transitions. [2025-03-04 15:27:58,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 822 flow [2025-03-04 15:27:58,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 136 transitions, 821 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:58,269 INFO L231 Difference]: Finished difference. Result has 96 places, 119 transitions, 577 flow [2025-03-04 15:27:58,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=96, PETRI_TRANSITIONS=119} [2025-03-04 15:27:58,269 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 11 predicate places. [2025-03-04 15:27:58,270 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 119 transitions, 577 flow [2025-03-04 15:27:58,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03-04 15:27:58,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:58,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:58,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:27:58,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2023177264, now seen corresponding path program 1 times [2025-03-04 15:27:58,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:58,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12226609] [2025-03-04 15:27:58,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:58,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:27:58,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:27:58,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:58,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:58,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:58,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12226609] [2025-03-04 15:27:58,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12226609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:58,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:58,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:58,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108187573] [2025-03-04 15:27:58,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:58,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:58,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:58,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:58,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:27:58,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 119 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03-04 15:27:58,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:58,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:27:58,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:59,041 INFO L124 PetriNetUnfolderBase]: 6584/10696 cut-off events. [2025-03-04 15:27:59,041 INFO L125 PetriNetUnfolderBase]: For 2649/2685 co-relation queries the response was YES. [2025-03-04 15:27:59,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23367 conditions, 10696 events. 6584/10696 cut-off events. For 2649/2685 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 70284 event pairs, 3038 based on Foata normal form. 0/7366 useless extension candidates. Maximal degree in co-relation 23347. Up to 9070 conditions per place. [2025-03-04 15:27:59,088 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 98 selfloop transitions, 8 changer transitions 0/127 dead transitions. [2025-03-04 15:27:59,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 127 transitions, 815 flow [2025-03-04 15:27:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-03-04 15:27:59,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-04 15:27:59,089 INFO L175 Difference]: Start difference. First operand has 96 places, 119 transitions, 577 flow. Second operand 3 states and 141 transitions. [2025-03-04 15:27:59,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 127 transitions, 815 flow [2025-03-04 15:27:59,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 127 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:59,092 INFO L231 Difference]: Finished difference. Result has 97 places, 120 transitions, 608 flow [2025-03-04 15:27:59,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=97, PETRI_TRANSITIONS=120} [2025-03-04 15:27:59,096 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 12 predicate places. [2025-03-04 15:27:59,096 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 120 transitions, 608 flow [2025-03-04 15:27:59,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03-04 15:27:59,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:59,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:59,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:27:59,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:27:59,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:59,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2023177265, now seen corresponding path program 1 times [2025-03-04 15:27:59,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:59,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741168208] [2025-03-04 15:27:59,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:59,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:59,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:27:59,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:27:59,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:59,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:59,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741168208] [2025-03-04 15:27:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741168208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291720972] [2025-03-04 15:27:59,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:59,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:59,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:59,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:59,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:27:59,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:27:59,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:27:59,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:59,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:59,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:27:59,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:59,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:59,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291720972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:59,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:59,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2025-03-04 15:27:59,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914152664] [2025-03-04 15:27:59,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:59,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:59,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:59,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:59,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:27:59,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:27:59,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 120 transitions, 608 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-03-04 15:27:59,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:59,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:27:59,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:59,901 INFO L124 PetriNetUnfolderBase]: 6384/10510 cut-off events. [2025-03-04 15:27:59,901 INFO L125 PetriNetUnfolderBase]: For 4157/4157 co-relation queries the response was YES. [2025-03-04 15:27:59,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23742 conditions, 10510 events. 6384/10510 cut-off events. For 4157/4157 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 70174 event pairs, 1572 based on Foata normal form. 206/7652 useless extension candidates. Maximal degree in co-relation 23720. Up to 5126 conditions per place. [2025-03-04 15:27:59,950 INFO L140 encePairwiseOnDemand]: 82/90 looper letters, 107 selfloop transitions, 16 changer transitions 0/144 dead transitions. [2025-03-04 15:27:59,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 144 transitions, 925 flow [2025-03-04 15:27:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-03-04 15:27:59,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2025-03-04 15:27:59,951 INFO L175 Difference]: Start difference. First operand has 97 places, 120 transitions, 608 flow. Second operand 4 states and 182 transitions. [2025-03-04 15:27:59,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 144 transitions, 925 flow [2025-03-04 15:27:59,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:59,957 INFO L231 Difference]: Finished difference. Result has 100 places, 121 transitions, 677 flow [2025-03-04 15:27:59,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=677, PETRI_PLACES=100, PETRI_TRANSITIONS=121} [2025-03-04 15:27:59,958 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 15 predicate places. [2025-03-04 15:27:59,958 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 121 transitions, 677 flow [2025-03-04 15:27:59,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-03-04 15:27:59,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:59,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:59,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:28:00,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:00,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:00,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2023177266, now seen corresponding path program 1 times [2025-03-04 15:28:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:00,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318971375] [2025-03-04 15:28:00,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:00,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:28:00,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:28:00,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:00,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:00,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:00,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318971375] [2025-03-04 15:28:00,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318971375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:00,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:00,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:00,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250466192] [2025-03-04 15:28:00,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:00,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:00,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:00,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:00,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:28:00,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:28:00,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 121 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03-04 15:28:00,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:00,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:28:00,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:01,070 INFO L124 PetriNetUnfolderBase]: 7937/12781 cut-off events. [2025-03-04 15:28:01,070 INFO L125 PetriNetUnfolderBase]: For 12441/12525 co-relation queries the response was YES. [2025-03-04 15:28:01,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32138 conditions, 12781 events. 7937/12781 cut-off events. For 12441/12525 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 86836 event pairs, 5872 based on Foata normal form. 0/9089 useless extension candidates. Maximal degree in co-relation 32113. Up to 9288 conditions per place. [2025-03-04 15:28:01,136 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 130 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-03-04 15:28:01,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 153 transitions, 1016 flow [2025-03-04 15:28:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-03-04 15:28:01,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185185185185185 [2025-03-04 15:28:01,137 INFO L175 Difference]: Start difference. First operand has 100 places, 121 transitions, 677 flow. Second operand 3 states and 167 transitions. [2025-03-04 15:28:01,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 153 transitions, 1016 flow [2025-03-04 15:28:01,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 153 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:01,147 INFO L231 Difference]: Finished difference. Result has 101 places, 119 transitions, 664 flow [2025-03-04 15:28:01,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=101, PETRI_TRANSITIONS=119} [2025-03-04 15:28:01,148 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 16 predicate places. [2025-03-04 15:28:01,148 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 119 transitions, 664 flow [2025-03-04 15:28:01,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03-04 15:28:01,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:01,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:01,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:28:01,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:01,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1706012206, now seen corresponding path program 1 times [2025-03-04 15:28:01,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:01,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3669090] [2025-03-04 15:28:01,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:01,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:28:01,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:28:01,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:01,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3669090] [2025-03-04 15:28:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3669090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244056808] [2025-03-04 15:28:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:01,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:01,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:01,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:28:01,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 119 transitions, 664 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-03-04 15:28:01,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:01,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:28:01,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:02,425 INFO L124 PetriNetUnfolderBase]: 10855/17354 cut-off events. [2025-03-04 15:28:02,425 INFO L125 PetriNetUnfolderBase]: For 17784/18012 co-relation queries the response was YES. [2025-03-04 15:28:02,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45028 conditions, 17354 events. 10855/17354 cut-off events. For 17784/18012 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 119751 event pairs, 8801 based on Foata normal form. 290/12868 useless extension candidates. Maximal degree in co-relation 45003. Up to 10957 conditions per place. [2025-03-04 15:28:02,493 INFO L140 encePairwiseOnDemand]: 79/90 looper letters, 122 selfloop transitions, 12 changer transitions 0/155 dead transitions. [2025-03-04 15:28:02,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 155 transitions, 1102 flow [2025-03-04 15:28:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-03-04 15:28:02,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5472222222222223 [2025-03-04 15:28:02,494 INFO L175 Difference]: Start difference. First operand has 101 places, 119 transitions, 664 flow. Second operand 4 states and 197 transitions. [2025-03-04 15:28:02,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 155 transitions, 1102 flow [2025-03-04 15:28:02,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 155 transitions, 1098 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:02,500 INFO L231 Difference]: Finished difference. Result has 104 places, 119 transitions, 703 flow [2025-03-04 15:28:02,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=703, PETRI_PLACES=104, PETRI_TRANSITIONS=119} [2025-03-04 15:28:02,501 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 19 predicate places. [2025-03-04 15:28:02,501 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 703 flow [2025-03-04 15:28:02,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-03-04 15:28:02,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:02,502 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:28:02,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:28:02,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:02,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash 143658611, now seen corresponding path program 2 times [2025-03-04 15:28:02,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:02,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818457262] [2025-03-04 15:28:02,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:02,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:28:02,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:28:02,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:28:02,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:02,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818457262] [2025-03-04 15:28:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818457262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818687464] [2025-03-04 15:28:02,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:02,542 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:02,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:28:02,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:28:02,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:28:02,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:28:02,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:02,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:28:02,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:02,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818687464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:02,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:28:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802287946] [2025-03-04 15:28:02,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:02,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:02,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:02,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:02,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2025-03-04 15:28:02,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 119 transitions, 703 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-03-04 15:28:02,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:02,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2025-03-04 15:28:02,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:03,630 INFO L124 PetriNetUnfolderBase]: 10882/17448 cut-off events. [2025-03-04 15:28:03,631 INFO L125 PetriNetUnfolderBase]: For 18339/18579 co-relation queries the response was YES. [2025-03-04 15:28:03,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46966 conditions, 17448 events. 10882/17448 cut-off events. For 18339/18579 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 121425 event pairs, 8817 based on Foata normal form. 1/12664 useless extension candidates. Maximal degree in co-relation 46940. Up to 15280 conditions per place. [2025-03-04 15:28:03,744 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 84 selfloop transitions, 16 changer transitions 0/118 dead transitions. [2025-03-04 15:28:03,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 118 transitions, 893 flow [2025-03-04 15:28:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 15:28:03,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2025-03-04 15:28:03,747 INFO L175 Difference]: Start difference. First operand has 104 places, 119 transitions, 703 flow. Second operand 4 states and 136 transitions. [2025-03-04 15:28:03,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 118 transitions, 893 flow [2025-03-04 15:28:03,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 882 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:03,760 INFO L231 Difference]: Finished difference. Result has 105 places, 118 transitions, 714 flow [2025-03-04 15:28:03,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=714, PETRI_PLACES=105, PETRI_TRANSITIONS=118} [2025-03-04 15:28:03,762 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 20 predicate places. [2025-03-04 15:28:03,762 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 118 transitions, 714 flow [2025-03-04 15:28:03,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-03-04 15:28:03,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:03,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:03,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:03,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 15:28:03,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:03,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1997574535, now seen corresponding path program 1 times [2025-03-04 15:28:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:03,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850561297] [2025-03-04 15:28:03,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:03,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:28:03,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:28:03,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:03,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850561297] [2025-03-04 15:28:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850561297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532950047] [2025-03-04 15:28:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:04,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:04,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:04,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:28:04,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 118 transitions, 714 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-03-04 15:28:04,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:04,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:28:04,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:05,727 INFO L124 PetriNetUnfolderBase]: 12242/19885 cut-off events. [2025-03-04 15:28:05,728 INFO L125 PetriNetUnfolderBase]: For 21805/22165 co-relation queries the response was YES. [2025-03-04 15:28:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53989 conditions, 19885 events. 12242/19885 cut-off events. For 21805/22165 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 139730 event pairs, 9944 based on Foata normal form. 328/15096 useless extension candidates. Maximal degree in co-relation 53962. Up to 15278 conditions per place. [2025-03-04 15:28:05,888 INFO L140 encePairwiseOnDemand]: 81/90 looper letters, 127 selfloop transitions, 11 changer transitions 6/164 dead transitions. [2025-03-04 15:28:05,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 164 transitions, 1300 flow [2025-03-04 15:28:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-03-04 15:28:05,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4911111111111111 [2025-03-04 15:28:05,890 INFO L175 Difference]: Start difference. First operand has 105 places, 118 transitions, 714 flow. Second operand 5 states and 221 transitions. [2025-03-04 15:28:05,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 164 transitions, 1300 flow [2025-03-04 15:28:05,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 164 transitions, 1268 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:05,905 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 763 flow [2025-03-04 15:28:05,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=763, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2025-03-04 15:28:05,905 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 23 predicate places. [2025-03-04 15:28:05,905 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 763 flow [2025-03-04 15:28:05,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-03-04 15:28:05,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:05,905 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:28:05,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:28:05,906 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:05,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 936820171, now seen corresponding path program 1 times [2025-03-04 15:28:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:05,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861839458] [2025-03-04 15:28:05,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:05,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:05,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:28:05,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:28:05,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:05,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:06,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:06,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861839458] [2025-03-04 15:28:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861839458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:06,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047760843] [2025-03-04 15:28:06,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:06,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:06,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:06,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:06,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:28:06,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:28:06,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:28:06,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:06,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:06,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:28:06,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:06,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047760843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:06,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:06,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:28:06,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367454819] [2025-03-04 15:28:06,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:06,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:28:06,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:06,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:28:06,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:28:06,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2025-03-04 15:28:06,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 763 flow. Second operand has 24 states, 24 states have (on average 22.083333333333332) internal successors, (530), 24 states have internal predecessors, (530), 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-03-04 15:28:06,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:06,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2025-03-04 15:28:06,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:07,988 INFO L124 PetriNetUnfolderBase]: 12284/20003 cut-off events. [2025-03-04 15:28:07,988 INFO L125 PetriNetUnfolderBase]: For 23093/23549 co-relation queries the response was YES. [2025-03-04 15:28:08,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56681 conditions, 20003 events. 12284/20003 cut-off events. For 23093/23549 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 141520 event pairs, 9944 based on Foata normal form. 36/14819 useless extension candidates. Maximal degree in co-relation 56653. Up to 17414 conditions per place. [2025-03-04 15:28:08,081 INFO L140 encePairwiseOnDemand]: 78/90 looper letters, 57 selfloop transitions, 106 changer transitions 0/181 dead transitions. [2025-03-04 15:28:08,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 181 transitions, 1575 flow [2025-03-04 15:28:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:28:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:28:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 615 transitions. [2025-03-04 15:28:08,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2025-03-04 15:28:08,083 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 763 flow. Second operand 22 states and 615 transitions. [2025-03-04 15:28:08,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 181 transitions, 1575 flow [2025-03-04 15:28:08,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 181 transitions, 1520 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:08,098 INFO L231 Difference]: Finished difference. Result has 133 places, 181 transitions, 1480 flow [2025-03-04 15:28:08,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1480, PETRI_PLACES=133, PETRI_TRANSITIONS=181} [2025-03-04 15:28:08,098 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 48 predicate places. [2025-03-04 15:28:08,098 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 181 transitions, 1480 flow [2025-03-04 15:28:08,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 22.083333333333332) internal successors, (530), 24 states have internal predecessors, (530), 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-03-04 15:28:08,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:08,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:08,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:28:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:08,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:08,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1408870995, now seen corresponding path program 1 times [2025-03-04 15:28:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425994466] [2025-03-04 15:28:08,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:08,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:08,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:08,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:28:08,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:08,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425994466] [2025-03-04 15:28:08,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425994466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:08,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086861434] [2025-03-04 15:28:08,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:08,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:08,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:08,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:28:08,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:08,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:08,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:08,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:08,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:28:08,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:08,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:08,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086861434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:08,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:08,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-04 15:28:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646893168] [2025-03-04 15:28:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:08,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:08,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:08,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:28:08,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:28:08,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 181 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-03-04 15:28:08,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:08,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:28:08,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:09,566 INFO L124 PetriNetUnfolderBase]: 11184/18407 cut-off events. [2025-03-04 15:28:09,566 INFO L125 PetriNetUnfolderBase]: For 21969/22425 co-relation queries the response was YES. [2025-03-04 15:28:09,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52347 conditions, 18407 events. 11184/18407 cut-off events. For 21969/22425 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 129437 event pairs, 8986 based on Foata normal form. 0/13892 useless extension candidates. Maximal degree in co-relation 52313. Up to 16030 conditions per place. [2025-03-04 15:28:09,737 INFO L140 encePairwiseOnDemand]: 87/90 looper letters, 158 selfloop transitions, 1 changer transitions 0/179 dead transitions. [2025-03-04 15:28:09,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 179 transitions, 1790 flow [2025-03-04 15:28:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-03-04 15:28:09,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-03-04 15:28:09,738 INFO L175 Difference]: Start difference. First operand has 133 places, 181 transitions, 1480 flow. Second operand 3 states and 130 transitions. [2025-03-04 15:28:09,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 179 transitions, 1790 flow [2025-03-04 15:28:09,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 179 transitions, 1528 flow, removed 67 selfloop flow, removed 9 redundant places. [2025-03-04 15:28:09,755 INFO L231 Difference]: Finished difference. Result has 124 places, 179 transitions, 1212 flow [2025-03-04 15:28:09,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=124, PETRI_TRANSITIONS=179} [2025-03-04 15:28:09,756 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 39 predicate places. [2025-03-04 15:28:09,756 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 179 transitions, 1212 flow [2025-03-04 15:28:09,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-03-04 15:28:09,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:09,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:09,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:09,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:09,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:09,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1408870994, now seen corresponding path program 1 times [2025-03-04 15:28:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018898206] [2025-03-04 15:28:09,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:09,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:09,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:09,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:09,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:09,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:28:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018898206] [2025-03-04 15:28:10,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018898206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:10,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:10,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:28:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897125547] [2025-03-04 15:28:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:10,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:10,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:10,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:10,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 90 [2025-03-04 15:28:10,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 179 transitions, 1212 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:10,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:10,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 90 [2025-03-04 15:28:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:11,646 INFO L124 PetriNetUnfolderBase]: 15270/24673 cut-off events. [2025-03-04 15:28:11,646 INFO L125 PetriNetUnfolderBase]: For 21375/21375 co-relation queries the response was YES. [2025-03-04 15:28:11,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68009 conditions, 24673 events. 15270/24673 cut-off events. For 21375/21375 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 174159 event pairs, 5004 based on Foata normal form. 438/19410 useless extension candidates. Maximal degree in co-relation 67975. Up to 8002 conditions per place. [2025-03-04 15:28:11,834 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 223 selfloop transitions, 6 changer transitions 0/247 dead transitions. [2025-03-04 15:28:11,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 247 transitions, 1945 flow [2025-03-04 15:28:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2025-03-04 15:28:11,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5355555555555556 [2025-03-04 15:28:11,836 INFO L175 Difference]: Start difference. First operand has 124 places, 179 transitions, 1212 flow. Second operand 5 states and 241 transitions. [2025-03-04 15:28:11,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 247 transitions, 1945 flow [2025-03-04 15:28:11,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 247 transitions, 1944 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:11,883 INFO L231 Difference]: Finished difference. Result has 130 places, 184 transitions, 1258 flow [2025-03-04 15:28:11,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1258, PETRI_PLACES=130, PETRI_TRANSITIONS=184} [2025-03-04 15:28:11,883 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 45 predicate places. [2025-03-04 15:28:11,883 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 184 transitions, 1258 flow [2025-03-04 15:28:11,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:11,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:11,884 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-03-04 15:28:11,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:28:11,884 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:11,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1551724869, now seen corresponding path program 1 times [2025-03-04 15:28:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:11,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919785523] [2025-03-04 15:28:11,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:11,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:11,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:28:11,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:28:11,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:11,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919785523] [2025-03-04 15:28:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919785523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541055957] [2025-03-04 15:28:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:12,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:12,369 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:12,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:28:12,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:28:12,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:28:12,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:12,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:12,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:28:12,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:12,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:28:12,511 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 23 treesize of output 1 [2025-03-04 15:28:12,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:28:12,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:28:12,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 15:28:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:12,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:28:12,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541055957] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:12,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:28:12,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 8] total 20 [2025-03-04 15:28:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369830163] [2025-03-04 15:28:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:12,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:12,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:12,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:28:12,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 90 [2025-03-04 15:28:12,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 184 transitions, 1258 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-03-04 15:28:12,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:12,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 90 [2025-03-04 15:28:12,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:14,642 INFO L124 PetriNetUnfolderBase]: 15152/23989 cut-off events. [2025-03-04 15:28:14,642 INFO L125 PetriNetUnfolderBase]: For 25889/26257 co-relation queries the response was YES. [2025-03-04 15:28:14,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70291 conditions, 23989 events. 15152/23989 cut-off events. For 25889/26257 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 165230 event pairs, 4388 based on Foata normal form. 32/18610 useless extension candidates. Maximal degree in co-relation 70253. Up to 13520 conditions per place. [2025-03-04 15:28:14,816 INFO L140 encePairwiseOnDemand]: 79/90 looper letters, 193 selfloop transitions, 24 changer transitions 0/238 dead transitions. [2025-03-04 15:28:14,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 238 transitions, 1919 flow [2025-03-04 15:28:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2025-03-04 15:28:14,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2025-03-04 15:28:14,817 INFO L175 Difference]: Start difference. First operand has 130 places, 184 transitions, 1258 flow. Second operand 5 states and 232 transitions. [2025-03-04 15:28:14,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 238 transitions, 1919 flow [2025-03-04 15:28:14,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 238 transitions, 1919 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:28:14,850 INFO L231 Difference]: Finished difference. Result has 136 places, 189 transitions, 1369 flow [2025-03-04 15:28:14,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1369, PETRI_PLACES=136, PETRI_TRANSITIONS=189} [2025-03-04 15:28:14,850 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 51 predicate places. [2025-03-04 15:28:14,850 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 189 transitions, 1369 flow [2025-03-04 15:28:14,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-03-04 15:28:14,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:14,851 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-03-04 15:28:14,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:28:15,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:28:15,051 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:15,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 604918842, now seen corresponding path program 1 times [2025-03-04 15:28:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:15,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152207732] [2025-03-04 15:28:15,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:15,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:28:15,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:28:15,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:15,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:28:15,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:15,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152207732] [2025-03-04 15:28:15,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152207732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:15,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307564810] [2025-03-04 15:28:15,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:15,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:15,193 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:15,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:28:15,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:28:15,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:28:15,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:15,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:15,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:28:15,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:15,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:15,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307564810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:15,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:15,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-04 15:28:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194542092] [2025-03-04 15:28:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:15,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:15,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:15,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:28:15,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 90 [2025-03-04 15:28:15,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 189 transitions, 1369 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-03-04 15:28:15,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:15,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 90 [2025-03-04 15:28:15,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:16,396 INFO L124 PetriNetUnfolderBase]: 10412/17401 cut-off events. [2025-03-04 15:28:16,396 INFO L125 PetriNetUnfolderBase]: For 31178/31514 co-relation queries the response was YES. [2025-03-04 15:28:16,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54915 conditions, 17401 events. 10412/17401 cut-off events. For 31178/31514 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 123040 event pairs, 8324 based on Foata normal form. 24/14936 useless extension candidates. Maximal degree in co-relation 54873. Up to 15004 conditions per place. [2025-03-04 15:28:16,643 INFO L140 encePairwiseOnDemand]: 87/90 looper letters, 163 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2025-03-04 15:28:16,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 186 transitions, 1679 flow [2025-03-04 15:28:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-04 15:28:16,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2025-03-04 15:28:16,644 INFO L175 Difference]: Start difference. First operand has 136 places, 189 transitions, 1369 flow. Second operand 3 states and 128 transitions. [2025-03-04 15:28:16,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 186 transitions, 1679 flow [2025-03-04 15:28:16,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 186 transitions, 1671 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:16,664 INFO L231 Difference]: Finished difference. Result has 135 places, 186 transitions, 1345 flow [2025-03-04 15:28:16,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1345, PETRI_PLACES=135, PETRI_TRANSITIONS=186} [2025-03-04 15:28:16,665 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 50 predicate places. [2025-03-04 15:28:16,665 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 186 transitions, 1345 flow [2025-03-04 15:28:16,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-03-04 15:28:16,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:16,665 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-03-04 15:28:16,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:16,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:28:16,866 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:16,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1551724870, now seen corresponding path program 1 times [2025-03-04 15:28:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:16,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454383698] [2025-03-04 15:28:16,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:16,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:28:16,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:28:16,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:16,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:17,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454383698] [2025-03-04 15:28:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454383698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194465861] [2025-03-04 15:28:17,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:17,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:17,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:17,143 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:17,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:28:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:28:17,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:28:17,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:17,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:17,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:28:17,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:28:17,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194465861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:17,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:17,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2025-03-04 15:28:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015389825] [2025-03-04 15:28:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:17,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:17,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:17,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:28:17,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 90 [2025-03-04 15:28:17,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 186 transitions, 1345 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-03-04 15:28:17,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:17,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 90 [2025-03-04 15:28:17,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:18,630 INFO L124 PetriNetUnfolderBase]: 12300/20023 cut-off events. [2025-03-04 15:28:18,630 INFO L125 PetriNetUnfolderBase]: For 31009/31353 co-relation queries the response was YES. [2025-03-04 15:28:18,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61770 conditions, 20023 events. 12300/20023 cut-off events. For 31009/31353 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 136956 event pairs, 4368 based on Foata normal form. 60/16704 useless extension candidates. Maximal degree in co-relation 61727. Up to 10006 conditions per place. [2025-03-04 15:28:18,810 INFO L140 encePairwiseOnDemand]: 82/90 looper letters, 208 selfloop transitions, 7 changer transitions 0/235 dead transitions. [2025-03-04 15:28:18,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 235 transitions, 1970 flow [2025-03-04 15:28:18,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2025-03-04 15:28:18,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4955555555555556 [2025-03-04 15:28:18,812 INFO L175 Difference]: Start difference. First operand has 135 places, 186 transitions, 1345 flow. Second operand 5 states and 223 transitions. [2025-03-04 15:28:18,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 235 transitions, 1970 flow [2025-03-04 15:28:18,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 235 transitions, 1969 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:18,847 INFO L231 Difference]: Finished difference. Result has 140 places, 186 transitions, 1365 flow [2025-03-04 15:28:18,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1365, PETRI_PLACES=140, PETRI_TRANSITIONS=186} [2025-03-04 15:28:18,847 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 55 predicate places. [2025-03-04 15:28:18,847 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 186 transitions, 1365 flow [2025-03-04 15:28:18,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-03-04 15:28:18,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:18,847 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] [2025-03-04 15:28:18,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:19,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:19,048 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:19,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:19,049 INFO L85 PathProgramCache]: Analyzing trace with hash 602700485, now seen corresponding path program 1 times [2025-03-04 15:28:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:19,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549573705] [2025-03-04 15:28:19,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:19,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:28:19,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:19,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:19,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:28:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549573705] [2025-03-04 15:28:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549573705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:19,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:19,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924921253] [2025-03-04 15:28:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:19,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:19,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:19,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:19,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 90 [2025-03-04 15:28:19,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 186 transitions, 1365 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:19,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:19,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 90 [2025-03-04 15:28:19,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:20,838 INFO L124 PetriNetUnfolderBase]: 15807/24292 cut-off events. [2025-03-04 15:28:20,838 INFO L125 PetriNetUnfolderBase]: For 35877/36137 co-relation queries the response was YES. [2025-03-04 15:28:21,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77614 conditions, 24292 events. 15807/24292 cut-off events. For 35877/36137 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 163078 event pairs, 6812 based on Foata normal form. 544/20571 useless extension candidates. Maximal degree in co-relation 77568. Up to 16434 conditions per place. [2025-03-04 15:28:21,105 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 214 selfloop transitions, 5 changer transitions 0/239 dead transitions. [2025-03-04 15:28:21,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 239 transitions, 2103 flow [2025-03-04 15:28:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2025-03-04 15:28:21,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-04 15:28:21,106 INFO L175 Difference]: Start difference. First operand has 140 places, 186 transitions, 1365 flow. Second operand 4 states and 189 transitions. [2025-03-04 15:28:21,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 239 transitions, 2103 flow [2025-03-04 15:28:21,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 239 transitions, 2091 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:21,145 INFO L231 Difference]: Finished difference. Result has 143 places, 188 transitions, 1392 flow [2025-03-04 15:28:21,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1392, PETRI_PLACES=143, PETRI_TRANSITIONS=188} [2025-03-04 15:28:21,146 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 58 predicate places. [2025-03-04 15:28:21,146 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 188 transitions, 1392 flow [2025-03-04 15:28:21,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:21,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:21,146 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:21,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:28:21,146 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:21,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:21,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1971376245, now seen corresponding path program 1 times [2025-03-04 15:28:21,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:21,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663903084] [2025-03-04 15:28:21,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:21,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:21,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:28:21,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:21,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:21,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:28:21,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:21,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663903084] [2025-03-04 15:28:21,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663903084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:21,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153232183] [2025-03-04 15:28:21,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:21,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:21,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:21,182 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:21,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:28:21,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:28:21,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:21,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:21,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:21,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:28:21,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:21,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:21,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153232183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:21,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 15 [2025-03-04 15:28:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830978175] [2025-03-04 15:28:21,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:28:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:21,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:28:21,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:28:21,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2025-03-04 15:28:21,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 188 transitions, 1392 flow. Second operand has 15 states, 15 states have (on average 23.733333333333334) internal successors, (356), 15 states have internal predecessors, (356), 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-03-04 15:28:21,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:21,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2025-03-04 15:28:21,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:24,446 INFO L124 PetriNetUnfolderBase]: 20735/35516 cut-off events. [2025-03-04 15:28:24,446 INFO L125 PetriNetUnfolderBase]: For 83186/84274 co-relation queries the response was YES. [2025-03-04 15:28:24,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116127 conditions, 35516 events. 20735/35516 cut-off events. For 83186/84274 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 282977 event pairs, 8428 based on Foata normal form. 674/32019 useless extension candidates. Maximal degree in co-relation 116079. Up to 12532 conditions per place. [2025-03-04 15:28:24,874 INFO L140 encePairwiseOnDemand]: 74/90 looper letters, 340 selfloop transitions, 85 changer transitions 12/458 dead transitions. [2025-03-04 15:28:24,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 458 transitions, 4082 flow [2025-03-04 15:28:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:28:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:28:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 568 transitions. [2025-03-04 15:28:24,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3712418300653595 [2025-03-04 15:28:24,876 INFO L175 Difference]: Start difference. First operand has 143 places, 188 transitions, 1392 flow. Second operand 17 states and 568 transitions. [2025-03-04 15:28:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 458 transitions, 4082 flow [2025-03-04 15:28:24,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 458 transitions, 4063 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:24,984 INFO L231 Difference]: Finished difference. Result has 166 places, 244 transitions, 2252 flow [2025-03-04 15:28:24,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2252, PETRI_PLACES=166, PETRI_TRANSITIONS=244} [2025-03-04 15:28:24,984 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 81 predicate places. [2025-03-04 15:28:24,984 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 244 transitions, 2252 flow [2025-03-04 15:28:24,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 23.733333333333334) internal successors, (356), 15 states have internal predecessors, (356), 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-03-04 15:28:24,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:24,984 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] [2025-03-04 15:28:24,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:28:25,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:28:25,185 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:25,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:25,185 INFO L85 PathProgramCache]: Analyzing trace with hash 339019963, now seen corresponding path program 1 times [2025-03-04 15:28:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:25,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379427076] [2025-03-04 15:28:25,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:25,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:25,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:28:25,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:28:25,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:25,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:25,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:25,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379427076] [2025-03-04 15:28:25,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379427076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:25,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865841971] [2025-03-04 15:28:25,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:25,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:25,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:25,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:25,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:28:25,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:28:25,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:28:25,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:25,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:25,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:28:25,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:28:25,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865841971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:25,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2025-03-04 15:28:25,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416133770] [2025-03-04 15:28:25,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:25,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:28:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:25,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:28:25,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:28:25,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 90 [2025-03-04 15:28:25,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 244 transitions, 2252 flow. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-03-04 15:28:25,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:25,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 90 [2025-03-04 15:28:25,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:30,332 INFO L124 PetriNetUnfolderBase]: 30659/50324 cut-off events. [2025-03-04 15:28:30,333 INFO L125 PetriNetUnfolderBase]: For 119576/120312 co-relation queries the response was YES. [2025-03-04 15:28:30,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165413 conditions, 50324 events. 30659/50324 cut-off events. For 119576/120312 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 397769 event pairs, 14942 based on Foata normal form. 260/45080 useless extension candidates. Maximal degree in co-relation 165356. Up to 39387 conditions per place. [2025-03-04 15:28:30,908 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 263 selfloop transitions, 15 changer transitions 1/298 dead transitions. [2025-03-04 15:28:30,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 298 transitions, 3092 flow [2025-03-04 15:28:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:28:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:28:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 241 transitions. [2025-03-04 15:28:30,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4462962962962963 [2025-03-04 15:28:30,909 INFO L175 Difference]: Start difference. First operand has 166 places, 244 transitions, 2252 flow. Second operand 6 states and 241 transitions. [2025-03-04 15:28:30,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 298 transitions, 3092 flow [2025-03-04 15:28:31,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 298 transitions, 3059 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:31,206 INFO L231 Difference]: Finished difference. Result has 172 places, 252 transitions, 2373 flow [2025-03-04 15:28:31,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=2231, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2373, PETRI_PLACES=172, PETRI_TRANSITIONS=252} [2025-03-04 15:28:31,206 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 87 predicate places. [2025-03-04 15:28:31,206 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 252 transitions, 2373 flow [2025-03-04 15:28:31,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-03-04 15:28:31,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:31,207 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] [2025-03-04 15:28:31,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 15:28:31,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:28:31,407 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1596805205, now seen corresponding path program 2 times [2025-03-04 15:28:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554630471] [2025-03-04 15:28:31,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:31,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:31,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 15:28:31,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 21 statements. [2025-03-04 15:28:31,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:28:31,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:28:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554630471] [2025-03-04 15:28:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554630471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:28:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068411602] [2025-03-04 15:28:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:31,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:28:31,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:31,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:28:31,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:28:31,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 90 [2025-03-04 15:28:31,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 252 transitions, 2373 flow. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-03-04 15:28:31,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:31,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 90 [2025-03-04 15:28:31,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:36,781 INFO L124 PetriNetUnfolderBase]: 29777/48584 cut-off events. [2025-03-04 15:28:36,781 INFO L125 PetriNetUnfolderBase]: For 122115/122505 co-relation queries the response was YES. [2025-03-04 15:28:37,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163906 conditions, 48584 events. 29777/48584 cut-off events. For 122115/122505 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 381017 event pairs, 14582 based on Foata normal form. 258/43466 useless extension candidates. Maximal degree in co-relation 163845. Up to 37863 conditions per place. [2025-03-04 15:28:37,246 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 257 selfloop transitions, 16 changer transitions 1/294 dead transitions. [2025-03-04 15:28:37,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 294 transitions, 3061 flow [2025-03-04 15:28:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:28:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:28:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2025-03-04 15:28:37,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4425925925925926 [2025-03-04 15:28:37,247 INFO L175 Difference]: Start difference. First operand has 172 places, 252 transitions, 2373 flow. Second operand 6 states and 239 transitions. [2025-03-04 15:28:37,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 294 transitions, 3061 flow [2025-03-04 15:28:37,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 294 transitions, 3052 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:37,469 INFO L231 Difference]: Finished difference. Result has 178 places, 253 transitions, 2417 flow [2025-03-04 15:28:37,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=2364, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2417, PETRI_PLACES=178, PETRI_TRANSITIONS=253} [2025-03-04 15:28:37,470 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 93 predicate places. [2025-03-04 15:28:37,470 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 253 transitions, 2417 flow [2025-03-04 15:28:37,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-03-04 15:28:37,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:37,470 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] [2025-03-04 15:28:37,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:28:37,470 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1089711284, now seen corresponding path program 1 times [2025-03-04 15:28:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:37,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099914973] [2025-03-04 15:28:37,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:37,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:28:37,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:28:37,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:37,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:37,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099914973] [2025-03-04 15:28:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099914973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422812152] [2025-03-04 15:28:37,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:37,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:37,800 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:37,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:28:37,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:28:37,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:28:37,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:37,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:37,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:28:37,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:37,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:28:37,920 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 23 treesize of output 1 [2025-03-04 15:28:37,957 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:28:37,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:28:37,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 15:28:38,121 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-03-04 15:28:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:38,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:38,462 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_338 (Array Int Int)) (v_~q1_front~0_84 Int) (v_~q1_back~0_140 Int)) (let ((.cse0 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_338) c_~q1~0.base))) (or (< 2 (select .cse0 (+ (* v_~q1_back~0_140 4) c_~q1~0.offset))) (< v_~q1_front~0_84 0) (< c_~n1~0 (+ v_~q1_back~0_140 1)) (< (select .cse0 (+ (* 4 v_~q1_front~0_84) c_~q1~0.offset)) 2147483649) (< v_~q1_back~0_140 v_~q1_front~0_84)))) is different from false [2025-03-04 15:28:38,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:28:38,638 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 41 [2025-03-04 15:28:38,648 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:28:38,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2025-03-04 15:28:38,657 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 15:28:38,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 15:28:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 15:28:38,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422812152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:38,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:38,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2025-03-04 15:28:38,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412298231] [2025-03-04 15:28:38,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:38,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 15:28:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:38,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:28:38,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=619, Unknown=1, NotChecked=52, Total=812 [2025-03-04 15:28:38,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 90 [2025-03-04 15:28:38,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 253 transitions, 2417 flow. Second operand has 29 states, 29 states have (on average 14.241379310344827) internal successors, (413), 29 states have internal predecessors, (413), 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-03-04 15:28:38,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:38,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 90 [2025-03-04 15:28:38,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:51,687 INFO L124 PetriNetUnfolderBase]: 57694/87706 cut-off events. [2025-03-04 15:28:51,687 INFO L125 PetriNetUnfolderBase]: For 213198/214116 co-relation queries the response was YES. [2025-03-04 15:28:52,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301417 conditions, 87706 events. 57694/87706 cut-off events. For 213198/214116 co-relation queries the response was YES. Maximal size of possible extension queue 1859. Compared 645524 event pairs, 8221 based on Foata normal form. 494/80868 useless extension candidates. Maximal degree in co-relation 301353. Up to 30006 conditions per place. [2025-03-04 15:28:52,891 INFO L140 encePairwiseOnDemand]: 67/90 looper letters, 612 selfloop transitions, 223 changer transitions 13/859 dead transitions. [2025-03-04 15:28:52,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 859 transitions, 7887 flow [2025-03-04 15:28:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 15:28:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 15:28:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 1103 transitions. [2025-03-04 15:28:52,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2723456790123457 [2025-03-04 15:28:52,893 INFO L175 Difference]: Start difference. First operand has 178 places, 253 transitions, 2417 flow. Second operand 45 states and 1103 transitions. [2025-03-04 15:28:52,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 859 transitions, 7887 flow [2025-03-04 15:28:53,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 859 transitions, 7819 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 15:28:53,752 INFO L231 Difference]: Finished difference. Result has 240 places, 364 transitions, 4290 flow [2025-03-04 15:28:53,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=2367, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=4290, PETRI_PLACES=240, PETRI_TRANSITIONS=364} [2025-03-04 15:28:53,752 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, 155 predicate places. [2025-03-04 15:28:53,752 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 364 transitions, 4290 flow [2025-03-04 15:28:53,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 14.241379310344827) internal successors, (413), 29 states have internal predecessors, (413), 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-03-04 15:28:53,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:53,753 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] [2025-03-04 15:28:53,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 15:28:53,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 15:28:53,957 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2025-03-04 15:28:53,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:53,957 INFO L85 PathProgramCache]: Analyzing trace with hash 271508727, now seen corresponding path program 1 times [2025-03-04 15:28:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:53,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160918031] [2025-03-04 15:28:53,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:53,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:53,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:28:53,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:28:53,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:53,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160918031] [2025-03-04 15:28:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160918031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476865054] [2025-03-04 15:28:54,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:54,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:54,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:54,370 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:54,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:28:54,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:28:54,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:28:54,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:54,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:54,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:28:54,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:54,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:28:54,479 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 23 treesize of output 1 [2025-03-04 15:28:54,522 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:28:54,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:28:54,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 15:28:54,696 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-03-04 15:28:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:54,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:55,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:28:55,134 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2025-03-04 15:28:55,144 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:28:55,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 50 [2025-03-04 15:28:55,152 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 15:28:55,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-03-04 15:28:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476865054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:55,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2025-03-04 15:28:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277496209] [2025-03-04 15:28:55,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:55,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 15:28:55,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:55,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 15:28:55,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=835, Unknown=4, NotChecked=0, Total=992 [2025-03-04 15:28:55,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 90 [2025-03-04 15:28:55,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 364 transitions, 4290 flow. Second operand has 32 states, 32 states have (on average 14.0625) internal successors, (450), 32 states have internal predecessors, (450), 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-03-04 15:28:55,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:55,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 90 [2025-03-04 15:28:55,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand