/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:17:59,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:17:59,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:17:59,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:17:59,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:17:59,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:17:59,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:17:59,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:17:59,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:17:59,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:17:59,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:17:59,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:17:59,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:17:59,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:17:59,642 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:17:59,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:17:59,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:17:59,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:17:59,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:17:59,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:17:59,644 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:17:59,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:17:59,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:17:59,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:17:59,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:17:59,830 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:17:59,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-04-13 20:18:01,094 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92863bd7c/601b3d580e434898a4c5c73cc2bfbfbc/FLAG8d1a60a6a [2025-04-13 20:18:01,283 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:18:01,284 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-04-13 20:18:01,289 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92863bd7c/601b3d580e434898a4c5c73cc2bfbfbc/FLAG8d1a60a6a [2025-04-13 20:18:02,144 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92863bd7c/601b3d580e434898a4c5c73cc2bfbfbc [2025-04-13 20:18:02,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:18:02,147 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:18:02,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:18:02,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:18:02,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:18:02,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1eac4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02, skipping insertion in model container [2025-04-13 20:18:02,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:18:02,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-04-13 20:18:02,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:18:02,361 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:18:02,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-04-13 20:18:02,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:18:02,410 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:18:02,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02 WrapperNode [2025-04-13 20:18:02,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:18:02,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:18:02,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:18:02,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:18:02,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,449 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2025-04-13 20:18:02,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:18:02,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:18:02,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:18:02,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:18:02,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,484 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:18:02,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:18:02,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:18:02,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:18:02,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:18:02,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (1/1) ... [2025-04-13 20:18:02,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:18:02,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:02,519 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-04-13 20:18:02,523 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-04-13 20:18:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:18:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:18:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:18:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:18:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:18:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:18:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:18:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:18:02,539 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:18:02,614 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:18:02,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:18:02,884 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:18:02,885 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:18:02,885 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:18:03,137 INFO L313 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-13 20:18:03,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:18:03 BoogieIcfgContainer [2025-04-13 20:18:03,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:18:03,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:18:03,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:18:03,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:18:03,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:18:02" (1/3) ... [2025-04-13 20:18:03,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec1fb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:18:03, skipping insertion in model container [2025-04-13 20:18:03,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:18:02" (2/3) ... [2025-04-13 20:18:03,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec1fb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:18:03, skipping insertion in model container [2025-04-13 20:18:03,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:18:03" (3/3) ... [2025-04-13 20:18:03,143 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-04-13 20:18:03,153 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:18:03,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 44 locations, 43 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:18:03,155 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:18:03,212 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-04-13 20:18:03,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 144 flow [2025-04-13 20:18:03,260 INFO L116 PetriNetUnfolderBase]: 6/45 cut-off events. [2025-04-13 20:18:03,261 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:18:03,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 45 events. 6/45 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-04-13 20:18:03,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 52 transitions, 144 flow [2025-04-13 20:18:03,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 44 transitions, 118 flow [2025-04-13 20:18:03,271 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:18:03,279 INFO L340 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;@385cd845, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:18:03,279 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 20:18:03,294 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:18:03,295 INFO L116 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-04-13 20:18:03,295 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:18:03,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:03,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:03,298 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:03,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:03,302 INFO L85 PathProgramCache]: Analyzing trace with hash -246856055, now seen corresponding path program 1 times [2025-04-13 20:18:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:03,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294070070] [2025-04-13 20:18:03,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:03,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:03,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:18:03,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:18:03,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:03,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:03,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:03,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294070070] [2025-04-13 20:18:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294070070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:18:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426602034] [2025-04-13 20:18:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:03,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:18:03,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:03,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:18:03,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:18:03,647 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:03,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-04-13 20:18:03,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:03,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:03,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:04,966 INFO L116 PetriNetUnfolderBase]: 14118/18823 cut-off events. [2025-04-13 20:18:04,966 INFO L117 PetriNetUnfolderBase]: For 1151/1151 co-relation queries the response was YES. [2025-04-13 20:18:04,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39075 conditions, 18823 events. 14118/18823 cut-off events. For 1151/1151 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 98765 event pairs, 5976 based on Foata normal form. 1/15777 useless extension candidates. Maximal degree in co-relation 38951. Up to 8269 conditions per place. [2025-04-13 20:18:05,051 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 99 selfloop transitions, 6 changer transitions 1/109 dead transitions. [2025-04-13 20:18:05,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 508 flow [2025-04-13 20:18:05,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:18:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:18:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-04-13 20:18:05,063 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-13 20:18:05,064 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 118 flow. Second operand 4 states and 135 transitions. [2025-04-13 20:18:05,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 508 flow [2025-04-13 20:18:05,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 109 transitions, 456 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:18:05,084 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 139 flow [2025-04-13 20:18:05,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2025-04-13 20:18:05,087 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-04-13 20:18:05,087 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 139 flow [2025-04-13 20:18:05,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-04-13 20:18:05,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:05,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:05,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:18:05,088 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:05,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1352831095, now seen corresponding path program 2 times [2025-04-13 20:18:05,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:05,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327614968] [2025-04-13 20:18:05,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:18:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:05,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:18:05,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:18:05,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:18:05,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:05,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327614968] [2025-04-13 20:18:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327614968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:05,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:18:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458759934] [2025-04-13 20:18:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:05,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:18:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:05,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:18:05,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:18:05,205 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:05,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-04-13 20:18:05,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:05,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:05,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:06,575 INFO L116 PetriNetUnfolderBase]: 21267/28542 cut-off events. [2025-04-13 20:18:06,575 INFO L117 PetriNetUnfolderBase]: For 3609/3611 co-relation queries the response was YES. [2025-04-13 20:18:06,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62015 conditions, 28542 events. 21267/28542 cut-off events. For 3609/3611 co-relation queries the response was YES. Maximal size of possible extension queue 1159. Compared 160080 event pairs, 7102 based on Foata normal form. 1/24233 useless extension candidates. Maximal degree in co-relation 20371. Up to 14786 conditions per place. [2025-04-13 20:18:06,682 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 99 selfloop transitions, 10 changer transitions 1/113 dead transitions. [2025-04-13 20:18:06,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 113 transitions, 521 flow [2025-04-13 20:18:06,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:18:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:18:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-13 20:18:06,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-04-13 20:18:06,686 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 139 flow. Second operand 4 states and 134 transitions. [2025-04-13 20:18:06,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 113 transitions, 521 flow [2025-04-13 20:18:06,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 113 transitions, 521 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:18:06,692 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 207 flow [2025-04-13 20:18:06,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2025-04-13 20:18:06,693 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-04-13 20:18:06,693 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 207 flow [2025-04-13 20:18:06,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-04-13 20:18:06,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:06,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:06,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:18:06,696 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:06,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -297476202, now seen corresponding path program 1 times [2025-04-13 20:18:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:06,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665892539] [2025-04-13 20:18:06,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:06,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:18:06,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:18:06,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:06,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:06,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665892539] [2025-04-13 20:18:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665892539] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:06,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:18:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656212896] [2025-04-13 20:18:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:06,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:18:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:06,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:18:06,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:18:06,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:06,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04-13 20:18:06,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:06,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:06,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:08,649 INFO L116 PetriNetUnfolderBase]: 32274/43495 cut-off events. [2025-04-13 20:18:08,650 INFO L117 PetriNetUnfolderBase]: For 16485/16485 co-relation queries the response was YES. [2025-04-13 20:18:08,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100849 conditions, 43495 events. 32274/43495 cut-off events. For 16485/16485 co-relation queries the response was YES. Maximal size of possible extension queue 1774. Compared 260065 event pairs, 20432 based on Foata normal form. 617/37531 useless extension candidates. Maximal degree in co-relation 56094. Up to 28402 conditions per place. [2025-04-13 20:18:08,802 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 117 selfloop transitions, 5 changer transitions 1/126 dead transitions. [2025-04-13 20:18:08,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 690 flow [2025-04-13 20:18:08,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:18:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:18:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-04-13 20:18:08,803 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-04-13 20:18:08,804 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 207 flow. Second operand 5 states and 141 transitions. [2025-04-13 20:18:08,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 126 transitions, 690 flow [2025-04-13 20:18:08,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 682 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-13 20:18:08,850 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 251 flow [2025-04-13 20:18:08,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-04-13 20:18:08,851 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-04-13 20:18:08,851 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 251 flow [2025-04-13 20:18:08,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04-13 20:18:08,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:08,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:08,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:18:08,852 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:08,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash -32000495, now seen corresponding path program 1 times [2025-04-13 20:18:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:08,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627313107] [2025-04-13 20:18:08,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:08,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:18:08,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:18:08,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:08,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:08,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:08,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627313107] [2025-04-13 20:18:08,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627313107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:08,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:08,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:18:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199024490] [2025-04-13 20:18:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:08,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:18:08,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:08,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:18:08,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:18:08,966 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:08,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04-13 20:18:08,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:08,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:08,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:10,509 INFO L116 PetriNetUnfolderBase]: 25204/34184 cut-off events. [2025-04-13 20:18:10,509 INFO L117 PetriNetUnfolderBase]: For 15387/15391 co-relation queries the response was YES. [2025-04-13 20:18:10,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79714 conditions, 34184 events. 25204/34184 cut-off events. For 15387/15391 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 199452 event pairs, 19436 based on Foata normal form. 554/29452 useless extension candidates. Maximal degree in co-relation 67394. Up to 28402 conditions per place. [2025-04-13 20:18:10,600 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 51 selfloop transitions, 2 changer transitions 41/97 dead transitions. [2025-04-13 20:18:10,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 538 flow [2025-04-13 20:18:10,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:18:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:18:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-04-13 20:18:10,601 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2025-04-13 20:18:10,601 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 251 flow. Second operand 5 states and 119 transitions. [2025-04-13 20:18:10,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 538 flow [2025-04-13 20:18:10,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 534 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:18:10,610 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 229 flow [2025-04-13 20:18:10,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-04-13 20:18:10,611 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-04-13 20:18:10,611 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 229 flow [2025-04-13 20:18:10,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04-13 20:18:10,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:10,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:10,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:18:10,611 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:10,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:10,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1549065843, now seen corresponding path program 1 times [2025-04-13 20:18:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:10,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381689890] [2025-04-13 20:18:10,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:10,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:18:10,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:18:10,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:10,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:10,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381689890] [2025-04-13 20:18:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381689890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:10,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377953800] [2025-04-13 20:18:10,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:10,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:10,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:10,712 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-04-13 20:18:10,713 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-04-13 20:18:10,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:18:10,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:18:10,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:10,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:10,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:18:10,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:10,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377953800] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:18:10,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:18:10,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:18:10,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034189599] [2025-04-13 20:18:10,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:18:10,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:18:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:10,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:18:10,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:18:10,905 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:10,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 229 flow. Second operand has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 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-04-13 20:18:10,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:10,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:10,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:12,789 INFO L116 PetriNetUnfolderBase]: 32274/43496 cut-off events. [2025-04-13 20:18:12,789 INFO L117 PetriNetUnfolderBase]: For 23705/23705 co-relation queries the response was YES. [2025-04-13 20:18:12,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105243 conditions, 43496 events. 32274/43496 cut-off events. For 23705/23705 co-relation queries the response was YES. Maximal size of possible extension queue 1774. Compared 262491 event pairs, 15134 based on Foata normal form. 617/37550 useless extension candidates. Maximal degree in co-relation 105222. Up to 20010 conditions per place. [2025-04-13 20:18:12,961 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 149 selfloop transitions, 7 changer transitions 1/160 dead transitions. [2025-04-13 20:18:12,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 160 transitions, 927 flow [2025-04-13 20:18:12,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:18:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:18:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2025-04-13 20:18:12,963 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-13 20:18:12,963 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 229 flow. Second operand 7 states and 182 transitions. [2025-04-13 20:18:12,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 160 transitions, 927 flow [2025-04-13 20:18:13,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 160 transitions, 901 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-13 20:18:13,018 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 278 flow [2025-04-13 20:18:13,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-04-13 20:18:13,019 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2025-04-13 20:18:13,019 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 278 flow [2025-04-13 20:18:13,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 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-04-13 20:18:13,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:13,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:13,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:18:13,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:13,220 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:13,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1028819554, now seen corresponding path program 1 times [2025-04-13 20:18:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:13,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84147950] [2025-04-13 20:18:13,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:13,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:18:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:18:13,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:13,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:13,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84147950] [2025-04-13 20:18:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84147950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:13,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517673234] [2025-04-13 20:18:13,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:13,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:13,366 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-04-13 20:18:13,367 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-04-13 20:18:13,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:18:13,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:18:13,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:13,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:13,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:18:13,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:13,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:13,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517673234] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:18:13,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:18:13,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:18:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114067833] [2025-04-13 20:18:13,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:18:13,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:18:13,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:13,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:18:13,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:18:13,576 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:13,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 278 flow. Second operand has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:13,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:13,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:13,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:15,222 INFO L116 PetriNetUnfolderBase]: 24592/33573 cut-off events. [2025-04-13 20:18:15,222 INFO L117 PetriNetUnfolderBase]: For 19099/19103 co-relation queries the response was YES. [2025-04-13 20:18:15,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82209 conditions, 33573 events. 24592/33573 cut-off events. For 19099/19103 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 198878 event pairs, 10277 based on Foata normal form. 1166/29453 useless extension candidates. Maximal degree in co-relation 69590. Up to 14697 conditions per place. [2025-04-13 20:18:15,313 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 78 selfloop transitions, 5 changer transitions 43/129 dead transitions. [2025-04-13 20:18:15,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 129 transitions, 769 flow [2025-04-13 20:18:15,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:18:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:18:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-04-13 20:18:15,315 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41534391534391535 [2025-04-13 20:18:15,315 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 278 flow. Second operand 7 states and 157 transitions. [2025-04-13 20:18:15,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 129 transitions, 769 flow [2025-04-13 20:18:15,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 129 transitions, 761 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:18:15,324 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 272 flow [2025-04-13 20:18:15,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2025-04-13 20:18:15,325 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2025-04-13 20:18:15,325 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 272 flow [2025-04-13 20:18:15,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:15,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:15,325 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:15,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:18:15,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:18:15,529 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:15,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2133171664, now seen corresponding path program 2 times [2025-04-13 20:18:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:15,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146046342] [2025-04-13 20:18:15,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:18:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:15,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 20:18:15,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:18:15,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:18:15,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:18:15,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:15,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146046342] [2025-04-13 20:18:15,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146046342] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:15,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887728156] [2025-04-13 20:18:15,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:18:15,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:15,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:15,660 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-04-13 20:18:15,661 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-04-13 20:18:15,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 20:18:15,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:18:15,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:18:15,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:15,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:18:15,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:18:15,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:18:15,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887728156] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:15,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:18:15,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 20:18:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974702765] [2025-04-13 20:18:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:15,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:18:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:15,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:18:15,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:18:15,875 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:15,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-04-13 20:18:15,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:15,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:15,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:16,799 INFO L116 PetriNetUnfolderBase]: 15939/21466 cut-off events. [2025-04-13 20:18:16,799 INFO L117 PetriNetUnfolderBase]: For 20305/20309 co-relation queries the response was YES. [2025-04-13 20:18:16,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59402 conditions, 21466 events. 15939/21466 cut-off events. For 20305/20309 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 115501 event pairs, 7405 based on Foata normal form. 562/18561 useless extension candidates. Maximal degree in co-relation 59362. Up to 17968 conditions per place. [2025-04-13 20:18:16,885 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 70 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2025-04-13 20:18:16,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 80 transitions, 508 flow [2025-04-13 20:18:16,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:18:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:18:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2025-04-13 20:18:16,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3271604938271605 [2025-04-13 20:18:16,886 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 272 flow. Second operand 6 states and 106 transitions. [2025-04-13 20:18:16,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 80 transitions, 508 flow [2025-04-13 20:18:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 80 transitions, 462 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-04-13 20:18:16,939 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 274 flow [2025-04-13 20:18:16,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-04-13 20:18:16,940 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2025-04-13 20:18:16,940 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 274 flow [2025-04-13 20:18:16,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-04-13 20:18:16,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:16,940 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:16,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:18:17,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:17,143 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:17,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash -312937493, now seen corresponding path program 2 times [2025-04-13 20:18:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:17,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629962988] [2025-04-13 20:18:17,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:18:17,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:17,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 20:18:17,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-13 20:18:17,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:18:17,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:17,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:17,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629962988] [2025-04-13 20:18:17,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629962988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:17,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:17,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:18:17,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478842637] [2025-04-13 20:18:17,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:17,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:18:17,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:17,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:18:17,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:18:17,213 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:17,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04-13 20:18:17,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:17,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:17,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:18,478 INFO L116 PetriNetUnfolderBase]: 18564/24932 cut-off events. [2025-04-13 20:18:18,478 INFO L117 PetriNetUnfolderBase]: For 15213/15217 co-relation queries the response was YES. [2025-04-13 20:18:18,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66002 conditions, 24932 events. 18564/24932 cut-off events. For 15213/15217 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 134990 event pairs, 2111 based on Foata normal form. 287/21053 useless extension candidates. Maximal degree in co-relation 65967. Up to 17854 conditions per place. [2025-04-13 20:18:18,599 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 109 selfloop transitions, 7 changer transitions 1/120 dead transitions. [2025-04-13 20:18:18,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 120 transitions, 706 flow [2025-04-13 20:18:18,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:18:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:18:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-13 20:18:18,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2025-04-13 20:18:18,600 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 274 flow. Second operand 5 states and 131 transitions. [2025-04-13 20:18:18,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 120 transitions, 706 flow [2025-04-13 20:18:18,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 684 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 20:18:18,666 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 304 flow [2025-04-13 20:18:18,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2025-04-13 20:18:18,666 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2025-04-13 20:18:18,666 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 304 flow [2025-04-13 20:18:18,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04-13 20:18:18,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:18,667 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:18,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:18:18,667 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:18,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1654104055, now seen corresponding path program 3 times [2025-04-13 20:18:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:18,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579194504] [2025-04-13 20:18:18,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:18:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:18,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-04-13 20:18:18,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-13 20:18:18,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:18:18,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:18,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579194504] [2025-04-13 20:18:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579194504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:18,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:18,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:18:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380364884] [2025-04-13 20:18:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:18,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:18:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:18,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:18:18,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:18:18,742 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:18,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04-13 20:18:18,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:18,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:18,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:19,976 INFO L116 PetriNetUnfolderBase]: 18508/24890 cut-off events. [2025-04-13 20:18:19,976 INFO L117 PetriNetUnfolderBase]: For 21797/21801 co-relation queries the response was YES. [2025-04-13 20:18:20,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66969 conditions, 24890 events. 18508/24890 cut-off events. For 21797/21801 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 136391 event pairs, 7958 based on Foata normal form. 58/20794 useless extension candidates. Maximal degree in co-relation 66935. Up to 21395 conditions per place. [2025-04-13 20:18:20,059 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 86 selfloop transitions, 8 changer transitions 12/109 dead transitions. [2025-04-13 20:18:20,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 644 flow [2025-04-13 20:18:20,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:18:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:18:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-04-13 20:18:20,060 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45925925925925926 [2025-04-13 20:18:20,060 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 304 flow. Second operand 5 states and 124 transitions. [2025-04-13 20:18:20,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 644 flow [2025-04-13 20:18:20,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 109 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:18:20,089 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 338 flow [2025-04-13 20:18:20,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2025-04-13 20:18:20,090 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2025-04-13 20:18:20,090 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 338 flow [2025-04-13 20:18:20,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04-13 20:18:20,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:20,090 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:20,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:18:20,091 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:20,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1144178607, now seen corresponding path program 4 times [2025-04-13 20:18:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:20,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223069021] [2025-04-13 20:18:20,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:18:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:20,097 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 20:18:20,099 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 37 statements. [2025-04-13 20:18:20,099 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:18:20,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:20,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:20,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223069021] [2025-04-13 20:18:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223069021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:20,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:20,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:18:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450987387] [2025-04-13 20:18:20,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:20,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:18:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:20,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:18:20,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:18:20,127 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:20,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04-13 20:18:20,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:20,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:20,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:21,293 INFO L116 PetriNetUnfolderBase]: 22370/29956 cut-off events. [2025-04-13 20:18:21,293 INFO L117 PetriNetUnfolderBase]: For 27128/27132 co-relation queries the response was YES. [2025-04-13 20:18:21,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81622 conditions, 29956 events. 22370/29956 cut-off events. For 27128/27132 co-relation queries the response was YES. Maximal size of possible extension queue 1257. Compared 165774 event pairs, 5095 based on Foata normal form. 287/24923 useless extension candidates. Maximal degree in co-relation 81587. Up to 19765 conditions per place. [2025-04-13 20:18:21,452 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 119 selfloop transitions, 13 changer transitions 2/137 dead transitions. [2025-04-13 20:18:21,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 137 transitions, 852 flow [2025-04-13 20:18:21,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:18:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:18:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-04-13 20:18:21,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5148148148148148 [2025-04-13 20:18:21,453 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 338 flow. Second operand 5 states and 139 transitions. [2025-04-13 20:18:21,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 137 transitions, 852 flow [2025-04-13 20:18:21,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 137 transitions, 836 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:18:21,488 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 395 flow [2025-04-13 20:18:21,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-04-13 20:18:21,489 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2025-04-13 20:18:21,489 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 395 flow [2025-04-13 20:18:21,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04-13 20:18:21,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:21,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:21,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:18:21,489 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:21,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash 226444247, now seen corresponding path program 5 times [2025-04-13 20:18:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:21,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083452901] [2025-04-13 20:18:21,489 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:18:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:21,496 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 20:18:21,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:18:21,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:18:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:21,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083452901] [2025-04-13 20:18:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083452901] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:21,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914454428] [2025-04-13 20:18:21,558 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:18:21,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:21,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:21,559 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-04-13 20:18:21,562 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-04-13 20:18:21,607 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 20:18:21,627 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:18:21,627 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:18:21,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:21,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:18:21,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:21,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:21,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914454428] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:21,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:18:21,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 20:18:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789769466] [2025-04-13 20:18:21,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:21,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:18:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:21,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:18:21,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:18:21,705 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:21,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-04-13 20:18:21,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:21,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:21,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:22,957 INFO L116 PetriNetUnfolderBase]: 20320/27169 cut-off events. [2025-04-13 20:18:22,957 INFO L117 PetriNetUnfolderBase]: For 37018/37018 co-relation queries the response was YES. [2025-04-13 20:18:23,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77666 conditions, 27169 events. 20320/27169 cut-off events. For 37018/37018 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 147611 event pairs, 9565 based on Foata normal form. 341/22599 useless extension candidates. Maximal degree in co-relation 77629. Up to 13716 conditions per place. [2025-04-13 20:18:23,082 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 92 selfloop transitions, 12 changer transitions 1/108 dead transitions. [2025-04-13 20:18:23,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 108 transitions, 763 flow [2025-04-13 20:18:23,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:18:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:18:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-04-13 20:18:23,083 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3549382716049383 [2025-04-13 20:18:23,084 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 395 flow. Second operand 6 states and 115 transitions. [2025-04-13 20:18:23,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 108 transitions, 763 flow [2025-04-13 20:18:23,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 108 transitions, 758 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:18:23,149 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 436 flow [2025-04-13 20:18:23,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2025-04-13 20:18:23,150 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2025-04-13 20:18:23,150 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 436 flow [2025-04-13 20:18:23,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-04-13 20:18:23,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:23,150 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:23,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:18:23,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:23,351 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:23,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash -222808174, now seen corresponding path program 1 times [2025-04-13 20:18:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:23,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763351551] [2025-04-13 20:18:23,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:23,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:18:23,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:18:23,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:23,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:23,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:23,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763351551] [2025-04-13 20:18:23,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763351551] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:23,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574021213] [2025-04-13 20:18:23,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:23,892 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-04-13 20:18:23,894 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-04-13 20:18:23,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:18:23,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:18:23,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:23,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:23,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:18:23,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:24,077 INFO L354 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 19 treesize of output 7 [2025-04-13 20:18:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:24,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:18:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574021213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:24,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:18:24,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-13 20:18:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205042437] [2025-04-13 20:18:24,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:24,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:18:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:24,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:18:24,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:18:24,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:24,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 436 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:18:24,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:24,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:24,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:26,188 INFO L116 PetriNetUnfolderBase]: 30889/41409 cut-off events. [2025-04-13 20:18:26,189 INFO L117 PetriNetUnfolderBase]: For 64456/64456 co-relation queries the response was YES. [2025-04-13 20:18:26,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121992 conditions, 41409 events. 30889/41409 cut-off events. For 64456/64456 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 239096 event pairs, 8814 based on Foata normal form. 1/34343 useless extension candidates. Maximal degree in co-relation 121951. Up to 12690 conditions per place. [2025-04-13 20:18:26,425 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 248 selfloop transitions, 30 changer transitions 3/284 dead transitions. [2025-04-13 20:18:26,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 284 transitions, 1833 flow [2025-04-13 20:18:26,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:18:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:18:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 310 transitions. [2025-04-13 20:18:26,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-13 20:18:26,427 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 436 flow. Second operand 10 states and 310 transitions. [2025-04-13 20:18:26,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 284 transitions, 1833 flow [2025-04-13 20:18:26,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 284 transitions, 1757 flow, removed 30 selfloop flow, removed 4 redundant places. [2025-04-13 20:18:26,616 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 608 flow [2025-04-13 20:18:26,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=608, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-04-13 20:18:26,616 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 39 predicate places. [2025-04-13 20:18:26,616 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 608 flow [2025-04-13 20:18:26,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:18:26,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:26,617 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:26,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:18:26,821 WARN L466 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-04-13 20:18:26,821 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:26,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1826009058, now seen corresponding path program 2 times [2025-04-13 20:18:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:26,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480935731] [2025-04-13 20:18:26,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:18:26,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:26,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:18:26,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:18:26,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:18:26,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:27,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:27,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480935731] [2025-04-13 20:18:27,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480935731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:27,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:18:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842811290] [2025-04-13 20:18:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:27,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:18:27,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:27,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:18:27,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:18:27,021 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:27,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 608 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:18:27,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:27,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:29,257 INFO L116 PetriNetUnfolderBase]: 34882/46835 cut-off events. [2025-04-13 20:18:29,257 INFO L117 PetriNetUnfolderBase]: For 76692/76696 co-relation queries the response was YES. [2025-04-13 20:18:29,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139087 conditions, 46835 events. 34882/46835 cut-off events. For 76692/76696 co-relation queries the response was YES. Maximal size of possible extension queue 1591. Compared 274875 event pairs, 14753 based on Foata normal form. 3/38937 useless extension candidates. Maximal degree in co-relation 139045. Up to 36836 conditions per place. [2025-04-13 20:18:29,559 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 171 selfloop transitions, 27 changer transitions 2/203 dead transitions. [2025-04-13 20:18:29,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 203 transitions, 1455 flow [2025-04-13 20:18:29,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:18:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:18:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-04-13 20:18:29,560 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4837962962962963 [2025-04-13 20:18:29,561 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 608 flow. Second operand 8 states and 209 transitions. [2025-04-13 20:18:29,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 203 transitions, 1455 flow [2025-04-13 20:18:29,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 203 transitions, 1369 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-04-13 20:18:29,775 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 733 flow [2025-04-13 20:18:29,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=733, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-04-13 20:18:29,776 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2025-04-13 20:18:29,776 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 733 flow [2025-04-13 20:18:29,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:18:29,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:29,776 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:29,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:18:29,777 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:29,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -351965944, now seen corresponding path program 3 times [2025-04-13 20:18:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:29,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406265614] [2025-04-13 20:18:29,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:18:29,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:29,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:18:29,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:18:29,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:18:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:29,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:29,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406265614] [2025-04-13 20:18:29,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406265614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:29,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:29,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:18:29,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521376684] [2025-04-13 20:18:29,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:29,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:18:29,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:29,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:18:29,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:18:29,999 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:29,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 733 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:29,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:29,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:29,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:32,734 INFO L116 PetriNetUnfolderBase]: 39536/53140 cut-off events. [2025-04-13 20:18:32,734 INFO L117 PetriNetUnfolderBase]: For 82655/82659 co-relation queries the response was YES. [2025-04-13 20:18:32,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159288 conditions, 53140 events. 39536/53140 cut-off events. For 82655/82659 co-relation queries the response was YES. Maximal size of possible extension queue 1855. Compared 319394 event pairs, 15802 based on Foata normal form. 3/44282 useless extension candidates. Maximal degree in co-relation 159244. Up to 41821 conditions per place. [2025-04-13 20:18:33,045 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 220 selfloop transitions, 38 changer transitions 4/265 dead transitions. [2025-04-13 20:18:33,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 265 transitions, 1840 flow [2025-04-13 20:18:33,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:18:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:18:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 272 transitions. [2025-04-13 20:18:33,046 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-04-13 20:18:33,046 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 733 flow. Second operand 10 states and 272 transitions. [2025-04-13 20:18:33,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 265 transitions, 1840 flow [2025-04-13 20:18:33,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 265 transitions, 1806 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-04-13 20:18:33,384 INFO L231 Difference]: Finished difference. Result has 107 places, 121 transitions, 992 flow [2025-04-13 20:18:33,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=992, PETRI_PLACES=107, PETRI_TRANSITIONS=121} [2025-04-13 20:18:33,385 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 56 predicate places. [2025-04-13 20:18:33,385 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 121 transitions, 992 flow [2025-04-13 20:18:33,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:33,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:33,385 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:33,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:18:33,385 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:33,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:33,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1116323436, now seen corresponding path program 1 times [2025-04-13 20:18:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:33,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988215180] [2025-04-13 20:18:33,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:33,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:18:33,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:18:33,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:33,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:33,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988215180] [2025-04-13 20:18:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988215180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:33,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7340780] [2025-04-13 20:18:33,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:33,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:33,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:33,748 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-04-13 20:18:33,750 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-04-13 20:18:33,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:18:33,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:18:33,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:33,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:33,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:18:33,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:33,945 INFO L354 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 19 treesize of output 7 [2025-04-13 20:18:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:33,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:18:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7340780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:33,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:18:33,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-13 20:18:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177962385] [2025-04-13 20:18:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:33,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:18:33,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:33,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:18:33,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:18:33,956 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:33,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 992 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:18:33,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:33,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:33,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:37,077 INFO L116 PetriNetUnfolderBase]: 44222/59449 cut-off events. [2025-04-13 20:18:37,077 INFO L117 PetriNetUnfolderBase]: For 117278/117282 co-relation queries the response was YES. [2025-04-13 20:18:37,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188735 conditions, 59449 events. 44222/59449 cut-off events. For 117278/117282 co-relation queries the response was YES. Maximal size of possible extension queue 2201. Compared 361235 event pairs, 18556 based on Foata normal form. 3/49625 useless extension candidates. Maximal degree in co-relation 188685. Up to 48184 conditions per place. [2025-04-13 20:18:37,491 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 216 selfloop transitions, 36 changer transitions 4/259 dead transitions. [2025-04-13 20:18:37,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 259 transitions, 2090 flow [2025-04-13 20:18:37,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:18:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:18:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2025-04-13 20:18:37,492 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49176954732510286 [2025-04-13 20:18:37,492 INFO L175 Difference]: Start difference. First operand has 107 places, 121 transitions, 992 flow. Second operand 9 states and 239 transitions. [2025-04-13 20:18:37,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 259 transitions, 2090 flow [2025-04-13 20:18:38,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 259 transitions, 2034 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-04-13 20:18:38,139 INFO L231 Difference]: Finished difference. Result has 116 places, 133 transitions, 1190 flow [2025-04-13 20:18:38,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1190, PETRI_PLACES=116, PETRI_TRANSITIONS=133} [2025-04-13 20:18:38,139 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 65 predicate places. [2025-04-13 20:18:38,140 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 133 transitions, 1190 flow [2025-04-13 20:18:38,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:18:38,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:38,140 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:38,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:18:38,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:18:38,340 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:38,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1422852759, now seen corresponding path program 1 times [2025-04-13 20:18:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:38,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131528356] [2025-04-13 20:18:38,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:38,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:18:38,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:18:38,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:38,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:38,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131528356] [2025-04-13 20:18:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131528356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:38,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125458196] [2025-04-13 20:18:38,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:38,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:38,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:38,673 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-04-13 20:18:38,674 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-04-13 20:18:38,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:18:38,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:18:38,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:38,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:38,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:18:38,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:38,858 INFO L354 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 19 treesize of output 7 [2025-04-13 20:18:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:38,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:38,947 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:18:38,948 INFO L354 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 25 treesize of output 16 [2025-04-13 20:18:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:38,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125458196] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:18:38,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:18:38,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2025-04-13 20:18:38,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838348983] [2025-04-13 20:18:38,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:18:38,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:18:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:38,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:18:38,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:18:38,977 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:38,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 133 transitions, 1190 flow. Second operand has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 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-04-13 20:18:38,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:38,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:38,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:43,499 INFO L116 PetriNetUnfolderBase]: 48795/65629 cut-off events. [2025-04-13 20:18:43,500 INFO L117 PetriNetUnfolderBase]: For 147373/147377 co-relation queries the response was YES. [2025-04-13 20:18:43,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214346 conditions, 65629 events. 48795/65629 cut-off events. For 147373/147377 co-relation queries the response was YES. Maximal size of possible extension queue 2447. Compared 405702 event pairs, 20489 based on Foata normal form. 3/54952 useless extension candidates. Maximal degree in co-relation 214291. Up to 54534 conditions per place. [2025-04-13 20:18:43,878 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 222 selfloop transitions, 48 changer transitions 2/275 dead transitions. [2025-04-13 20:18:43,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 275 transitions, 2343 flow [2025-04-13 20:18:43,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:18:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:18:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 284 transitions. [2025-04-13 20:18:43,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37566137566137564 [2025-04-13 20:18:43,880 INFO L175 Difference]: Start difference. First operand has 116 places, 133 transitions, 1190 flow. Second operand 14 states and 284 transitions. [2025-04-13 20:18:43,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 275 transitions, 2343 flow [2025-04-13 20:18:44,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 275 transitions, 2267 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-04-13 20:18:44,554 INFO L231 Difference]: Finished difference. Result has 130 places, 152 transitions, 1487 flow [2025-04-13 20:18:44,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1487, PETRI_PLACES=130, PETRI_TRANSITIONS=152} [2025-04-13 20:18:44,555 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 79 predicate places. [2025-04-13 20:18:44,555 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 152 transitions, 1487 flow [2025-04-13 20:18:44,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 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-04-13 20:18:44,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:44,555 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:44,561 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-04-13 20:18:44,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:44,756 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:44,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1005043561, now seen corresponding path program 2 times [2025-04-13 20:18:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:44,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253367246] [2025-04-13 20:18:44,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:18:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:44,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:18:44,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:18:44,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:18:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:44,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253367246] [2025-04-13 20:18:44,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253367246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:44,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:44,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:18:44,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033718956] [2025-04-13 20:18:44,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:44,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:18:44,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:44,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:18:44,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:18:44,923 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:44,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 152 transitions, 1487 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:44,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:44,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:44,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:49,650 INFO L116 PetriNetUnfolderBase]: 52321/70407 cut-off events. [2025-04-13 20:18:49,650 INFO L117 PetriNetUnfolderBase]: For 180098/180102 co-relation queries the response was YES. [2025-04-13 20:18:50,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236397 conditions, 70407 events. 52321/70407 cut-off events. For 180098/180102 co-relation queries the response was YES. Maximal size of possible extension queue 2667. Compared 440744 event pairs, 23027 based on Foata normal form. 3/59062 useless extension candidates. Maximal degree in co-relation 236333. Up to 59508 conditions per place. [2025-04-13 20:18:50,322 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 242 selfloop transitions, 46 changer transitions 3/294 dead transitions. [2025-04-13 20:18:50,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 294 transitions, 2603 flow [2025-04-13 20:18:50,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:18:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:18:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions. [2025-04-13 20:18:50,324 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2025-04-13 20:18:50,324 INFO L175 Difference]: Start difference. First operand has 130 places, 152 transitions, 1487 flow. Second operand 10 states and 258 transitions. [2025-04-13 20:18:50,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 294 transitions, 2603 flow [2025-04-13 20:18:51,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 294 transitions, 2532 flow, removed 22 selfloop flow, removed 6 redundant places. [2025-04-13 20:18:51,201 INFO L231 Difference]: Finished difference. Result has 137 places, 162 transitions, 1678 flow [2025-04-13 20:18:51,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1678, PETRI_PLACES=137, PETRI_TRANSITIONS=162} [2025-04-13 20:18:51,202 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 86 predicate places. [2025-04-13 20:18:51,202 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 162 transitions, 1678 flow [2025-04-13 20:18:51,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:51,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:51,202 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:51,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:18:51,202 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:51,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1652820717, now seen corresponding path program 3 times [2025-04-13 20:18:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:51,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22357089] [2025-04-13 20:18:51,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:18:51,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:51,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:18:51,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:18:51,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:18:51,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:51,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22357089] [2025-04-13 20:18:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22357089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:51,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:18:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730371145] [2025-04-13 20:18:51,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:51,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:18:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:51,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:18:51,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:18:51,347 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:51,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 162 transitions, 1678 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:51,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:51,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:57,022 INFO L116 PetriNetUnfolderBase]: 55821/75138 cut-off events. [2025-04-13 20:18:57,022 INFO L117 PetriNetUnfolderBase]: For 243254/243258 co-relation queries the response was YES. [2025-04-13 20:18:57,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264408 conditions, 75138 events. 55821/75138 cut-off events. For 243254/243258 co-relation queries the response was YES. Maximal size of possible extension queue 2894. Compared 474888 event pairs, 24920 based on Foata normal form. 3/63156 useless extension candidates. Maximal degree in co-relation 264342. Up to 64296 conditions per place. [2025-04-13 20:18:57,609 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 235 selfloop transitions, 45 changer transitions 2/285 dead transitions. [2025-04-13 20:18:57,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 285 transitions, 2740 flow [2025-04-13 20:18:57,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:18:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:18:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions. [2025-04-13 20:18:57,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-13 20:18:57,611 INFO L175 Difference]: Start difference. First operand has 137 places, 162 transitions, 1678 flow. Second operand 9 states and 234 transitions. [2025-04-13 20:18:57,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 285 transitions, 2740 flow [2025-04-13 20:18:58,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 285 transitions, 2651 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-04-13 20:18:58,884 INFO L231 Difference]: Finished difference. Result has 143 places, 171 transitions, 1852 flow [2025-04-13 20:18:58,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1852, PETRI_PLACES=143, PETRI_TRANSITIONS=171} [2025-04-13 20:18:58,884 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 92 predicate places. [2025-04-13 20:18:58,884 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 171 transitions, 1852 flow [2025-04-13 20:18:58,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:58,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:58,885 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:58,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:18:58,885 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:18:58,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:58,885 INFO L85 PathProgramCache]: Analyzing trace with hash -636186513, now seen corresponding path program 4 times [2025-04-13 20:18:58,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:58,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861660902] [2025-04-13 20:18:58,885 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:18:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:58,891 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:18:58,898 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:18:58,898 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:18:58,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:18:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:59,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861660902] [2025-04-13 20:18:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861660902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:18:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034148308] [2025-04-13 20:18:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:59,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:18:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:59,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:18:59,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:18:59,016 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:18:59,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 171 transitions, 1852 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:18:59,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:59,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:18:59,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:05,160 INFO L116 PetriNetUnfolderBase]: 59475/80075 cut-off events. [2025-04-13 20:19:05,161 INFO L117 PetriNetUnfolderBase]: For 323280/323284 co-relation queries the response was YES. [2025-04-13 20:19:05,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293845 conditions, 80075 events. 59475/80075 cut-off events. For 323280/323284 co-relation queries the response was YES. Maximal size of possible extension queue 3148. Compared 510975 event pairs, 27210 based on Foata normal form. 3/67448 useless extension candidates. Maximal degree in co-relation 293776. Up to 69043 conditions per place. [2025-04-13 20:19:05,777 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 232 selfloop transitions, 46 changer transitions 3/284 dead transitions. [2025-04-13 20:19:05,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 284 transitions, 2961 flow [2025-04-13 20:19:05,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:19:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:19:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions. [2025-04-13 20:19:05,778 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-04-13 20:19:05,778 INFO L175 Difference]: Start difference. First operand has 143 places, 171 transitions, 1852 flow. Second operand 10 states and 234 transitions. [2025-04-13 20:19:05,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 284 transitions, 2961 flow [2025-04-13 20:19:07,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 284 transitions, 2863 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-04-13 20:19:07,331 INFO L231 Difference]: Finished difference. Result has 150 places, 180 transitions, 2048 flow [2025-04-13 20:19:07,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1757, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2048, PETRI_PLACES=150, PETRI_TRANSITIONS=180} [2025-04-13 20:19:07,332 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 99 predicate places. [2025-04-13 20:19:07,332 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 180 transitions, 2048 flow [2025-04-13 20:19:07,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:19:07,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:07,332 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:19:07,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:19:07,333 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:19:07,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash 567415988, now seen corresponding path program 2 times [2025-04-13 20:19:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:07,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313889327] [2025-04-13 20:19:07,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:19:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:07,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:19:07,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:19:07,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:19:07,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:19:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:07,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313889327] [2025-04-13 20:19:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313889327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:19:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:19:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:19:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157035941] [2025-04-13 20:19:07,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:19:07,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:19:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:07,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:19:07,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:19:07,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:19:07,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 180 transitions, 2048 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:19:07,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:19:07,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:13,826 INFO L116 PetriNetUnfolderBase]: 62742/84474 cut-off events. [2025-04-13 20:19:13,827 INFO L117 PetriNetUnfolderBase]: For 378720/378724 co-relation queries the response was YES. [2025-04-13 20:19:14,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314728 conditions, 84474 events. 62742/84474 cut-off events. For 378720/378724 co-relation queries the response was YES. Maximal size of possible extension queue 3402. Compared 542553 event pairs, 29263 based on Foata normal form. 3/71238 useless extension candidates. Maximal degree in co-relation 314657. Up to 73928 conditions per place. [2025-04-13 20:19:14,529 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 236 selfloop transitions, 46 changer transitions 2/287 dead transitions. [2025-04-13 20:19:14,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 287 transitions, 3185 flow [2025-04-13 20:19:14,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:19:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:19:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-04-13 20:19:14,530 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2025-04-13 20:19:14,530 INFO L175 Difference]: Start difference. First operand has 150 places, 180 transitions, 2048 flow. Second operand 8 states and 207 transitions. [2025-04-13 20:19:14,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 287 transitions, 3185 flow [2025-04-13 20:19:16,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 287 transitions, 3127 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-04-13 20:19:16,023 INFO L231 Difference]: Finished difference. Result has 154 places, 189 transitions, 2312 flow [2025-04-13 20:19:16,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2312, PETRI_PLACES=154, PETRI_TRANSITIONS=189} [2025-04-13 20:19:16,024 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 103 predicate places. [2025-04-13 20:19:16,024 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 189 transitions, 2312 flow [2025-04-13 20:19:16,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:19:16,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:16,024 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:19:16,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:19:16,024 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:19:16,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:16,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1555941129, now seen corresponding path program 1 times [2025-04-13 20:19:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:16,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48472783] [2025-04-13 20:19:16,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:19:16,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:16,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:19:16,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:19:16,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:19:16,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:19:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:16,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48472783] [2025-04-13 20:19:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48472783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:19:16,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321402050] [2025-04-13 20:19:16,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:19:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:19:16,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:19:16,444 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-04-13 20:19:16,446 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-04-13 20:19:16,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:19:16,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:19:16,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:19:16,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:16,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:19:16,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:19:16,593 INFO L354 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 19 treesize of output 7 [2025-04-13 20:19:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:19:16,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:19:16,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321402050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:19:16,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:19:16,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2025-04-13 20:19:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144296111] [2025-04-13 20:19:16,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:19:16,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:19:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:16,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:19:16,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:19:16,616 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:19:16,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 189 transitions, 2312 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:19:16,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:16,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:19:16,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:24,068 INFO L116 PetriNetUnfolderBase]: 66009/88873 cut-off events. [2025-04-13 20:19:24,068 INFO L117 PetriNetUnfolderBase]: For 442347/442351 co-relation queries the response was YES. [2025-04-13 20:19:24,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338033 conditions, 88873 events. 66009/88873 cut-off events. For 442347/442351 co-relation queries the response was YES. Maximal size of possible extension queue 3652. Compared 575284 event pairs, 30947 based on Foata normal form. 3/75028 useless extension candidates. Maximal degree in co-relation 337959. Up to 78323 conditions per place. [2025-04-13 20:19:24,847 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 251 selfloop transitions, 50 changer transitions 3/307 dead transitions. [2025-04-13 20:19:24,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 307 transitions, 3548 flow [2025-04-13 20:19:24,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:19:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:19:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2025-04-13 20:19:24,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-04-13 20:19:24,849 INFO L175 Difference]: Start difference. First operand has 154 places, 189 transitions, 2312 flow. Second operand 9 states and 228 transitions. [2025-04-13 20:19:24,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 307 transitions, 3548 flow [2025-04-13 20:19:26,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 307 transitions, 3478 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-04-13 20:19:26,375 INFO L231 Difference]: Finished difference. Result has 161 places, 198 transitions, 2595 flow [2025-04-13 20:19:26,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2595, PETRI_PLACES=161, PETRI_TRANSITIONS=198} [2025-04-13 20:19:26,375 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 110 predicate places. [2025-04-13 20:19:26,376 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 198 transitions, 2595 flow [2025-04-13 20:19:26,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:19:26,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:26,376 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:19:26,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 20:19:26,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 20:19:26,576 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:19:26,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1789912591, now seen corresponding path program 2 times [2025-04-13 20:19:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:26,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301586832] [2025-04-13 20:19:26,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:19:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:26,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:19:26,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:19:26,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:19:26,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:19:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:26,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301586832] [2025-04-13 20:19:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301586832] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:19:26,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287087213] [2025-04-13 20:19:26,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:19:26,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:19:26,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:19:26,911 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-04-13 20:19:26,913 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-04-13 20:19:26,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:19:26,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:19:26,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:19:26,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:26,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 20:19:26,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:19:26,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:19:27,136 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:19:27,136 INFO L354 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 17 treesize of output 15 [2025-04-13 20:19:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:19:27,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:19:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:19:27,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287087213] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:19:27,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:19:27,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 22 [2025-04-13 20:19:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116110650] [2025-04-13 20:19:27,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:19:27,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:19:27,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:27,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:19:27,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:19:27,380 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:19:27,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 198 transitions, 2595 flow. Second operand has 23 states, 23 states have (on average 10.173913043478262) internal successors, (234), 23 states have internal predecessors, (234), 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-04-13 20:19:27,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:27,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:19:27,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:30,960 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:34,087 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:36,777 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:38,842 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:42,662 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:46,380 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:50,222 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:53,655 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:57,786 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:01,541 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:05,386 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:09,191 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:14,230 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:17,931 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:21,522 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:25,128 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:28,851 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:32,774 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:35,022 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:38,607 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:42,126 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:45,645 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:49,636 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:53,608 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:20:57,452 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:01,962 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:05,970 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:09,978 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:12,927 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:17,077 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:21,046 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:25,055 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:29,863 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:33,875 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:37,883 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:21:45,289 INFO L116 PetriNetUnfolderBase]: 85511/115374 cut-off events. [2025-04-13 20:21:45,289 INFO L117 PetriNetUnfolderBase]: For 678482/678486 co-relation queries the response was YES. [2025-04-13 20:21:46,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450880 conditions, 115374 events. 85511/115374 cut-off events. For 678482/678486 co-relation queries the response was YES. Maximal size of possible extension queue 4559. Compared 763140 event pairs, 26535 based on Foata normal form. 5/97889 useless extension candidates. Maximal degree in co-relation 450803. Up to 74225 conditions per place. [2025-04-13 20:21:46,379 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 557 selfloop transitions, 191 changer transitions 33/784 dead transitions. [2025-04-13 20:21:46,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 784 transitions, 7824 flow [2025-04-13 20:21:46,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 20:21:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-13 20:21:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 859 transitions. [2025-04-13 20:21:46,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4186159844054581 [2025-04-13 20:21:46,381 INFO L175 Difference]: Start difference. First operand has 161 places, 198 transitions, 2595 flow. Second operand 38 states and 859 transitions. [2025-04-13 20:21:46,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 784 transitions, 7824 flow [2025-04-13 20:21:49,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 784 transitions, 7742 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-04-13 20:21:49,051 INFO L231 Difference]: Finished difference. Result has 204 places, 340 transitions, 5383 flow [2025-04-13 20:21:49,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2515, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=5383, PETRI_PLACES=204, PETRI_TRANSITIONS=340} [2025-04-13 20:21:49,051 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 153 predicate places. [2025-04-13 20:21:49,051 INFO L485 AbstractCegarLoop]: Abstraction has has 204 places, 340 transitions, 5383 flow [2025-04-13 20:21:49,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.173913043478262) internal successors, (234), 23 states have internal predecessors, (234), 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-04-13 20:21:49,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:49,052 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:49,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:21:49,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:49,252 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:21:49,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash -328419291, now seen corresponding path program 3 times [2025-04-13 20:21:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:49,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525500759] [2025-04-13 20:21:49,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:21:49,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:49,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:21:49,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:21:49,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:21:49,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:21:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:49,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525500759] [2025-04-13 20:21:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525500759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:49,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:49,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:21:49,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207259574] [2025-04-13 20:21:49,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:49,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:21:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:49,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:21:49,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:21:49,378 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:21:49,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 340 transitions, 5383 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:21:49,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:49,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:21:49,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:02,493 INFO L116 PetriNetUnfolderBase]: 88440/119310 cut-off events. [2025-04-13 20:22:02,493 INFO L117 PetriNetUnfolderBase]: For 859912/859916 co-relation queries the response was YES. [2025-04-13 20:22:03,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504736 conditions, 119310 events. 88440/119310 cut-off events. For 859912/859916 co-relation queries the response was YES. Maximal size of possible extension queue 4791. Compared 795454 event pairs, 41968 based on Foata normal form. 3/101256 useless extension candidates. Maximal degree in co-relation 504644. Up to 108752 conditions per place. [2025-04-13 20:22:04,051 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 373 selfloop transitions, 59 changer transitions 2/437 dead transitions. [2025-04-13 20:22:04,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 437 transitions, 6762 flow [2025-04-13 20:22:04,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:22:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:22:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2025-04-13 20:22:04,052 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4699074074074074 [2025-04-13 20:22:04,052 INFO L175 Difference]: Start difference. First operand has 204 places, 340 transitions, 5383 flow. Second operand 8 states and 203 transitions. [2025-04-13 20:22:04,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 437 transitions, 6762 flow [2025-04-13 20:22:18,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 437 transitions, 5725 flow, removed 502 selfloop flow, removed 10 redundant places. [2025-04-13 20:22:18,523 INFO L231 Difference]: Finished difference. Result has 203 places, 347 transitions, 4699 flow [2025-04-13 20:22:18,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4376, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4699, PETRI_PLACES=203, PETRI_TRANSITIONS=347} [2025-04-13 20:22:18,524 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 152 predicate places. [2025-04-13 20:22:18,524 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 347 transitions, 4699 flow [2025-04-13 20:22:18,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:22:18,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:18,524 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:18,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 20:22:18,524 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:22:18,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:18,525 INFO L85 PathProgramCache]: Analyzing trace with hash 373050843, now seen corresponding path program 4 times [2025-04-13 20:22:18,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:18,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826711310] [2025-04-13 20:22:18,525 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:22:18,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:18,531 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:22:18,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:22:18,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:22:18,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:22:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:18,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826711310] [2025-04-13 20:22:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826711310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:18,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306655354] [2025-04-13 20:22:18,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:22:18,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:22:18,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:18,665 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-04-13 20:22:18,666 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-04-13 20:22:18,723 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:22:18,744 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:22:18,744 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:22:18,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:18,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:22:18,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:22:18,837 INFO L354 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 19 treesize of output 7 [2025-04-13 20:22:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:22:18,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:22:18,921 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:22:18,921 INFO L354 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 25 treesize of output 16 [2025-04-13 20:22:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:22:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306655354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:22:18,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:22:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 20:22:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571216635] [2025-04-13 20:22:18,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:22:18,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:22:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:18,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:22:18,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:22:18,939 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:22:18,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 347 transitions, 4699 flow. Second operand has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 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-04-13 20:22:18,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:18,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:22:18,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:32,343 INFO L116 PetriNetUnfolderBase]: 90563/122163 cut-off events. [2025-04-13 20:22:32,343 INFO L117 PetriNetUnfolderBase]: For 701506/701510 co-relation queries the response was YES. [2025-04-13 20:22:33,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486851 conditions, 122163 events. 90563/122163 cut-off events. For 701506/701510 co-relation queries the response was YES. Maximal size of possible extension queue 4863. Compared 814161 event pairs, 40761 based on Foata normal form. 3/103881 useless extension candidates. Maximal degree in co-relation 486763. Up to 109147 conditions per place. [2025-04-13 20:22:33,761 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 400 selfloop transitions, 93 changer transitions 2/498 dead transitions. [2025-04-13 20:22:33,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 498 transitions, 6534 flow [2025-04-13 20:22:33,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:22:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:22:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-04-13 20:22:33,762 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4703703703703704 [2025-04-13 20:22:33,762 INFO L175 Difference]: Start difference. First operand has 203 places, 347 transitions, 4699 flow. Second operand 10 states and 254 transitions. [2025-04-13 20:22:33,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 498 transitions, 6534 flow [2025-04-13 20:22:40,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 498 transitions, 6440 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-04-13 20:22:40,399 INFO L231 Difference]: Finished difference. Result has 210 places, 370 transitions, 5278 flow [2025-04-13 20:22:40,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4605, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5278, PETRI_PLACES=210, PETRI_TRANSITIONS=370} [2025-04-13 20:22:40,400 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 159 predicate places. [2025-04-13 20:22:40,400 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 370 transitions, 5278 flow [2025-04-13 20:22:40,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 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-04-13 20:22:40,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:40,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:40,407 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-04-13 20:22:40,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 20:22:40,602 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:22:40,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1677123073, now seen corresponding path program 5 times [2025-04-13 20:22:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:40,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271737112] [2025-04-13 20:22:40,602 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:22:40,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:40,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:22:40,624 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:22:40,624 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:22:40,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:22:41,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:41,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271737112] [2025-04-13 20:22:41,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271737112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:41,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497169093] [2025-04-13 20:22:41,032 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:22:41,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:22:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:41,034 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-04-13 20:22:41,036 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-04-13 20:22:41,096 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:22:41,117 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:22:41,117 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:22:41,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:41,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:22:41,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:22:41,199 INFO L354 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-04-13 20:22:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:22:41,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:22:41,303 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:22:41,303 INFO L354 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 25 treesize of output 16 [2025-04-13 20:22:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:22:41,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497169093] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:41,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:22:41,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 16 [2025-04-13 20:22:41,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781039276] [2025-04-13 20:22:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:41,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:22:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:41,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:22:41,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:22:41,377 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:22:41,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 370 transitions, 5278 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:22:41,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:41,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:22:41,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:55,520 INFO L116 PetriNetUnfolderBase]: 93887/126636 cut-off events. [2025-04-13 20:22:55,520 INFO L117 PetriNetUnfolderBase]: For 794591/794595 co-relation queries the response was YES. [2025-04-13 20:22:56,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514914 conditions, 126636 events. 93887/126636 cut-off events. For 794591/794595 co-relation queries the response was YES. Maximal size of possible extension queue 5118. Compared 850673 event pairs, 44384 based on Foata normal form. 3/107725 useless extension candidates. Maximal degree in co-relation 514823. Up to 116014 conditions per place. [2025-04-13 20:22:57,013 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 413 selfloop transitions, 63 changer transitions 3/482 dead transitions. [2025-04-13 20:22:57,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 482 transitions, 6814 flow [2025-04-13 20:22:57,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:22:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:22:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2025-04-13 20:22:57,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4609053497942387 [2025-04-13 20:22:57,017 INFO L175 Difference]: Start difference. First operand has 210 places, 370 transitions, 5278 flow. Second operand 9 states and 224 transitions. [2025-04-13 20:22:57,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 482 transitions, 6814 flow [2025-04-13 20:23:03,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 482 transitions, 6717 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-04-13 20:23:03,719 INFO L231 Difference]: Finished difference. Result has 213 places, 380 transitions, 5567 flow [2025-04-13 20:23:03,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5181, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5567, PETRI_PLACES=213, PETRI_TRANSITIONS=380} [2025-04-13 20:23:03,720 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 162 predicate places. [2025-04-13 20:23:03,720 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 380 transitions, 5567 flow [2025-04-13 20:23:03,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:23:03,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:03,720 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:03,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:23:03,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 20:23:03,921 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:23:03,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:03,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2112658766, now seen corresponding path program 1 times [2025-04-13 20:23:03,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:03,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226277516] [2025-04-13 20:23:03,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:03,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:23:03,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:23:03,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:03,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:04,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:04,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226277516] [2025-04-13 20:23:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226277516] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:04,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608123706] [2025-04-13 20:23:04,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:04,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:04,186 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-04-13 20:23:04,188 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-04-13 20:23:04,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:23:04,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:23:04,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:04,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:04,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:23:04,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:04,363 INFO L354 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 19 treesize of output 7 [2025-04-13 20:23:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:04,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:23:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608123706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:04,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:23:04,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-13 20:23:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727912685] [2025-04-13 20:23:04,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:04,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:23:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:04,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:23:04,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:23:04,377 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:23:04,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 380 transitions, 5567 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:23:04,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:04,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:23:04,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:21,178 INFO L116 PetriNetUnfolderBase]: 111699/150733 cut-off events. [2025-04-13 20:23:21,178 INFO L117 PetriNetUnfolderBase]: For 1170281/1170285 co-relation queries the response was YES. [2025-04-13 20:23:22,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634887 conditions, 150733 events. 111699/150733 cut-off events. For 1170281/1170285 co-relation queries the response was YES. Maximal size of possible extension queue 5898. Compared 1030082 event pairs, 36548 based on Foata normal form. 3/128340 useless extension candidates. Maximal degree in co-relation 634794. Up to 85636 conditions per place. [2025-04-13 20:23:23,016 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 473 selfloop transitions, 126 changer transitions 5/607 dead transitions. [2025-04-13 20:23:23,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 607 transitions, 8399 flow [2025-04-13 20:23:23,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:23:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:23:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 314 transitions. [2025-04-13 20:23:23,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5286195286195287 [2025-04-13 20:23:23,017 INFO L175 Difference]: Start difference. First operand has 213 places, 380 transitions, 5567 flow. Second operand 11 states and 314 transitions. [2025-04-13 20:23:23,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 607 transitions, 8399 flow [2025-04-13 20:23:35,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 607 transitions, 8293 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-04-13 20:23:35,783 INFO L231 Difference]: Finished difference. Result has 224 places, 410 transitions, 6491 flow [2025-04-13 20:23:35,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5461, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6491, PETRI_PLACES=224, PETRI_TRANSITIONS=410} [2025-04-13 20:23:35,784 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 173 predicate places. [2025-04-13 20:23:35,784 INFO L485 AbstractCegarLoop]: Abstraction has has 224 places, 410 transitions, 6491 flow [2025-04-13 20:23:35,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:23:35,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:35,784 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:35,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 20:23:35,988 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:23:35,988 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:23:35,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1019208597, now seen corresponding path program 6 times [2025-04-13 20:23:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:35,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206956723] [2025-04-13 20:23:35,989 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:23:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:35,996 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:23:36,002 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:23:36,002 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:23:36,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:36,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:36,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206956723] [2025-04-13 20:23:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206956723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:23:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490492126] [2025-04-13 20:23:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:36,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:23:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:36,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:23:36,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:23:36,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:23:36,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 410 transitions, 6491 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:36,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:36,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:23:36,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:57,315 INFO L116 PetriNetUnfolderBase]: 123149/166212 cut-off events. [2025-04-13 20:23:57,315 INFO L117 PetriNetUnfolderBase]: For 1468272/1468276 co-relation queries the response was YES. [2025-04-13 20:23:59,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717207 conditions, 166212 events. 123149/166212 cut-off events. For 1468272/1468276 co-relation queries the response was YES. Maximal size of possible extension queue 6549. Compared 1147274 event pairs, 47879 based on Foata normal form. 3/141263 useless extension candidates. Maximal degree in co-relation 717107. Up to 119877 conditions per place. [2025-04-13 20:23:59,540 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 545 selfloop transitions, 111 changer transitions 5/664 dead transitions. [2025-04-13 20:23:59,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 664 transitions, 9622 flow [2025-04-13 20:23:59,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:23:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:23:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 355 transitions. [2025-04-13 20:23:59,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5056980056980057 [2025-04-13 20:23:59,542 INFO L175 Difference]: Start difference. First operand has 224 places, 410 transitions, 6491 flow. Second operand 13 states and 355 transitions. [2025-04-13 20:23:59,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 664 transitions, 9622 flow [2025-04-13 20:24:16,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 664 transitions, 9296 flow, removed 144 selfloop flow, removed 3 redundant places. [2025-04-13 20:24:16,675 INFO L231 Difference]: Finished difference. Result has 240 places, 442 transitions, 7157 flow [2025-04-13 20:24:16,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=6165, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7157, PETRI_PLACES=240, PETRI_TRANSITIONS=442} [2025-04-13 20:24:16,676 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 189 predicate places. [2025-04-13 20:24:16,676 INFO L485 AbstractCegarLoop]: Abstraction has has 240 places, 442 transitions, 7157 flow [2025-04-13 20:24:16,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:24:16,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:16,676 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:16,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 20:24:16,676 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:24:16,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash 424664542, now seen corresponding path program 2 times [2025-04-13 20:24:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:16,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388802386] [2025-04-13 20:24:16,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:24:16,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:16,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:24:16,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:24:16,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:24:16,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:24:16,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:16,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388802386] [2025-04-13 20:24:16,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388802386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:24:16,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:24:16,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:24:16,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138403412] [2025-04-13 20:24:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:24:16,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:24:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:16,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:24:16,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:24:16,831 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:24:16,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 442 transitions, 7157 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:24:16,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:16,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:24:16,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:38,212 INFO L116 PetriNetUnfolderBase]: 126687/171008 cut-off events. [2025-04-13 20:24:38,213 INFO L117 PetriNetUnfolderBase]: For 1508754/1508758 co-relation queries the response was YES. [2025-04-13 20:24:39,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744466 conditions, 171008 events. 126687/171008 cut-off events. For 1508754/1508758 co-relation queries the response was YES. Maximal size of possible extension queue 6760. Compared 1190018 event pairs, 55787 based on Foata normal form. 3/145408 useless extension candidates. Maximal degree in co-relation 744358. Up to 148974 conditions per place. [2025-04-13 20:24:40,472 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 532 selfloop transitions, 103 changer transitions 4/642 dead transitions. [2025-04-13 20:24:40,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 642 transitions, 9455 flow [2025-04-13 20:24:40,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:24:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:24:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 332 transitions. [2025-04-13 20:24:40,473 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47293447293447294 [2025-04-13 20:24:40,473 INFO L175 Difference]: Start difference. First operand has 240 places, 442 transitions, 7157 flow. Second operand 13 states and 332 transitions. [2025-04-13 20:24:40,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 642 transitions, 9455 flow [2025-04-13 20:24:57,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 642 transitions, 9179 flow, removed 128 selfloop flow, removed 2 redundant places. [2025-04-13 20:24:57,318 INFO L231 Difference]: Finished difference. Result has 255 places, 458 transitions, 7534 flow [2025-04-13 20:24:57,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=6881, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7534, PETRI_PLACES=255, PETRI_TRANSITIONS=458} [2025-04-13 20:24:57,319 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 204 predicate places. [2025-04-13 20:24:57,319 INFO L485 AbstractCegarLoop]: Abstraction has has 255 places, 458 transitions, 7534 flow [2025-04-13 20:24:57,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:24:57,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:57,320 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:57,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 20:24:57,320 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:24:57,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1275104583, now seen corresponding path program 7 times [2025-04-13 20:24:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:57,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356572846] [2025-04-13 20:24:57,320 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:24:57,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:57,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:24:57,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:24:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:24:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:57,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356572846] [2025-04-13 20:24:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356572846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:57,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006998194] [2025-04-13 20:24:57,589 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:24:57,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:57,591 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-04-13 20:24:57,592 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-04-13 20:24:57,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:24:57,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:24:57,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:24:57,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:57,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:24:57,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:57,781 INFO L354 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 19 treesize of output 7 [2025-04-13 20:24:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:24:57,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:24:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006998194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:24:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:24:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-13 20:24:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125268043] [2025-04-13 20:24:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:24:57,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:24:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:57,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:24:57,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:24:57,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:24:57,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 458 transitions, 7534 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:24:57,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:57,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:24:57,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:22,003 INFO L116 PetriNetUnfolderBase]: 130539/176182 cut-off events. [2025-04-13 20:25:22,003 INFO L117 PetriNetUnfolderBase]: For 1714739/1714743 co-relation queries the response was YES. [2025-04-13 20:25:24,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787434 conditions, 176182 events. 130539/176182 cut-off events. For 1714739/1714743 co-relation queries the response was YES. Maximal size of possible extension queue 7034. Compared 1225826 event pairs, 61636 based on Foata normal form. 3/149865 useless extension candidates. Maximal degree in co-relation 787320. Up to 159660 conditions per place. [2025-04-13 20:25:24,634 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 500 selfloop transitions, 113 changer transitions 5/621 dead transitions. [2025-04-13 20:25:24,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 621 transitions, 9945 flow [2025-04-13 20:25:24,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:25:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:25:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 269 transitions. [2025-04-13 20:25:24,635 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4981481481481482 [2025-04-13 20:25:24,635 INFO L175 Difference]: Start difference. First operand has 255 places, 458 transitions, 7534 flow. Second operand 10 states and 269 transitions. [2025-04-13 20:25:24,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 621 transitions, 9945 flow [2025-04-13 20:25:42,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 621 transitions, 9718 flow, removed 66 selfloop flow, removed 5 redundant places. [2025-04-13 20:25:42,906 INFO L231 Difference]: Finished difference. Result has 261 places, 474 transitions, 7985 flow [2025-04-13 20:25:42,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7309, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7985, PETRI_PLACES=261, PETRI_TRANSITIONS=474} [2025-04-13 20:25:42,907 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 210 predicate places. [2025-04-13 20:25:42,907 INFO L485 AbstractCegarLoop]: Abstraction has has 261 places, 474 transitions, 7985 flow [2025-04-13 20:25:42,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:25:42,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:42,908 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:42,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:25:43,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 20:25:43,108 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:25:43,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash -504018080, now seen corresponding path program 3 times [2025-04-13 20:25:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:43,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194876128] [2025-04-13 20:25:43,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:25:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:43,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:25:43,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:25:43,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:25:43,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:25:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:43,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194876128] [2025-04-13 20:25:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194876128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:43,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:43,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:25:43,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695645552] [2025-04-13 20:25:43,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:43,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:25:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:43,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:25:43,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:25:43,231 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:25:43,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 474 transitions, 7985 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:25:43,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:43,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:25:43,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:08,817 INFO L116 PetriNetUnfolderBase]: 134226/181173 cut-off events. [2025-04-13 20:26:08,818 INFO L117 PetriNetUnfolderBase]: For 1855999/1856003 co-relation queries the response was YES. [2025-04-13 20:26:11,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815006 conditions, 181173 events. 134226/181173 cut-off events. For 1855999/1856003 co-relation queries the response was YES. Maximal size of possible extension queue 7293. Compared 1268738 event pairs, 62825 based on Foata normal form. 3/154195 useless extension candidates. Maximal degree in co-relation 814891. Up to 166211 conditions per place. [2025-04-13 20:26:11,704 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 524 selfloop transitions, 86 changer transitions 4/617 dead transitions. [2025-04-13 20:26:11,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 617 transitions, 10046 flow [2025-04-13 20:26:11,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:26:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:26:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2025-04-13 20:26:11,705 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4511784511784512 [2025-04-13 20:26:11,706 INFO L175 Difference]: Start difference. First operand has 261 places, 474 transitions, 7985 flow. Second operand 11 states and 268 transitions. [2025-04-13 20:26:11,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 617 transitions, 10046 flow [2025-04-13 20:26:36,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 617 transitions, 9566 flow, removed 104 selfloop flow, removed 7 redundant places. [2025-04-13 20:26:36,202 INFO L231 Difference]: Finished difference. Result has 266 places, 483 transitions, 7966 flow [2025-04-13 20:26:36,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7513, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7966, PETRI_PLACES=266, PETRI_TRANSITIONS=483} [2025-04-13 20:26:36,203 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 215 predicate places. [2025-04-13 20:26:36,203 INFO L485 AbstractCegarLoop]: Abstraction has has 266 places, 483 transitions, 7966 flow [2025-04-13 20:26:36,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:26:36,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:26:36,203 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:26:36,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:26:36,203 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:26:36,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:26:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 864214277, now seen corresponding path program 8 times [2025-04-13 20:26:36,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:26:36,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028818379] [2025-04-13 20:26:36,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:26:36,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:26:36,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:26:36,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:26:36,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:26:36,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:26:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:26:36,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028818379] [2025-04-13 20:26:36,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028818379] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:26:36,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:26:36,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:26:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852765156] [2025-04-13 20:26:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:26:36,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:26:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:36,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:26:36,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:26:36,345 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:26:36,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 483 transitions, 7966 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:26:36,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:36,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:26:36,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:03,043 INFO L116 PetriNetUnfolderBase]: 138176/186477 cut-off events. [2025-04-13 20:27:03,043 INFO L117 PetriNetUnfolderBase]: For 1960527/1960531 co-relation queries the response was YES. [2025-04-13 20:27:05,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844343 conditions, 186477 events. 138176/186477 cut-off events. For 1960527/1960531 co-relation queries the response was YES. Maximal size of possible extension queue 7610. Compared 1308209 event pairs, 64561 based on Foata normal form. 3/158794 useless extension candidates. Maximal degree in co-relation 844228. Up to 168973 conditions per place. [2025-04-13 20:27:05,785 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 553 selfloop transitions, 96 changer transitions 3/655 dead transitions. [2025-04-13 20:27:05,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 655 transitions, 10252 flow [2025-04-13 20:27:05,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:27:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:27:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 298 transitions. [2025-04-13 20:27:05,787 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45987654320987653 [2025-04-13 20:27:05,787 INFO L175 Difference]: Start difference. First operand has 266 places, 483 transitions, 7966 flow. Second operand 12 states and 298 transitions. [2025-04-13 20:27:05,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 655 transitions, 10252 flow [2025-04-13 20:27:25,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 655 transitions, 10102 flow, removed 39 selfloop flow, removed 7 redundant places. [2025-04-13 20:27:25,769 INFO L231 Difference]: Finished difference. Result has 273 places, 496 transitions, 8418 flow [2025-04-13 20:27:25,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7816, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8418, PETRI_PLACES=273, PETRI_TRANSITIONS=496} [2025-04-13 20:27:25,770 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 222 predicate places. [2025-04-13 20:27:25,770 INFO L485 AbstractCegarLoop]: Abstraction has has 273 places, 496 transitions, 8418 flow [2025-04-13 20:27:25,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:25,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:25,770 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:25,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 20:27:25,770 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:27:25,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:25,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1258084420, now seen corresponding path program 4 times [2025-04-13 20:27:25,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:25,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608533453] [2025-04-13 20:27:25,771 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:25,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:27:25,781 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:27:25,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:25,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:25,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608533453] [2025-04-13 20:27:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608533453] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:25,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597792921] [2025-04-13 20:27:25,879 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:25,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:25,881 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-04-13 20:27:25,883 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-04-13 20:27:25,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:27:25,955 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:27:25,955 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:25,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:25,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:27:25,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:26,019 INFO L354 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 19 treesize of output 7 [2025-04-13 20:27:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:26,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:26,116 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:27:26,116 INFO L354 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 20 treesize of output 14 [2025-04-13 20:27:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:26,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597792921] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:26,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 20:27:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524355732] [2025-04-13 20:27:26,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:26,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:27:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:26,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:27:26,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:27:26,141 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:27:26,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 496 transitions, 8418 flow. Second operand has 15 states, 15 states have (on average 10.6) internal successors, (159), 15 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:26,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:26,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:27:26,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:53,557 INFO L116 PetriNetUnfolderBase]: 141548/191040 cut-off events. [2025-04-13 20:27:53,557 INFO L117 PetriNetUnfolderBase]: For 2127648/2127652 co-relation queries the response was YES. [2025-04-13 20:27:55,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882051 conditions, 191040 events. 141548/191040 cut-off events. For 2127648/2127652 co-relation queries the response was YES. Maximal size of possible extension queue 7846. Compared 1346217 event pairs, 66549 based on Foata normal form. 3/162752 useless extension candidates. Maximal degree in co-relation 881932. Up to 175718 conditions per place. [2025-04-13 20:27:56,382 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 534 selfloop transitions, 130 changer transitions 6/673 dead transitions. [2025-04-13 20:27:56,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 673 transitions, 10910 flow [2025-04-13 20:27:56,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:27:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:27:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 327 transitions. [2025-04-13 20:27:56,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2025-04-13 20:27:56,384 INFO L175 Difference]: Start difference. First operand has 273 places, 496 transitions, 8418 flow. Second operand 15 states and 327 transitions. [2025-04-13 20:27:56,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 673 transitions, 10910 flow [2025-04-13 20:28:21,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 673 transitions, 10681 flow, removed 42 selfloop flow, removed 8 redundant places. [2025-04-13 20:28:21,776 INFO L231 Difference]: Finished difference. Result has 283 places, 516 transitions, 8938 flow [2025-04-13 20:28:21,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=8189, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8938, PETRI_PLACES=283, PETRI_TRANSITIONS=516} [2025-04-13 20:28:21,777 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 232 predicate places. [2025-04-13 20:28:21,777 INFO L485 AbstractCegarLoop]: Abstraction has has 283 places, 516 transitions, 8938 flow [2025-04-13 20:28:21,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.6) internal successors, (159), 15 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:21,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:21,777 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:21,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 20:28:21,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:21,978 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:28:21,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1819967911, now seen corresponding path program 9 times [2025-04-13 20:28:21,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:21,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724865532] [2025-04-13 20:28:21,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:28:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:21,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:28:21,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 20:28:21,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:28:21,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:28:22,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:22,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724865532] [2025-04-13 20:28:22,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724865532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:28:22,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:28:22,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:28:22,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165627898] [2025-04-13 20:28:22,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:28:22,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:28:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:22,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:28:22,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:28:22,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:28:22,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 516 transitions, 8938 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:22,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:22,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:28:22,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:49,916 INFO L116 PetriNetUnfolderBase]: 144477/194978 cut-off events. [2025-04-13 20:28:49,917 INFO L117 PetriNetUnfolderBase]: For 2289328/2289332 co-relation queries the response was YES. [2025-04-13 20:28:52,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906439 conditions, 194978 events. 144477/194978 cut-off events. For 2289328/2289332 co-relation queries the response was YES. Maximal size of possible extension queue 8083. Compared 1374858 event pairs, 70135 based on Foata normal form. 3/166135 useless extension candidates. Maximal degree in co-relation 906316. Up to 181361 conditions per place. [2025-04-13 20:28:53,024 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 566 selfloop transitions, 92 changer transitions 4/665 dead transitions. [2025-04-13 20:28:53,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 665 transitions, 11207 flow [2025-04-13 20:28:53,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:28:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:28:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2025-04-13 20:28:53,025 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4367283950617284 [2025-04-13 20:28:53,025 INFO L175 Difference]: Start difference. First operand has 283 places, 516 transitions, 8938 flow. Second operand 12 states and 283 transitions. [2025-04-13 20:28:53,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 665 transitions, 11207 flow [2025-04-13 20:29:17,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 665 transitions, 10764 flow, removed 99 selfloop flow, removed 9 redundant places. [2025-04-13 20:29:17,053 INFO L231 Difference]: Finished difference. Result has 288 places, 528 transitions, 9113 flow [2025-04-13 20:29:17,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=8495, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9113, PETRI_PLACES=288, PETRI_TRANSITIONS=528} [2025-04-13 20:29:17,054 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 237 predicate places. [2025-04-13 20:29:17,054 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 528 transitions, 9113 flow [2025-04-13 20:29:17,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:29:17,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:17,054 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:17,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 20:29:17,054 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 20:29:17,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1441141904, now seen corresponding path program 5 times [2025-04-13 20:29:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:17,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337760977] [2025-04-13 20:29:17,055 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:29:17,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:17,061 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:29:17,066 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:29:17,066 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:29:17,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:17,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337760977] [2025-04-13 20:29:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337760977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:17,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539244453] [2025-04-13 20:29:17,294 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:29:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:17,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:17,297 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:29:17,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:29:17,354 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 20:29:17,371 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:29:17,371 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:29:17,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:17,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 20:29:17,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:17,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:29:17,465 INFO L354 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-04-13 20:29:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:17,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:17,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539244453] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:17,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:29:17,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 16 [2025-04-13 20:29:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009670162] [2025-04-13 20:29:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:29:17,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:29:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:17,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:29:17,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:29:17,567 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-13 20:29:17,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 528 transitions, 9113 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-04-13 20:29:17,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:17,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-13 20:29:17,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 20:29:31,774 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:29:31,800 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:29:32,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 20:29:32,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2025-04-13 20:29:33,121 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 20:29:33,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 20:29:33,122 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 20:29:33,126 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-13 20:29:33,127 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 20:29:33,127 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 20:29:33,127 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 20:29:33,127 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 20:29:33,127 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2025-04-13 20:29:33,127 INFO L422 BasicCegarLoop]: Path program histogram: [9, 5, 5, 4, 3, 2, 2, 2, 1, 1] [2025-04-13 20:29:33,130 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:29:33,130 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:29:33,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:29:33 BasicIcfg [2025-04-13 20:29:33,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:29:33,135 INFO L158 Benchmark]: Toolchain (without parser) took 690988.24ms. Allocated memory was 155.2MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 109.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 7.0GB. Max. memory is 8.0GB. [2025-04-13 20:29:33,135 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:29:33,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.29ms. Allocated memory is still 155.2MB. Free memory was 108.8MB in the beginning and 93.6MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:29:33,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.46ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 91.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:29:33,135 INFO L158 Benchmark]: Boogie Preprocessor took 47.81ms. Allocated memory is still 155.2MB. Free memory was 91.1MB in the beginning and 88.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:29:33,136 INFO L158 Benchmark]: RCFGBuilder took 639.63ms. Allocated memory is still 155.2MB. Free memory was 88.2MB in the beginning and 77.6MB in the end (delta: 10.6MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2025-04-13 20:29:33,136 INFO L158 Benchmark]: TraceAbstraction took 689996.26ms. Allocated memory was 155.2MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 76.8MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 7.0GB. Max. memory is 8.0GB. [2025-04-13 20:29:33,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.29ms. Allocated memory is still 155.2MB. Free memory was 108.8MB in the beginning and 93.6MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.46ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 91.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 47.81ms. Allocated memory is still 155.2MB. Free memory was 91.1MB in the beginning and 88.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 639.63ms. Allocated memory is still 155.2MB. Free memory was 88.2MB in the beginning and 77.6MB in the end (delta: 10.6MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. * TraceAbstraction took 689996.26ms. Allocated memory was 155.2MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 76.8MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 7.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 97 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 689.9s, OverallIterations: 34, TraceHistogramMax: 2, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 676.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 4205 SdHoareTripleChecker+Valid, 136.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4205 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 134.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23324 IncrementalHoareTripleChecker+Invalid, 23464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 0 mSDtfsCounter, 23324 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1301 GetRequests, 897 SyntacticMatches, 4 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9113occurred in iteration=33, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1863 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2224 ConstructedInterpolants, 8 QuantifiedInterpolants, 13155 SizeOfPredicates, 128 NumberOfNonLiveVariables, 3912 ConjunctsInSsa, 347 ConjunctsInUnsatCore, 59 InterpolantComputations, 28 PerfectInterpolantSequences, 110/172 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown