/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-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:17:27,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:17:27,750 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:27,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:17:27,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:17:27,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:17:27,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:17:27,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:17:27,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:17:27,781 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:17:27,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:17:27,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:17:27,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:17:27,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:17:27,781 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:17:27,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:17:27,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:17:27,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:17:27,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:17:27,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:17:27,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:17:27,785 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:28,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:17:28,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:17:28,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:17:28,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:17:28,011 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:17:28,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-04-13 20:17:29,300 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff039168/692463250cb043329df0ec1eb72886ef/FLAG9ceb2924f [2025-04-13 20:17:29,489 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:17:29,489 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-04-13 20:17:29,497 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff039168/692463250cb043329df0ec1eb72886ef/FLAG9ceb2924f [2025-04-13 20:17:30,302 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff039168/692463250cb043329df0ec1eb72886ef [2025-04-13 20:17:30,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:17:30,305 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:17:30,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:17:30,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:17:30,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:17:30,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2dc3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30, skipping insertion in model container [2025-04-13 20:17:30,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:17:30,489 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-1.wvr.c[3694,3707] [2025-04-13 20:17:30,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:17:30,521 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:17:30,562 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-1.wvr.c[3694,3707] [2025-04-13 20:17:30,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:17:30,582 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:17:30,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30 WrapperNode [2025-04-13 20:17:30,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:17:30,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:17:30,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:17:30,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:17:30,587 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:17:30" (1/1) ... [2025-04-13 20:17:30,601 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:17:30" (1/1) ... [2025-04-13 20:17:30,628 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 288 [2025-04-13 20:17:30,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:17:30,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:17:30,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:17:30,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:17:30,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,661 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:17:30,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:17:30,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:17:30,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:17:30,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:17:30,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (1/1) ... [2025-04-13 20:17:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:17:30,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:17:30,706 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:17:30,707 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:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:17:30,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:17:30,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:17:30,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:17:30,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:17:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:17:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:17:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:17:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:17:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:17:30,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:17:30,724 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:17:30,805 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:17:30,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:17:31,089 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:17:31,089 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:17:31,090 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:17:31,398 INFO L313 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-13 20:17:31,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:17:31 BoogieIcfgContainer [2025-04-13 20:17:31,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:17:31,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:17:31,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:17:31,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:17:31,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:17:30" (1/3) ... [2025-04-13 20:17:31,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31969364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:17:31, skipping insertion in model container [2025-04-13 20:17:31,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:17:30" (2/3) ... [2025-04-13 20:17:31,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31969364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:17:31, skipping insertion in model container [2025-04-13 20:17:31,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:17:31" (3/3) ... [2025-04-13 20:17:31,406 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-04-13 20:17:31,416 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:17:31,418 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 37 locations, 37 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 20:17:31,418 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:17:31,472 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:17:31,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 110 flow [2025-04-13 20:17:31,525 INFO L116 PetriNetUnfolderBase]: 5/37 cut-off events. [2025-04-13 20:17:31,526 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:17:31,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 37 events. 5/37 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-13 20:17:31,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 41 transitions, 110 flow [2025-04-13 20:17:31,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 36 transitions, 96 flow [2025-04-13 20:17:31,538 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:17:31,549 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;@4201525c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:17:31,549 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:17:31,563 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:17:31,564 INFO L116 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-04-13 20:17:31,564 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:17:31,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:31,564 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] [2025-04-13 20:17:31,564 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:31,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1788431185, now seen corresponding path program 1 times [2025-04-13 20:17:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:31,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093270485] [2025-04-13 20:17:31,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:31,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:17:31,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:17:31,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:31,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:31,886 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:17:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:31,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093270485] [2025-04-13 20:17:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093270485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:31,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:31,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:17:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383764907] [2025-04-13 20:17:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:31,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:17:31,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:31,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:17:31,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:17:31,915 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:31,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:17:31,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:31,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:31,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:32,878 INFO L116 PetriNetUnfolderBase]: 9362/11902 cut-off events. [2025-04-13 20:17:32,878 INFO L117 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2025-04-13 20:17:32,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24461 conditions, 11902 events. 9362/11902 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 56154 event pairs, 1833 based on Foata normal form. 1/8703 useless extension candidates. Maximal degree in co-relation 22232. Up to 9279 conditions per place. [2025-04-13 20:17:32,956 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 53 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2025-04-13 20:17:32,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 289 flow [2025-04-13 20:17:32,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:17:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:17:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-04-13 20:17:32,968 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-04-13 20:17:32,969 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 96 flow. Second operand 3 states and 84 transitions. [2025-04-13 20:17:32,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 289 flow [2025-04-13 20:17:32,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 259 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:17:32,994 INFO L231 Difference]: Finished difference. Result has 39 places, 40 transitions, 113 flow [2025-04-13 20:17:32,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=39, PETRI_TRANSITIONS=40} [2025-04-13 20:17:32,999 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-04-13 20:17:32,999 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 40 transitions, 113 flow [2025-04-13 20:17:32,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:17:32,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:32,999 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] [2025-04-13 20:17:33,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:17:33,001 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:33,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash -592012087, now seen corresponding path program 1 times [2025-04-13 20:17:33,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:33,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124673586] [2025-04-13 20:17:33,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:33,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:17:33,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:17:33,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:33,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:33,253 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:17:33,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:33,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124673586] [2025-04-13 20:17:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124673586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:33,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:33,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:17:33,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547089078] [2025-04-13 20:17:33,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:33,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:17:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:33,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:17:33,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:17:33,255 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:33,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 40 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:17:33,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:33,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:33,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:34,067 INFO L116 PetriNetUnfolderBase]: 11942/15583 cut-off events. [2025-04-13 20:17:34,068 INFO L117 PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES. [2025-04-13 20:17:34,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34530 conditions, 15583 events. 11942/15583 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 81473 event pairs, 8090 based on Foata normal form. 631/11943 useless extension candidates. Maximal degree in co-relation 5267. Up to 11347 conditions per place. [2025-04-13 20:17:34,118 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 35 selfloop transitions, 2 changer transitions 27/68 dead transitions. [2025-04-13 20:17:34,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 318 flow [2025-04-13 20:17:34,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:17:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:17:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-13 20:17:34,120 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5670731707317073 [2025-04-13 20:17:34,120 INFO L175 Difference]: Start difference. First operand has 39 places, 40 transitions, 113 flow. Second operand 4 states and 93 transitions. [2025-04-13 20:17:34,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 318 flow [2025-04-13 20:17:34,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 68 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:17:34,125 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 126 flow [2025-04-13 20:17:34,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-04-13 20:17:34,126 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-04-13 20:17:34,126 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 126 flow [2025-04-13 20:17:34,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:17:34,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:34,126 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] [2025-04-13 20:17:34,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:17:34,126 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:34,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:34,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1572085008, now seen corresponding path program 1 times [2025-04-13 20:17:34,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:34,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437763676] [2025-04-13 20:17:34,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:34,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:17:34,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:17:34,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:34,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:34,333 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:17:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:34,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437763676] [2025-04-13 20:17:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437763676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:17:34,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031660282] [2025-04-13 20:17:34,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:17:34,336 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:17:34,338 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:17:34,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:17:34,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:17:34,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:34,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:34,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:17:34,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:17:34,536 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:17:34,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:17:34,589 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:17:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031660282] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:17:34,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:17:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 20:17:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063831670] [2025-04-13 20:17:34,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:17:34,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:17:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:34,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:17:34,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:17:34,591 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:34,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 126 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:34,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:34,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:34,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:35,540 INFO L116 PetriNetUnfolderBase]: 11942/15585 cut-off events. [2025-04-13 20:17:35,541 INFO L117 PetriNetUnfolderBase]: For 2888/2888 co-relation queries the response was YES. [2025-04-13 20:17:35,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34632 conditions, 15585 events. 11942/15585 cut-off events. For 2888/2888 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 80738 event pairs, 8090 based on Foata normal form. 630/11944 useless extension candidates. Maximal degree in co-relation 34619. Up to 11346 conditions per place. [2025-04-13 20:17:35,591 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 59 selfloop transitions, 5 changer transitions 2/70 dead transitions. [2025-04-13 20:17:35,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 342 flow [2025-04-13 20:17:35,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:17:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:17:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-04-13 20:17:35,594 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2025-04-13 20:17:35,594 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 126 flow. Second operand 6 states and 110 transitions. [2025-04-13 20:17:35,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 342 flow [2025-04-13 20:17:35,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 334 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:17:35,599 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 161 flow [2025-04-13 20:17:35,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2025-04-13 20:17:35,599 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-04-13 20:17:35,599 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 161 flow [2025-04-13 20:17:35,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:35,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:35,600 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] [2025-04-13 20:17:35,609 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:17:35,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:35,802 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:35,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:35,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1907810716, now seen corresponding path program 1 times [2025-04-13 20:17:35,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:35,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813635468] [2025-04-13 20:17:35,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:35,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:35,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:17:35,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:17:35,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:35,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:35,947 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:17:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:35,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813635468] [2025-04-13 20:17:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813635468] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:17:35,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387805986] [2025-04-13 20:17:35,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:35,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:35,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:17:35,949 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:17:35,951 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:17:36,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:17:36,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:17:36,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:36,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:36,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:17:36,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:17:36,121 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:17:36,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:17:36,162 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:17:36,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387805986] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:17:36,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:17:36,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 20:17:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824648309] [2025-04-13 20:17:36,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:17:36,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:17:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:36,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:17:36,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:17:36,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:36,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 161 flow. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:36,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:36,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:36,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:36,715 INFO L116 PetriNetUnfolderBase]: 9507/12370 cut-off events. [2025-04-13 20:17:36,715 INFO L117 PetriNetUnfolderBase]: For 3942/3942 co-relation queries the response was YES. [2025-04-13 20:17:36,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28695 conditions, 12370 events. 9507/12370 cut-off events. For 3942/3942 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 61000 event pairs, 6226 based on Foata normal form. 151/9173 useless extension candidates. Maximal degree in co-relation 26911. Up to 11346 conditions per place. [2025-04-13 20:17:36,758 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 34 selfloop transitions, 4 changer transitions 21/63 dead transitions. [2025-04-13 20:17:36,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 321 flow [2025-04-13 20:17:36,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:17:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:17:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-04-13 20:17:36,760 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2025-04-13 20:17:36,760 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 161 flow. Second operand 6 states and 105 transitions. [2025-04-13 20:17:36,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 321 flow [2025-04-13 20:17:36,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 306 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 20:17:36,763 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 144 flow [2025-04-13 20:17:36,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-04-13 20:17:36,763 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2025-04-13 20:17:36,763 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 144 flow [2025-04-13 20:17:36,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:36,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:36,764 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] [2025-04-13 20:17:36,769 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:17:36,968 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,SelfDestructingSolverStorable3 [2025-04-13 20:17:36,968 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:36,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1313816055, now seen corresponding path program 2 times [2025-04-13 20:17:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:36,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465269572] [2025-04-13 20:17:36,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:17:36,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:36,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:17:36,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 20:17:36,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:17:36,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:37,043 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:17:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:37,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465269572] [2025-04-13 20:17:37,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465269572] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:37,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:17:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121751254] [2025-04-13 20:17:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:37,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:17:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:37,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:17:37,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:17:37,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:37,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:37,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:37,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:37,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:38,245 INFO L116 PetriNetUnfolderBase]: 21496/27129 cut-off events. [2025-04-13 20:17:38,245 INFO L117 PetriNetUnfolderBase]: For 5662/5662 co-relation queries the response was YES. [2025-04-13 20:17:38,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63514 conditions, 27129 events. 21496/27129 cut-off events. For 5662/5662 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 136607 event pairs, 4253 based on Foata normal form. 1/19760 useless extension candidates. Maximal degree in co-relation 63484. Up to 9842 conditions per place. [2025-04-13 20:17:38,383 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 88 selfloop transitions, 8 changer transitions 1/101 dead transitions. [2025-04-13 20:17:38,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 101 transitions, 522 flow [2025-04-13 20:17:38,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:17:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:17:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-04-13 20:17:38,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2025-04-13 20:17:38,384 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 144 flow. Second operand 4 states and 116 transitions. [2025-04-13 20:17:38,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 101 transitions, 522 flow [2025-04-13 20:17:38,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 101 transitions, 510 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:17:38,387 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 208 flow [2025-04-13 20:17:38,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2025-04-13 20:17:38,387 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2025-04-13 20:17:38,387 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 208 flow [2025-04-13 20:17:38,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:38,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:38,387 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] [2025-04-13 20:17:38,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:17:38,388 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:38,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 316453503, now seen corresponding path program 2 times [2025-04-13 20:17:38,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:38,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380872795] [2025-04-13 20:17:38,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:17:38,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:38,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:17:38,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 20:17:38,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:17:38,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:38,453 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:17:38,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:38,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380872795] [2025-04-13 20:17:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380872795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:38,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:17:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031760813] [2025-04-13 20:17:38,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:38,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:17:38,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:17:38,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:17:38,454 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:38,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:38,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:38,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:38,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:39,692 INFO L116 PetriNetUnfolderBase]: 23478/29654 cut-off events. [2025-04-13 20:17:39,693 INFO L117 PetriNetUnfolderBase]: For 17785/17785 co-relation queries the response was YES. [2025-04-13 20:17:39,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76640 conditions, 29654 events. 23478/29654 cut-off events. For 17785/17785 co-relation queries the response was YES. Maximal size of possible extension queue 1405. Compared 148831 event pairs, 3336 based on Foata normal form. 1/21618 useless extension candidates. Maximal degree in co-relation 76611. Up to 25562 conditions per place. [2025-04-13 20:17:39,804 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 76 selfloop transitions, 9 changer transitions 6/95 dead transitions. [2025-04-13 20:17:39,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 542 flow [2025-04-13 20:17:39,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:17:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:17:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-13 20:17:39,805 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2025-04-13 20:17:39,805 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 208 flow. Second operand 4 states and 109 transitions. [2025-04-13 20:17:39,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 542 flow [2025-04-13 20:17:39,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 506 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-04-13 20:17:39,881 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 261 flow [2025-04-13 20:17:39,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2025-04-13 20:17:39,882 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2025-04-13 20:17:39,882 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 261 flow [2025-04-13 20:17:39,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:39,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:39,882 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] [2025-04-13 20:17:39,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:17:39,882 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:39,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 701913697, now seen corresponding path program 1 times [2025-04-13 20:17:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:39,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350133100] [2025-04-13 20:17:39,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:39,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:17:39,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:17:39,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:39,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:40,460 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:17:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:40,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350133100] [2025-04-13 20:17:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350133100] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:17:40,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393308717] [2025-04-13 20:17:40,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:40,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:40,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:17:40,464 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:17:40,468 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:17:40,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:17:40,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:17:40,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:40,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:40,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 20:17:40,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:17:40,711 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:17:40,795 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:17:40,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:17:40,928 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:17:40,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393308717] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:17:40,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:17:40,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-13 20:17:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953310610] [2025-04-13 20:17:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:40,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:17:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:40,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:17:40,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:17:40,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:40,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:40,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:40,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:40,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:42,662 INFO L116 PetriNetUnfolderBase]: 25815/32719 cut-off events. [2025-04-13 20:17:42,663 INFO L117 PetriNetUnfolderBase]: For 17217/17217 co-relation queries the response was YES. [2025-04-13 20:17:42,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83622 conditions, 32719 events. 25815/32719 cut-off events. For 17217/17217 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 169325 event pairs, 2495 based on Foata normal form. 1/23905 useless extension candidates. Maximal degree in co-relation 83591. Up to 28831 conditions per place. [2025-04-13 20:17:42,853 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 116 selfloop transitions, 32 changer transitions 5/157 dead transitions. [2025-04-13 20:17:42,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 157 transitions, 874 flow [2025-04-13 20:17:42,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:17:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:17:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2025-04-13 20:17:42,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6550522648083623 [2025-04-13 20:17:42,855 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 261 flow. Second operand 7 states and 188 transitions. [2025-04-13 20:17:42,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 157 transitions, 874 flow [2025-04-13 20:17:42,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 157 transitions, 866 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-13 20:17:42,919 INFO L231 Difference]: Finished difference. Result has 64 places, 80 transitions, 496 flow [2025-04-13 20:17:42,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=496, PETRI_PLACES=64, PETRI_TRANSITIONS=80} [2025-04-13 20:17:42,919 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2025-04-13 20:17:42,919 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 80 transitions, 496 flow [2025-04-13 20:17:42,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:42,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:42,920 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] [2025-04-13 20:17:42,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:17:43,124 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:17:43,124 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:43,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1863052067, now seen corresponding path program 2 times [2025-04-13 20:17:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:43,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343631341] [2025-04-13 20:17:43,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:17:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:43,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:17:43,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:17:43,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:17:43,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:43,323 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:17:43,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:43,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343631341] [2025-04-13 20:17:43,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343631341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:43,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:43,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:17:43,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285789869] [2025-04-13 20:17:43,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:43,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:17:43,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:43,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:17:43,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:17:43,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:43,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 80 transitions, 496 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17:43,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:43,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:43,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:45,519 INFO L116 PetriNetUnfolderBase]: 30603/38969 cut-off events. [2025-04-13 20:17:45,519 INFO L117 PetriNetUnfolderBase]: For 37173/37173 co-relation queries the response was YES. [2025-04-13 20:17:45,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108960 conditions, 38969 events. 30603/38969 cut-off events. For 37173/37173 co-relation queries the response was YES. Maximal size of possible extension queue 2030. Compared 209455 event pairs, 4033 based on Foata normal form. 1/28790 useless extension candidates. Maximal degree in co-relation 108924. Up to 31705 conditions per place. [2025-04-13 20:17:45,742 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 145 selfloop transitions, 51 changer transitions 8/208 dead transitions. [2025-04-13 20:17:45,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 208 transitions, 1472 flow [2025-04-13 20:17:45,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:17:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:17:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2025-04-13 20:17:45,743 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6689895470383276 [2025-04-13 20:17:45,743 INFO L175 Difference]: Start difference. First operand has 64 places, 80 transitions, 496 flow. Second operand 7 states and 192 transitions. [2025-04-13 20:17:45,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 208 transitions, 1472 flow [2025-04-13 20:17:45,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 208 transitions, 1431 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-04-13 20:17:45,888 INFO L231 Difference]: Finished difference. Result has 73 places, 122 transitions, 932 flow [2025-04-13 20:17:45,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=932, PETRI_PLACES=73, PETRI_TRANSITIONS=122} [2025-04-13 20:17:45,888 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2025-04-13 20:17:45,888 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 122 transitions, 932 flow [2025-04-13 20:17:45,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17:45,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:45,889 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] [2025-04-13 20:17:45,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:17:45,889 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:45,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1232749341, now seen corresponding path program 3 times [2025-04-13 20:17:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:45,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148168983] [2025-04-13 20:17:45,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:17:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:45,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:17:45,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:17:45,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:17:45,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:46,053 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:17:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:46,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148168983] [2025-04-13 20:17:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148168983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:46,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:17:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784130047] [2025-04-13 20:17:46,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:46,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:17:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:46,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:17:46,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:17:46,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:46,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 122 transitions, 932 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17:46,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:46,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:46,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:48,746 INFO L116 PetriNetUnfolderBase]: 32597/41565 cut-off events. [2025-04-13 20:17:48,746 INFO L117 PetriNetUnfolderBase]: For 67605/67605 co-relation queries the response was YES. [2025-04-13 20:17:48,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131164 conditions, 41565 events. 32597/41565 cut-off events. For 67605/67605 co-relation queries the response was YES. Maximal size of possible extension queue 2169. Compared 225691 event pairs, 4635 based on Foata normal form. 1/30816 useless extension candidates. Maximal degree in co-relation 131123. Up to 36709 conditions per place. [2025-04-13 20:17:48,974 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 160 selfloop transitions, 51 changer transitions 5/220 dead transitions. [2025-04-13 20:17:48,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 220 transitions, 1841 flow [2025-04-13 20:17:48,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:17:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:17:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2025-04-13 20:17:48,975 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6376306620209059 [2025-04-13 20:17:48,975 INFO L175 Difference]: Start difference. First operand has 73 places, 122 transitions, 932 flow. Second operand 7 states and 183 transitions. [2025-04-13 20:17:48,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 220 transitions, 1841 flow [2025-04-13 20:17:49,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 220 transitions, 1756 flow, removed 34 selfloop flow, removed 1 redundant places. [2025-04-13 20:17:49,394 INFO L231 Difference]: Finished difference. Result has 82 places, 149 transitions, 1295 flow [2025-04-13 20:17:49,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1295, PETRI_PLACES=82, PETRI_TRANSITIONS=149} [2025-04-13 20:17:49,395 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2025-04-13 20:17:49,395 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 149 transitions, 1295 flow [2025-04-13 20:17:49,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17:49,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:49,395 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] [2025-04-13 20:17:49,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:17:49,395 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:49,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2114519422, now seen corresponding path program 1 times [2025-04-13 20:17:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:49,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347638972] [2025-04-13 20:17:49,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:49,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:49,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:17:49,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:17:49,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:49,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:49,795 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:17:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:49,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347638972] [2025-04-13 20:17:49,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347638972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:17:49,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504739952] [2025-04-13 20:17:49,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:17:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:17:49,797 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:17:49,799 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:17:49,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:17:49,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:17:49,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:17:49,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:49,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 20:17:49,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:17:50,018 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:17:50,100 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:17:50,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:17:50,225 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:17:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504739952] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:17:50,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:17:50,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-13 20:17:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391834993] [2025-04-13 20:17:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:50,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:17:50,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:50,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:17:50,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:17:50,227 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:50,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 149 transitions, 1295 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:50,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:50,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:50,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:52,987 INFO L116 PetriNetUnfolderBase]: 33741/43029 cut-off events. [2025-04-13 20:17:52,988 INFO L117 PetriNetUnfolderBase]: For 102349/102349 co-relation queries the response was YES. [2025-04-13 20:17:53,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145767 conditions, 43029 events. 33741/43029 cut-off events. For 102349/102349 co-relation queries the response was YES. Maximal size of possible extension queue 2286. Compared 236212 event pairs, 4225 based on Foata normal form. 1/31909 useless extension candidates. Maximal degree in co-relation 145721. Up to 40476 conditions per place. [2025-04-13 20:17:53,261 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 193 selfloop transitions, 34 changer transitions 4/235 dead transitions. [2025-04-13 20:17:53,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 235 transitions, 2162 flow [2025-04-13 20:17:53,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:17:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:17:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2025-04-13 20:17:53,265 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5993031358885017 [2025-04-13 20:17:53,265 INFO L175 Difference]: Start difference. First operand has 82 places, 149 transitions, 1295 flow. Second operand 7 states and 172 transitions. [2025-04-13 20:17:53,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 235 transitions, 2162 flow [2025-04-13 20:17:53,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 235 transitions, 2005 flow, removed 38 selfloop flow, removed 3 redundant places. [2025-04-13 20:17:53,911 INFO L231 Difference]: Finished difference. Result has 87 places, 173 transitions, 1520 flow [2025-04-13 20:17:53,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1520, PETRI_PLACES=87, PETRI_TRANSITIONS=173} [2025-04-13 20:17:53,912 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2025-04-13 20:17:53,912 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 173 transitions, 1520 flow [2025-04-13 20:17:53,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:53,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:53,912 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] [2025-04-13 20:17:53,918 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:17:54,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:54,113 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:54,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2041066814, now seen corresponding path program 2 times [2025-04-13 20:17:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:54,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882152802] [2025-04-13 20:17:54,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:17:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:54,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:17:54,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:17:54,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:17:54,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:54,259 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:17:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:54,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882152802] [2025-04-13 20:17:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882152802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:17:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835215694] [2025-04-13 20:17:54,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:54,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:17:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:54,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:17:54,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:17:54,260 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:54,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 173 transitions, 1520 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17:54,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:54,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:54,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:57,754 INFO L116 PetriNetUnfolderBase]: 37602/48047 cut-off events. [2025-04-13 20:17:57,754 INFO L117 PetriNetUnfolderBase]: For 139381/139381 co-relation queries the response was YES. [2025-04-13 20:17:57,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166521 conditions, 48047 events. 37602/48047 cut-off events. For 139381/139381 co-relation queries the response was YES. Maximal size of possible extension queue 2601. Compared 268370 event pairs, 5561 based on Foata normal form. 1/35781 useless extension candidates. Maximal degree in co-relation 166473. Up to 41564 conditions per place. [2025-04-13 20:17:58,075 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 203 selfloop transitions, 68 changer transitions 9/284 dead transitions. [2025-04-13 20:17:58,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 284 transitions, 2822 flow [2025-04-13 20:17:58,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:17:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:17:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-04-13 20:17:58,077 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6445993031358885 [2025-04-13 20:17:58,077 INFO L175 Difference]: Start difference. First operand has 87 places, 173 transitions, 1520 flow. Second operand 7 states and 185 transitions. [2025-04-13 20:17:58,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 284 transitions, 2822 flow [2025-04-13 20:17:59,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 284 transitions, 2631 flow, removed 93 selfloop flow, removed 1 redundant places. [2025-04-13 20:17:59,035 INFO L231 Difference]: Finished difference. Result has 96 places, 207 transitions, 1983 flow [2025-04-13 20:17:59,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1983, PETRI_PLACES=96, PETRI_TRANSITIONS=207} [2025-04-13 20:17:59,035 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2025-04-13 20:17:59,035 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 207 transitions, 1983 flow [2025-04-13 20:17:59,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17:59,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:59,035 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] [2025-04-13 20:17:59,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:17:59,036 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:17:59,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1684199170, now seen corresponding path program 3 times [2025-04-13 20:17:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:59,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723222300] [2025-04-13 20:17:59,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:17:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:59,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:17:59,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:17:59,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:17:59,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:59,305 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:17:59,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:59,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723222300] [2025-04-13 20:17:59,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723222300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:59,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:59,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:17:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475745785] [2025-04-13 20:17:59,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:59,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:17:59,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:59,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:17:59,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:17:59,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:17:59,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 207 transitions, 1983 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17:59,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:59,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:17:59,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:02,391 INFO L116 PetriNetUnfolderBase]: 39532/50550 cut-off events. [2025-04-13 20:18:02,391 INFO L117 PetriNetUnfolderBase]: For 201298/201298 co-relation queries the response was YES. [2025-04-13 20:18:02,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188975 conditions, 50550 events. 39532/50550 cut-off events. For 201298/201298 co-relation queries the response was YES. Maximal size of possible extension queue 2720. Compared 285561 event pairs, 5999 based on Foata normal form. 1/37732 useless extension candidates. Maximal degree in co-relation 188922. Up to 45947 conditions per place. [2025-04-13 20:18:02,870 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 223 selfloop transitions, 64 changer transitions 6/297 dead transitions. [2025-04-13 20:18:02,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 297 transitions, 3177 flow [2025-04-13 20:18:02,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:18:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:18:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2025-04-13 20:18:02,871 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6236933797909407 [2025-04-13 20:18:02,871 INFO L175 Difference]: Start difference. First operand has 96 places, 207 transitions, 1983 flow. Second operand 7 states and 179 transitions. [2025-04-13 20:18:02,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 297 transitions, 3177 flow [2025-04-13 20:18:04,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 297 transitions, 2997 flow, removed 90 selfloop flow, removed 0 redundant places. [2025-04-13 20:18:04,537 INFO L231 Difference]: Finished difference. Result has 106 places, 234 transitions, 2416 flow [2025-04-13 20:18:04,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2416, PETRI_PLACES=106, PETRI_TRANSITIONS=234} [2025-04-13 20:18:04,538 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places. [2025-04-13 20:18:04,538 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 234 transitions, 2416 flow [2025-04-13 20:18:04,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:04,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:04,538 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] [2025-04-13 20:18:04,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:18:04,538 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:18:04,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 308672944, now seen corresponding path program 1 times [2025-04-13 20:18:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:04,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781197655] [2025-04-13 20:18:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:04,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:18:04,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:18:04,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:04,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:05,070 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:05,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:05,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781197655] [2025-04-13 20:18:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781197655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:05,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467098769] [2025-04-13 20:18:05,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:05,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:05,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:05,073 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:05,073 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:05,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:18:05,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:18:05,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:05,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:05,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 20:18:05,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:05,349 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:05,411 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:18:05,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:05,585 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:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467098769] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:18:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-13 20:18:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592534529] [2025-04-13 20:18:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:05,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:18:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:05,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:18:05,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:18:05,586 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:18:05,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 234 transitions, 2416 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:05,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:05,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:18:05,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:09,878 INFO L116 PetriNetUnfolderBase]: 44616/57150 cut-off events. [2025-04-13 20:18:09,878 INFO L117 PetriNetUnfolderBase]: For 304274/304274 co-relation queries the response was YES. [2025-04-13 20:18:10,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223582 conditions, 57150 events. 44616/57150 cut-off events. For 304274/304274 co-relation queries the response was YES. Maximal size of possible extension queue 3074. Compared 331039 event pairs, 5184 based on Foata normal form. 1/42591 useless extension candidates. Maximal degree in co-relation 223523. Up to 49367 conditions per place. [2025-04-13 20:18:10,466 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 288 selfloop transitions, 52 changer transitions 4/348 dead transitions. [2025-04-13 20:18:10,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 348 transitions, 3906 flow [2025-04-13 20:18:10,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:18:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:18:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2025-04-13 20:18:10,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-04-13 20:18:10,472 INFO L175 Difference]: Start difference. First operand has 106 places, 234 transitions, 2416 flow. Second operand 8 states and 192 transitions. [2025-04-13 20:18:10,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 348 transitions, 3906 flow [2025-04-13 20:18:12,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 348 transitions, 3619 flow, removed 112 selfloop flow, removed 2 redundant places. [2025-04-13 20:18:12,668 INFO L231 Difference]: Finished difference. Result has 114 places, 274 transitions, 2953 flow [2025-04-13 20:18:12,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2953, PETRI_PLACES=114, PETRI_TRANSITIONS=274} [2025-04-13 20:18:12,669 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places. [2025-04-13 20:18:12,669 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 274 transitions, 2953 flow [2025-04-13 20:18:12,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:12,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:12,669 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] [2025-04-13 20:18:12,675 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:12,870 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,SelfDestructingSolverStorable12 [2025-04-13 20:18:12,870 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:18:12,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:12,871 INFO L85 PathProgramCache]: Analyzing trace with hash 660912700, now seen corresponding path program 2 times [2025-04-13 20:18:12,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:12,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171483076] [2025-04-13 20:18:12,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:18:12,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:12,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:18:12,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:18:12,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:18:12,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:12,982 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:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:12,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171483076] [2025-04-13 20:18:12,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171483076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:12,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:12,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:18:12,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507369535] [2025-04-13 20:18:12,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:12,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:18:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:12,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:18:12,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:18:12,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:18:12,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 274 transitions, 2953 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:12,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:12,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:18:12,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:17,994 INFO L116 PetriNetUnfolderBase]: 48945/62828 cut-off events. [2025-04-13 20:18:17,994 INFO L117 PetriNetUnfolderBase]: For 391372/391372 co-relation queries the response was YES. [2025-04-13 20:18:18,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257768 conditions, 62828 events. 48945/62828 cut-off events. For 391372/391372 co-relation queries the response was YES. Maximal size of possible extension queue 3346. Compared 367901 event pairs, 7325 based on Foata normal form. 1/47111 useless extension candidates. Maximal degree in co-relation 257705. Up to 55470 conditions per place. [2025-04-13 20:18:18,656 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 307 selfloop transitions, 89 changer transitions 5/405 dead transitions. [2025-04-13 20:18:18,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 405 transitions, 4847 flow [2025-04-13 20:18:18,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:18:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:18:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-04-13 20:18:18,657 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.686411149825784 [2025-04-13 20:18:18,657 INFO L175 Difference]: Start difference. First operand has 114 places, 274 transitions, 2953 flow. Second operand 7 states and 197 transitions. [2025-04-13 20:18:18,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 405 transitions, 4847 flow [2025-04-13 20:18:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 405 transitions, 4408 flow, removed 217 selfloop flow, removed 1 redundant places. [2025-04-13 20:18:25,017 INFO L231 Difference]: Finished difference. Result has 123 places, 323 transitions, 3630 flow [2025-04-13 20:18:25,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3630, PETRI_PLACES=123, PETRI_TRANSITIONS=323} [2025-04-13 20:18:25,017 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2025-04-13 20:18:25,017 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 323 transitions, 3630 flow [2025-04-13 20:18:25,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:25,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:25,018 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] [2025-04-13 20:18:25,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:18:25,018 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:18:25,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1687551782, now seen corresponding path program 3 times [2025-04-13 20:18:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:25,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948865211] [2025-04-13 20:18:25,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:18:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:25,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:18:25,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:18:25,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:18:25,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:25,112 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:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:25,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948865211] [2025-04-13 20:18:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948865211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:25,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:18:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602905409] [2025-04-13 20:18:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:25,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:18:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:25,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:18:25,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:18:25,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:18:25,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 323 transitions, 3630 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:25,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:25,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:18:25,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:30,704 INFO L116 PetriNetUnfolderBase]: 50674/65084 cut-off events. [2025-04-13 20:18:30,705 INFO L117 PetriNetUnfolderBase]: For 401296/401296 co-relation queries the response was YES. [2025-04-13 20:18:31,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270793 conditions, 65084 events. 50674/65084 cut-off events. For 401296/401296 co-relation queries the response was YES. Maximal size of possible extension queue 3464. Compared 382405 event pairs, 7943 based on Foata normal form. 1/48838 useless extension candidates. Maximal degree in co-relation 270725. Up to 60101 conditions per place. [2025-04-13 20:18:31,407 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 320 selfloop transitions, 81 changer transitions 5/410 dead transitions. [2025-04-13 20:18:31,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 410 transitions, 5032 flow [2025-04-13 20:18:31,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:18:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:18:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-04-13 20:18:31,409 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6480836236933798 [2025-04-13 20:18:31,409 INFO L175 Difference]: Start difference. First operand has 123 places, 323 transitions, 3630 flow. Second operand 7 states and 186 transitions. [2025-04-13 20:18:31,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 410 transitions, 5032 flow [2025-04-13 20:18:36,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 410 transitions, 4682 flow, removed 175 selfloop flow, removed 0 redundant places. [2025-04-13 20:18:36,960 INFO L231 Difference]: Finished difference. Result has 133 places, 346 transitions, 3988 flow [2025-04-13 20:18:36,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3346, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3988, PETRI_PLACES=133, PETRI_TRANSITIONS=346} [2025-04-13 20:18:36,961 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2025-04-13 20:18:36,961 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 346 transitions, 3988 flow [2025-04-13 20:18:36,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:36,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:36,961 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] [2025-04-13 20:18:36,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:18:36,961 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:18:36,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1522565398, now seen corresponding path program 4 times [2025-04-13 20:18:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:36,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323624506] [2025-04-13 20:18:36,962 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:18:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:36,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:18:36,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:18:36,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:18:36,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:37,141 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:37,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:37,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323624506] [2025-04-13 20:18:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323624506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:37,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:37,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:18:37,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968748426] [2025-04-13 20:18:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:37,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:18:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:37,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:18:37,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:18:37,143 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:18:37,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 346 transitions, 3988 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:37,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:37,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:18:37,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:43,133 INFO L116 PetriNetUnfolderBase]: 52532/67502 cut-off events. [2025-04-13 20:18:43,133 INFO L117 PetriNetUnfolderBase]: For 465733/465733 co-relation queries the response was YES. [2025-04-13 20:18:43,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287420 conditions, 67502 events. 52532/67502 cut-off events. For 465733/465733 co-relation queries the response was YES. Maximal size of possible extension queue 3622. Compared 398356 event pairs, 8319 based on Foata normal form. 1/50704 useless extension candidates. Maximal degree in co-relation 287346. Up to 62529 conditions per place. [2025-04-13 20:18:43,989 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 334 selfloop transitions, 82 changer transitions 5/425 dead transitions. [2025-04-13 20:18:43,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 425 transitions, 5244 flow [2025-04-13 20:18:43,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:18:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:18:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-04-13 20:18:43,990 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6445993031358885 [2025-04-13 20:18:43,990 INFO L175 Difference]: Start difference. First operand has 133 places, 346 transitions, 3988 flow. Second operand 7 states and 185 transitions. [2025-04-13 20:18:43,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 425 transitions, 5244 flow [2025-04-13 20:18:49,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 425 transitions, 4984 flow, removed 110 selfloop flow, removed 1 redundant places. [2025-04-13 20:18:49,476 INFO L231 Difference]: Finished difference. Result has 140 places, 362 transitions, 4213 flow [2025-04-13 20:18:49,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3728, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4213, PETRI_PLACES=140, PETRI_TRANSITIONS=362} [2025-04-13 20:18:49,476 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 96 predicate places. [2025-04-13 20:18:49,477 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 362 transitions, 4213 flow [2025-04-13 20:18:49,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:49,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:49,477 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] [2025-04-13 20:18:49,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:18:49,477 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:18:49,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1237342805, now seen corresponding path program 1 times [2025-04-13 20:18:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:49,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794757292] [2025-04-13 20:18:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:49,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:18:49,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:18:49,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:49,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:49,822 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:49,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:49,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794757292] [2025-04-13 20:18:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794757292] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:49,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721949375] [2025-04-13 20:18:49,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:49,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:49,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:49,825 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:49,826 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:49,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:18:49,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:18:49,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:49,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:49,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 20:18:49,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:50,069 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:50,117 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:18:50,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:50,237 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:50,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721949375] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:50,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:18:50,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-13 20:18:50,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614311900] [2025-04-13 20:18:50,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:50,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:18:50,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:50,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:18:50,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:18:50,238 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:18:50,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 362 transitions, 4213 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:50,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:50,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:18:50,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:56,919 INFO L116 PetriNetUnfolderBase]: 56527/72674 cut-off events. [2025-04-13 20:18:56,920 INFO L117 PetriNetUnfolderBase]: For 548450/548450 co-relation queries the response was YES. [2025-04-13 20:18:57,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315931 conditions, 72674 events. 56527/72674 cut-off events. For 548450/548450 co-relation queries the response was YES. Maximal size of possible extension queue 3897. Compared 435183 event pairs, 7373 based on Foata normal form. 1/54519 useless extension candidates. Maximal degree in co-relation 315854. Up to 65450 conditions per place. [2025-04-13 20:18:57,900 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 405 selfloop transitions, 62 changer transitions 4/475 dead transitions. [2025-04-13 20:18:57,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 475 transitions, 6178 flow [2025-04-13 20:18:57,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:18:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:18:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2025-04-13 20:18:57,901 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5762195121951219 [2025-04-13 20:18:57,901 INFO L175 Difference]: Start difference. First operand has 140 places, 362 transitions, 4213 flow. Second operand 8 states and 189 transitions. [2025-04-13 20:18:57,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 475 transitions, 6178 flow [2025-04-13 20:19:02,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 475 transitions, 5832 flow, removed 100 selfloop flow, removed 4 redundant places. [2025-04-13 20:19:02,817 INFO L231 Difference]: Finished difference. Result has 147 places, 404 transitions, 4962 flow [2025-04-13 20:19:02,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3869, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4962, PETRI_PLACES=147, PETRI_TRANSITIONS=404} [2025-04-13 20:19:02,822 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 103 predicate places. [2025-04-13 20:19:02,822 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 404 transitions, 4962 flow [2025-04-13 20:19:02,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:19:02,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:02,822 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] [2025-04-13 20:19:02,833 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:19:03,023 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,SelfDestructingSolverStorable16 [2025-04-13 20:19:03,023 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:19:03,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:03,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1496756197, now seen corresponding path program 2 times [2025-04-13 20:19:03,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:03,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692903836] [2025-04-13 20:19:03,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:19:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:03,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:19:03,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:19:03,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:19:03,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:03,194 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:03,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:03,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692903836] [2025-04-13 20:19:03,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692903836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:19:03,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:19:03,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:19:03,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023678053] [2025-04-13 20:19:03,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:19:03,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:19:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:03,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:19:03,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:19:03,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:19:03,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 404 transitions, 4962 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:03,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:03,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:19:03,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:10,222 INFO L116 PetriNetUnfolderBase]: 57912/74485 cut-off events. [2025-04-13 20:19:10,223 INFO L117 PetriNetUnfolderBase]: For 591245/591245 co-relation queries the response was YES. [2025-04-13 20:19:11,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326244 conditions, 74485 events. 57912/74485 cut-off events. For 591245/591245 co-relation queries the response was YES. Maximal size of possible extension queue 3959. Compared 445883 event pairs, 8906 based on Foata normal form. 1/55909 useless extension candidates. Maximal degree in co-relation 326163. Up to 67013 conditions per place. [2025-04-13 20:19:11,290 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 377 selfloop transitions, 114 changer transitions 5/500 dead transitions. [2025-04-13 20:19:11,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 500 transitions, 6596 flow [2025-04-13 20:19:11,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:19:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:19:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2025-04-13 20:19:11,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6759581881533101 [2025-04-13 20:19:11,291 INFO L175 Difference]: Start difference. First operand has 147 places, 404 transitions, 4962 flow. Second operand 7 states and 194 transitions. [2025-04-13 20:19:11,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 500 transitions, 6596 flow [2025-04-13 20:19:18,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 500 transitions, 6077 flow, removed 257 selfloop flow, removed 1 redundant places. [2025-04-13 20:19:18,726 INFO L231 Difference]: Finished difference. Result has 155 places, 425 transitions, 5177 flow [2025-04-13 20:19:18,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4479, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5177, PETRI_PLACES=155, PETRI_TRANSITIONS=425} [2025-04-13 20:19:18,727 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 111 predicate places. [2025-04-13 20:19:18,727 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 425 transitions, 5177 flow [2025-04-13 20:19:18,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:18,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:18,727 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] [2025-04-13 20:19:18,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:19:18,727 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:19:18,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash -288492567, now seen corresponding path program 3 times [2025-04-13 20:19:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:18,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849883973] [2025-04-13 20:19:18,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:19:18,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:18,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:19:18,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:19:18,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:19:18,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:18,843 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:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:18,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849883973] [2025-04-13 20:19:18,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849883973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:19:18,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:19:18,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:19:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945551035] [2025-04-13 20:19:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:19:18,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:19:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:18,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:19:18,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:19:18,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:19:18,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 425 transitions, 5177 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:18,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:18,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:19:18,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:26,198 INFO L116 PetriNetUnfolderBase]: 59370/76379 cut-off events. [2025-04-13 20:19:26,198 INFO L117 PetriNetUnfolderBase]: For 609406/609406 co-relation queries the response was YES. [2025-04-13 20:19:27,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336995 conditions, 76379 events. 59370/76379 cut-off events. For 609406/609406 co-relation queries the response was YES. Maximal size of possible extension queue 4106. Compared 457902 event pairs, 9737 based on Foata normal form. 1/57352 useless extension candidates. Maximal degree in co-relation 336910. Up to 71732 conditions per place. [2025-04-13 20:19:27,425 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 407 selfloop transitions, 85 changer transitions 6/502 dead transitions. [2025-04-13 20:19:27,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 502 transitions, 6713 flow [2025-04-13 20:19:27,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:19:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:19:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-04-13 20:19:27,426 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.627177700348432 [2025-04-13 20:19:27,426 INFO L175 Difference]: Start difference. First operand has 155 places, 425 transitions, 5177 flow. Second operand 7 states and 180 transitions. [2025-04-13 20:19:27,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 502 transitions, 6713 flow [2025-04-13 20:19:32,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 502 transitions, 6420 flow, removed 103 selfloop flow, removed 2 redundant places. [2025-04-13 20:19:32,091 INFO L231 Difference]: Finished difference. Result has 162 places, 444 transitions, 5522 flow [2025-04-13 20:19:32,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4892, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5522, PETRI_PLACES=162, PETRI_TRANSITIONS=444} [2025-04-13 20:19:32,092 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 118 predicate places. [2025-04-13 20:19:32,092 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 444 transitions, 5522 flow [2025-04-13 20:19:32,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:32,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:32,092 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] [2025-04-13 20:19:32,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:19:32,092 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:19:32,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -591752027, now seen corresponding path program 4 times [2025-04-13 20:19:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:32,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670020062] [2025-04-13 20:19:32,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:19:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:32,099 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:19:32,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:19:32,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:19:32,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:32,216 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:32,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:32,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670020062] [2025-04-13 20:19:32,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670020062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:19:32,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:19:32,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:19:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866356084] [2025-04-13 20:19:32,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:19:32,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:19:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:32,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:19:32,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:19:32,218 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:19:32,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 444 transitions, 5522 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:32,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:32,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:19:32,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:40,455 INFO L116 PetriNetUnfolderBase]: 60921/78387 cut-off events. [2025-04-13 20:19:40,455 INFO L117 PetriNetUnfolderBase]: For 713662/713662 co-relation queries the response was YES. [2025-04-13 20:19:41,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355617 conditions, 78387 events. 60921/78387 cut-off events. For 713662/713662 co-relation queries the response was YES. Maximal size of possible extension queue 4229. Compared 471330 event pairs, 10068 based on Foata normal form. 1/58890 useless extension candidates. Maximal degree in co-relation 355528. Up to 73752 conditions per place. [2025-04-13 20:19:41,624 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 420 selfloop transitions, 86 changer transitions 6/516 dead transitions. [2025-04-13 20:19:41,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 516 transitions, 7005 flow [2025-04-13 20:19:41,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:19:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:19:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-04-13 20:19:41,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6202090592334495 [2025-04-13 20:19:41,625 INFO L175 Difference]: Start difference. First operand has 162 places, 444 transitions, 5522 flow. Second operand 7 states and 178 transitions. [2025-04-13 20:19:41,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 516 transitions, 7005 flow [2025-04-13 20:19:47,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 516 transitions, 6627 flow, removed 138 selfloop flow, removed 2 redundant places. [2025-04-13 20:19:47,746 INFO L231 Difference]: Finished difference. Result has 168 places, 460 transitions, 5699 flow [2025-04-13 20:19:47,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5144, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5699, PETRI_PLACES=168, PETRI_TRANSITIONS=460} [2025-04-13 20:19:47,747 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 124 predicate places. [2025-04-13 20:19:47,747 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 460 transitions, 5699 flow [2025-04-13 20:19:47,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:47,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:47,747 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] [2025-04-13 20:19:47,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:19:47,747 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:19:47,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1673265577, now seen corresponding path program 4 times [2025-04-13 20:19:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:47,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294361557] [2025-04-13 20:19:47,747 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:19:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:47,753 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:19:47,763 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:19:47,763 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:19:47,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:47,853 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:47,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:47,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294361557] [2025-04-13 20:19:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294361557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:19:47,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:19:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:19:47,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238317280] [2025-04-13 20:19:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:19:47,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:19:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:47,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:19:47,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:19:47,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:19:47,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 460 transitions, 5699 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:47,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:47,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:19:47,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:56,131 INFO L116 PetriNetUnfolderBase]: 64398/82910 cut-off events. [2025-04-13 20:19:56,131 INFO L117 PetriNetUnfolderBase]: For 780872/780872 co-relation queries the response was YES. [2025-04-13 20:19:57,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379561 conditions, 82910 events. 64398/82910 cut-off events. For 780872/780872 co-relation queries the response was YES. Maximal size of possible extension queue 4509. Compared 503287 event pairs, 8406 based on Foata normal form. 1/62491 useless extension candidates. Maximal degree in co-relation 379470. Up to 75371 conditions per place. [2025-04-13 20:19:57,478 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 462 selfloop transitions, 107 changer transitions 5/578 dead transitions. [2025-04-13 20:19:57,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 578 transitions, 7952 flow [2025-04-13 20:19:57,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:19:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:19:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2025-04-13 20:19:57,479 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6968641114982579 [2025-04-13 20:19:57,479 INFO L175 Difference]: Start difference. First operand has 168 places, 460 transitions, 5699 flow. Second operand 7 states and 200 transitions. [2025-04-13 20:19:57,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 578 transitions, 7952 flow [2025-04-13 20:20:02,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 578 transitions, 7487 flow, removed 127 selfloop flow, removed 5 redundant places. [2025-04-13 20:20:02,296 INFO L231 Difference]: Finished difference. Result has 172 places, 493 transitions, 6300 flow [2025-04-13 20:20:02,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5253, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6300, PETRI_PLACES=172, PETRI_TRANSITIONS=493} [2025-04-13 20:20:02,296 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 128 predicate places. [2025-04-13 20:20:02,296 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 493 transitions, 6300 flow [2025-04-13 20:20:02,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20:02,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:02,297 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] [2025-04-13 20:20:02,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:20:02,297 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:20:02,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 73407020, now seen corresponding path program 4 times [2025-04-13 20:20:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:02,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239144297] [2025-04-13 20:20:02,297 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:20:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:02,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:20:02,307 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:20:02,307 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:20:02,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:02,392 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:20:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:02,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239144297] [2025-04-13 20:20:02,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239144297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:20:02,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:20:02,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:20:02,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906369429] [2025-04-13 20:20:02,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:02,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:20:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:02,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:20:02,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:20:02,394 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:20:02,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 493 transitions, 6300 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20:02,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:02,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:20:02,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:11,752 INFO L116 PetriNetUnfolderBase]: 66066/85075 cut-off events. [2025-04-13 20:20:11,753 INFO L117 PetriNetUnfolderBase]: For 812848/812848 co-relation queries the response was YES. [2025-04-13 20:20:12,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394586 conditions, 85075 events. 66066/85075 cut-off events. For 812848/812848 co-relation queries the response was YES. Maximal size of possible extension queue 4666. Compared 517830 event pairs, 8487 based on Foata normal form. 1/64168 useless extension candidates. Maximal degree in co-relation 394493. Up to 77480 conditions per place. [2025-04-13 20:20:13,368 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 468 selfloop transitions, 115 changer transitions 5/592 dead transitions. [2025-04-13 20:20:13,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 592 transitions, 8285 flow [2025-04-13 20:20:13,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:20:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:20:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-04-13 20:20:13,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.686411149825784 [2025-04-13 20:20:13,369 INFO L175 Difference]: Start difference. First operand has 172 places, 493 transitions, 6300 flow. Second operand 7 states and 197 transitions. [2025-04-13 20:20:13,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 592 transitions, 8285 flow [2025-04-13 20:20:20,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 592 transitions, 7769 flow, removed 258 selfloop flow, removed 0 redundant places. [2025-04-13 20:20:20,664 INFO L231 Difference]: Finished difference. Result has 181 places, 514 transitions, 6668 flow [2025-04-13 20:20:20,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5854, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6668, PETRI_PLACES=181, PETRI_TRANSITIONS=514} [2025-04-13 20:20:20,664 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 137 predicate places. [2025-04-13 20:20:20,665 INFO L485 AbstractCegarLoop]: Abstraction has has 181 places, 514 transitions, 6668 flow [2025-04-13 20:20:20,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20:20,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:20,665 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] [2025-04-13 20:20:20,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 20:20:20,665 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:20:20,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -460167475, now seen corresponding path program 5 times [2025-04-13 20:20:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:20,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032577969] [2025-04-13 20:20:20,666 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:20:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:20,672 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:20:20,683 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:20:20,683 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:20:20,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:20,977 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:20:20,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:20,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032577969] [2025-04-13 20:20:20,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032577969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:20,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550320082] [2025-04-13 20:20:20,977 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:20:20,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:20,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:20:20,980 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:20:20,982 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:20:21,039 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:20:21,058 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:20:21,058 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:20:21,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:21,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:20:21,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:20:21,164 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:20:21,164 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 21 treesize of output 15 [2025-04-13 20:20:21,246 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:20:21,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:20:21,330 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:20:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550320082] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:21,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:20:21,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 19 [2025-04-13 20:20:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716012221] [2025-04-13 20:20:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:21,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:20:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:21,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:20:21,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:20:21,331 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:20:21,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 514 transitions, 6668 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20:21,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:21,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:20:21,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:30,439 INFO L116 PetriNetUnfolderBase]: 67656/87147 cut-off events. [2025-04-13 20:20:30,440 INFO L117 PetriNetUnfolderBase]: For 852560/852560 co-relation queries the response was YES. [2025-04-13 20:20:31,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406003 conditions, 87147 events. 67656/87147 cut-off events. For 852560/852560 co-relation queries the response was YES. Maximal size of possible extension queue 4799. Compared 532811 event pairs, 10997 based on Foata normal form. 1/65760 useless extension candidates. Maximal degree in co-relation 405905. Up to 82325 conditions per place. [2025-04-13 20:20:31,888 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 497 selfloop transitions, 94 changer transitions 4/599 dead transitions. [2025-04-13 20:20:31,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 599 transitions, 8497 flow [2025-04-13 20:20:31,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:20:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:20:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2025-04-13 20:20:31,889 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6515679442508711 [2025-04-13 20:20:31,889 INFO L175 Difference]: Start difference. First operand has 181 places, 514 transitions, 6668 flow. Second operand 7 states and 187 transitions. [2025-04-13 20:20:31,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 599 transitions, 8497 flow [2025-04-13 20:20:39,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 599 transitions, 8056 flow, removed 175 selfloop flow, removed 2 redundant places. [2025-04-13 20:20:39,046 INFO L231 Difference]: Finished difference. Result has 189 places, 533 transitions, 7005 flow [2025-04-13 20:20:39,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6237, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7005, PETRI_PLACES=189, PETRI_TRANSITIONS=533} [2025-04-13 20:20:39,046 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 145 predicate places. [2025-04-13 20:20:39,046 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 533 transitions, 7005 flow [2025-04-13 20:20:39,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20:39,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:39,046 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] [2025-04-13 20:20:39,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:20:39,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:39,247 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:20:39,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1691411955, now seen corresponding path program 6 times [2025-04-13 20:20:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:39,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169760053] [2025-04-13 20:20:39,248 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:20:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:39,254 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:20:39,258 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:20:39,258 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:20:39,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:39,357 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:20:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:39,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169760053] [2025-04-13 20:20:39,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169760053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:20:39,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:20:39,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:20:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071640353] [2025-04-13 20:20:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:39,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:20:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:39,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:20:39,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:20:39,358 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:20:39,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 533 transitions, 7005 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20:39,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:39,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:20:39,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:49,084 INFO L116 PetriNetUnfolderBase]: 69247/89220 cut-off events. [2025-04-13 20:20:49,085 INFO L117 PetriNetUnfolderBase]: For 924773/924773 co-relation queries the response was YES. [2025-04-13 20:20:50,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420358 conditions, 89220 events. 69247/89220 cut-off events. For 924773/924773 co-relation queries the response was YES. Maximal size of possible extension queue 4950. Compared 547019 event pairs, 11384 based on Foata normal form. 1/67352 useless extension candidates. Maximal degree in co-relation 420255. Up to 84458 conditions per place. [2025-04-13 20:20:50,787 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 512 selfloop transitions, 94 changer transitions 4/614 dead transitions. [2025-04-13 20:20:50,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 614 transitions, 8799 flow [2025-04-13 20:20:50,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:20:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:20:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-04-13 20:20:50,788 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6445993031358885 [2025-04-13 20:20:50,788 INFO L175 Difference]: Start difference. First operand has 189 places, 533 transitions, 7005 flow. Second operand 7 states and 185 transitions. [2025-04-13 20:20:50,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 614 transitions, 8799 flow [2025-04-13 20:20:57,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 614 transitions, 8304 flow, removed 163 selfloop flow, removed 4 redundant places. [2025-04-13 20:20:57,035 INFO L231 Difference]: Finished difference. Result has 193 places, 550 transitions, 7163 flow [2025-04-13 20:20:57,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6510, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7163, PETRI_PLACES=193, PETRI_TRANSITIONS=550} [2025-04-13 20:20:57,035 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 149 predicate places. [2025-04-13 20:20:57,035 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 550 transitions, 7163 flow [2025-04-13 20:20:57,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20:57,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:57,036 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] [2025-04-13 20:20:57,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:20:57,036 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:20:57,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:57,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1350487416, now seen corresponding path program 5 times [2025-04-13 20:20:57,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:57,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133225166] [2025-04-13 20:20:57,036 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:20:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:57,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:20:57,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:20:57,049 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:20:57,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:57,376 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:20:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:57,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133225166] [2025-04-13 20:20:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133225166] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:57,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197657468] [2025-04-13 20:20:57,377 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:20:57,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:57,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:20:57,379 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:20:57,381 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:20:57,443 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:20:57,461 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:20:57,461 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:20:57,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:57,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:20:57,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:20:57,547 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:20:57,547 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 21 treesize of output 15 [2025-04-13 20:20:57,614 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:20:57,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:20:57,698 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:20:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197657468] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:57,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:20:57,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 20 [2025-04-13 20:20:57,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859863372] [2025-04-13 20:20:57,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:57,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:20:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:57,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:20:57,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:20:57,699 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:20:57,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 550 transitions, 7163 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20:57,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:57,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:20:57,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:08,127 INFO L116 PetriNetUnfolderBase]: 70666/91060 cut-off events. [2025-04-13 20:21:08,128 INFO L117 PetriNetUnfolderBase]: For 987666/987666 co-relation queries the response was YES. [2025-04-13 20:21:09,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430198 conditions, 91060 events. 70666/91060 cut-off events. For 987666/987666 co-relation queries the response was YES. Maximal size of possible extension queue 5092. Compared 559956 event pairs, 11704 based on Foata normal form. 1/68767 useless extension candidates. Maximal degree in co-relation 430094. Up to 86587 conditions per place. [2025-04-13 20:21:09,999 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 523 selfloop transitions, 94 changer transitions 4/625 dead transitions. [2025-04-13 20:21:09,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 625 transitions, 8986 flow [2025-04-13 20:21:10,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:21:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:21:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2025-04-13 20:21:10,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6236933797909407 [2025-04-13 20:21:10,000 INFO L175 Difference]: Start difference. First operand has 193 places, 550 transitions, 7163 flow. Second operand 7 states and 179 transitions. [2025-04-13 20:21:10,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 625 transitions, 8986 flow [2025-04-13 20:21:17,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 625 transitions, 8537 flow, removed 172 selfloop flow, removed 3 redundant places. [2025-04-13 20:21:17,038 INFO L231 Difference]: Finished difference. Result has 199 places, 568 transitions, 7453 flow [2025-04-13 20:21:17,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6714, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7453, PETRI_PLACES=199, PETRI_TRANSITIONS=568} [2025-04-13 20:21:17,039 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 155 predicate places. [2025-04-13 20:21:17,039 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 568 transitions, 7453 flow [2025-04-13 20:21:17,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:17,039 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] [2025-04-13 20:21:17,046 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:21:17,239 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,SelfDestructingSolverStorable24 [2025-04-13 20:21:17,240 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:17,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash -79036796, now seen corresponding path program 6 times [2025-04-13 20:21:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:17,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257100582] [2025-04-13 20:21:17,240 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:21:17,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:17,246 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:21:17,256 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:21:17,256 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:21:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:17,388 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:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:17,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257100582] [2025-04-13 20:21:17,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257100582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:17,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:17,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:21:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751364123] [2025-04-13 20:21:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:17,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:21:17,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:17,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:21:17,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:21:17,390 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:21:17,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 568 transitions, 7453 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:17,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:17,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:21:17,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:28,178 INFO L116 PetriNetUnfolderBase]: 72015/92811 cut-off events. [2025-04-13 20:21:28,178 INFO L117 PetriNetUnfolderBase]: For 1058218/1058218 co-relation queries the response was YES. [2025-04-13 20:21:29,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443480 conditions, 92811 events. 72015/92811 cut-off events. For 1058218/1058218 co-relation queries the response was YES. Maximal size of possible extension queue 5214. Compared 572783 event pairs, 11988 based on Foata normal form. 1/70106 useless extension candidates. Maximal degree in co-relation 443372. Up to 88276 conditions per place. [2025-04-13 20:21:29,923 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 540 selfloop transitions, 94 changer transitions 4/642 dead transitions. [2025-04-13 20:21:29,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 642 transitions, 9294 flow [2025-04-13 20:21:29,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:21:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:21:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2025-04-13 20:21:29,924 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-04-13 20:21:29,924 INFO L175 Difference]: Start difference. First operand has 199 places, 568 transitions, 7453 flow. Second operand 7 states and 182 transitions. [2025-04-13 20:21:29,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 642 transitions, 9294 flow [2025-04-13 20:21:37,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 642 transitions, 8877 flow, removed 185 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:37,253 INFO L231 Difference]: Finished difference. Result has 206 places, 582 transitions, 7701 flow [2025-04-13 20:21:37,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7036, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7701, PETRI_PLACES=206, PETRI_TRANSITIONS=582} [2025-04-13 20:21:37,254 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 162 predicate places. [2025-04-13 20:21:37,254 INFO L485 AbstractCegarLoop]: Abstraction has has 206 places, 582 transitions, 7701 flow [2025-04-13 20:21:37,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:37,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:37,254 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] [2025-04-13 20:21:37,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 20:21:37,254 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:37,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash -132380044, now seen corresponding path program 5 times [2025-04-13 20:21:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:37,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270413604] [2025-04-13 20:21:37,255 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:21:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:37,260 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:21:37,269 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:21:37,269 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:21:37,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:37,462 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:21:37,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:37,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270413604] [2025-04-13 20:21:37,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270413604] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:37,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965927163] [2025-04-13 20:21:37,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:21:37,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:37,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:37,465 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:21:37,466 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:21:37,525 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:21:37,546 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:21:37,547 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:21:37,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:37,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:21:37,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:21:37,660 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:21:37,660 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 21 treesize of output 15 [2025-04-13 20:21:37,731 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:21:37,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:21:37,819 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:37,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965927163] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:37,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:21:37,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2025-04-13 20:21:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709169866] [2025-04-13 20:21:37,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:37,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:21:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:37,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:21:37,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:21:37,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:21:37,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 582 transitions, 7701 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:37,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:37,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:21:37,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:48,623 INFO L116 PetriNetUnfolderBase]: 73554/94817 cut-off events. [2025-04-13 20:21:48,623 INFO L117 PetriNetUnfolderBase]: For 1142871/1142871 co-relation queries the response was YES. [2025-04-13 20:21:50,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458270 conditions, 94817 events. 73554/94817 cut-off events. For 1142871/1142871 co-relation queries the response was YES. Maximal size of possible extension queue 5340. Compared 587046 event pairs, 12236 based on Foata normal form. 1/71641 useless extension candidates. Maximal degree in co-relation 458159. Up to 90032 conditions per place. [2025-04-13 20:21:50,684 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 562 selfloop transitions, 93 changer transitions 4/663 dead transitions. [2025-04-13 20:21:50,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 663 transitions, 9619 flow [2025-04-13 20:21:50,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:21:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:21:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2025-04-13 20:21:50,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6515679442508711 [2025-04-13 20:21:50,686 INFO L175 Difference]: Start difference. First operand has 206 places, 582 transitions, 7701 flow. Second operand 7 states and 187 transitions. [2025-04-13 20:21:50,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 663 transitions, 9619 flow [2025-04-13 20:21:58,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 663 transitions, 9071 flow, removed 189 selfloop flow, removed 4 redundant places. [2025-04-13 20:21:58,174 INFO L231 Difference]: Finished difference. Result has 210 places, 598 transitions, 7842 flow [2025-04-13 20:21:58,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7153, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7842, PETRI_PLACES=210, PETRI_TRANSITIONS=598} [2025-04-13 20:21:58,175 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 166 predicate places. [2025-04-13 20:21:58,175 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 598 transitions, 7842 flow [2025-04-13 20:21:58,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:58,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:58,175 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] [2025-04-13 20:21:58,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 20:21:58,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:21:58,375 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:58,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash -987335596, now seen corresponding path program 6 times [2025-04-13 20:21:58,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:58,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719874463] [2025-04-13 20:21:58,376 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:21:58,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:58,382 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:21:58,387 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:21:58,387 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:21:58,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:58,457 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:58,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:58,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719874463] [2025-04-13 20:21:58,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719874463] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:58,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:58,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:21:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730696017] [2025-04-13 20:21:58,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:58,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:21:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:58,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:21:58,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:21:58,458 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:21:58,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 598 transitions, 7842 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:58,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:58,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:21:58,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:10,407 INFO L116 PetriNetUnfolderBase]: 75070/96791 cut-off events. [2025-04-13 20:22:10,407 INFO L117 PetriNetUnfolderBase]: For 1220451/1220451 co-relation queries the response was YES. [2025-04-13 20:22:11,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469426 conditions, 96791 events. 75070/96791 cut-off events. For 1220451/1220451 co-relation queries the response was YES. Maximal size of possible extension queue 5481. Compared 600732 event pairs, 12641 based on Foata normal form. 1/73145 useless extension candidates. Maximal degree in co-relation 469314. Up to 92016 conditions per place. [2025-04-13 20:22:12,330 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 575 selfloop transitions, 93 changer transitions 4/676 dead transitions. [2025-04-13 20:22:12,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 676 transitions, 9735 flow [2025-04-13 20:22:12,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:22:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:22:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-04-13 20:22:12,333 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6480836236933798 [2025-04-13 20:22:12,333 INFO L175 Difference]: Start difference. First operand has 210 places, 598 transitions, 7842 flow. Second operand 7 states and 186 transitions. [2025-04-13 20:22:12,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 676 transitions, 9735 flow [2025-04-13 20:22:20,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 676 transitions, 9137 flow, removed 186 selfloop flow, removed 6 redundant places. [2025-04-13 20:22:20,256 INFO L231 Difference]: Finished difference. Result has 212 places, 612 transitions, 7881 flow [2025-04-13 20:22:20,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7244, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7881, PETRI_PLACES=212, PETRI_TRANSITIONS=612} [2025-04-13 20:22:20,256 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 168 predicate places. [2025-04-13 20:22:20,256 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 612 transitions, 7881 flow [2025-04-13 20:22:20,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:20,257 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] [2025-04-13 20:22:20,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 20:22:20,257 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:22:20,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash 240897913, now seen corresponding path program 5 times [2025-04-13 20:22:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:20,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627360918] [2025-04-13 20:22:20,258 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:22:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:20,263 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:22:20,271 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:22:20,271 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:22:20,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:20,596 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:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:20,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627360918] [2025-04-13 20:22:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627360918] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:20,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23372375] [2025-04-13 20:22:20,597 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:22:20,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:22:20,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:20,599 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:20,600 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:20,660 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:22:20,678 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:22:20,678 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:22:20,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:20,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:22:20,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:22:20,762 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:22:20,762 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 21 treesize of output 15 [2025-04-13 20:22:20,824 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:20,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:22:20,901 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:20,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23372375] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:20,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:22:20,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 19 [2025-04-13 20:22:20,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201502607] [2025-04-13 20:22:20,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:20,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:22:20,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:20,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:22:20,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:22:20,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:22:20,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 612 transitions, 7881 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:20,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:20,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:22:20,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:32,677 INFO L116 PetriNetUnfolderBase]: 76276/98355 cut-off events. [2025-04-13 20:22:32,677 INFO L117 PetriNetUnfolderBase]: For 1287241/1287241 co-relation queries the response was YES. [2025-04-13 20:22:34,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477125 conditions, 98355 events. 76276/98355 cut-off events. For 1287241/1287241 co-relation queries the response was YES. Maximal size of possible extension queue 5595. Compared 612680 event pairs, 12945 based on Foata normal form. 1/74320 useless extension candidates. Maximal degree in co-relation 477014. Up to 93857 conditions per place. [2025-04-13 20:22:34,625 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 582 selfloop transitions, 93 changer transitions 4/683 dead transitions. [2025-04-13 20:22:34,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 683 transitions, 9769 flow [2025-04-13 20:22:34,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:22:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:22:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2025-04-13 20:22:34,626 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-04-13 20:22:34,626 INFO L175 Difference]: Start difference. First operand has 212 places, 612 transitions, 7881 flow. Second operand 7 states and 182 transitions. [2025-04-13 20:22:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 683 transitions, 9769 flow [2025-04-13 20:22:43,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 683 transitions, 9241 flow, removed 174 selfloop flow, removed 5 redundant places. [2025-04-13 20:22:43,886 INFO L231 Difference]: Finished difference. Result has 215 places, 623 transitions, 7974 flow [2025-04-13 20:22:43,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7353, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7974, PETRI_PLACES=215, PETRI_TRANSITIONS=623} [2025-04-13 20:22:43,887 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 171 predicate places. [2025-04-13 20:22:43,887 INFO L485 AbstractCegarLoop]: Abstraction has has 215 places, 623 transitions, 7974 flow [2025-04-13 20:22:43,887 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:43,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:43,887 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] [2025-04-13 20:22:43,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:22:44,088 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,SelfDestructingSolverStorable28 [2025-04-13 20:22:44,088 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:22:44,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash 478707577, now seen corresponding path program 6 times [2025-04-13 20:22:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:44,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241117212] [2025-04-13 20:22:44,088 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:22:44,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:44,094 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:22:44,099 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 20:22:44,099 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:22:44,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:44,179 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:44,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:44,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241117212] [2025-04-13 20:22:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241117212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:44,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:44,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:22:44,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287865201] [2025-04-13 20:22:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:44,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:22:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:44,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:22:44,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:22:44,180 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:22:44,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 623 transitions, 7974 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:44,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:44,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:22:44,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:55,693 INFO L116 PetriNetUnfolderBase]: 77575/100039 cut-off events. [2025-04-13 20:22:55,693 INFO L117 PetriNetUnfolderBase]: For 1360578/1360578 co-relation queries the response was YES. [2025-04-13 20:22:57,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486371 conditions, 100039 events. 77575/100039 cut-off events. For 1360578/1360578 co-relation queries the response was YES. Maximal size of possible extension queue 5678. Compared 624134 event pairs, 13315 based on Foata normal form. 1/75600 useless extension candidates. Maximal degree in co-relation 486258. Up to 95553 conditions per place. [2025-04-13 20:22:57,655 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 594 selfloop transitions, 93 changer transitions 4/695 dead transitions. [2025-04-13 20:22:57,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 695 transitions, 9934 flow [2025-04-13 20:22:57,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:22:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:22:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-04-13 20:22:57,656 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.627177700348432 [2025-04-13 20:22:57,656 INFO L175 Difference]: Start difference. First operand has 215 places, 623 transitions, 7974 flow. Second operand 7 states and 180 transitions. [2025-04-13 20:22:57,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 695 transitions, 9934 flow [2025-04-13 20:23:06,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 695 transitions, 9353 flow, removed 195 selfloop flow, removed 5 redundant places. [2025-04-13 20:23:06,320 INFO L231 Difference]: Finished difference. Result has 218 places, 637 transitions, 8074 flow [2025-04-13 20:23:06,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7393, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8074, PETRI_PLACES=218, PETRI_TRANSITIONS=637} [2025-04-13 20:23:06,320 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 174 predicate places. [2025-04-13 20:23:06,320 INFO L485 AbstractCegarLoop]: Abstraction has has 218 places, 637 transitions, 8074 flow [2025-04-13 20:23:06,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:06,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:06,321 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] [2025-04-13 20:23:06,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:23:06,321 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:23:06,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash -995691804, now seen corresponding path program 1 times [2025-04-13 20:23:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:06,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930798746] [2025-04-13 20:23:06,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:06,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:23:06,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:23:06,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:06,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:06,385 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:06,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:06,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930798746] [2025-04-13 20:23:06,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930798746] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:06,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693444269] [2025-04-13 20:23:06,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:06,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:06,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:06,387 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:23:06,388 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:23:06,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:23:06,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:23:06,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:06,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:06,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:23:06,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:06,540 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:06,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:06,594 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:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693444269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:06,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 20:23:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117672817] [2025-04-13 20:23:06,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:06,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:23:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:06,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:23:06,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:23:06,596 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:23:06,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 637 transitions, 8074 flow. Second operand has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 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:06,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:06,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:23:06,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand