/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:39:09,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:39:09,964 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-14 00:39:09,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:39:09,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:39:09,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:39:09,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:39:09,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:39:09,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:39:09,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:39:09,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:39:09,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:39:09,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:39:09,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:39:09,982 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:39:09,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:39:09,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:39:09,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:39:09,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:39:09,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:39:09,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:39:09,984 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:39:10,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:39:10,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:39:10,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:39:10,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:39:10,211 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:39:10,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2025-04-14 00:39:11,520 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c895aa025/a526549c23b24c93a070e34932311468/FLAGe0a425bc4 [2025-04-14 00:39:11,710 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:39:11,710 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2025-04-14 00:39:11,717 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c895aa025/a526549c23b24c93a070e34932311468/FLAGe0a425bc4 [2025-04-14 00:39:12,722 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c895aa025/a526549c23b24c93a070e34932311468 [2025-04-14 00:39:12,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:39:12,725 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:39:12,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:39:12,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:39:12,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:39:12,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:12,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1eac4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12, skipping insertion in model container [2025-04-14 00:39:12,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:12,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:39:12,903 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/chl-nzb-file-trans.wvr.c[6489,6502] [2025-04-14 00:39:12,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:39:12,919 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:39:12,950 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/chl-nzb-file-trans.wvr.c[6489,6502] [2025-04-14 00:39:12,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:39:12,965 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:39:12,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12 WrapperNode [2025-04-14 00:39:12,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:39:12,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:39:12,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:39:12,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:39:12,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:12,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,012 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-04-14 00:39:13,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:39:13,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:39:13,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:39:13,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:39:13,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,053 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-14 00:39:13,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:39:13,075 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:39:13,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:39:13,075 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:39:13,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (1/1) ... [2025-04-14 00:39:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:39:13,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:13,097 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-14 00:39:13,100 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-14 00:39:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:39:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:39:13,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:39:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:39:13,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:39:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:39:13,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:39:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:39:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:39:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:39:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:39:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:39:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:39:13,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:39:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:39:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:39:13,119 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:39:13,221 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:39:13,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:39:13,806 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:39:13,807 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:39:13,808 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:39:14,640 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:39:14,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:39:14 BoogieIcfgContainer [2025-04-14 00:39:14,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:39:14,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:39:14,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:39:14,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:39:14,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:39:12" (1/3) ... [2025-04-14 00:39:14,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f03bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:39:14, skipping insertion in model container [2025-04-14 00:39:14,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:12" (2/3) ... [2025-04-14 00:39:14,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f03bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:39:14, skipping insertion in model container [2025-04-14 00:39:14,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:39:14" (3/3) ... [2025-04-14 00:39:14,647 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2025-04-14 00:39:14,658 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:39:14,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-trans.wvr.c that has 4 procedures, 25 locations, 30 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:39:14,659 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:39:14,764 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:39:14,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 87 flow [2025-04-14 00:39:14,821 INFO L116 PetriNetUnfolderBase]: 9/30 cut-off events. [2025-04-14 00:39:14,823 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:39:14,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 9/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-14 00:39:14,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 87 flow [2025-04-14 00:39:14,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 29 transitions, 76 flow [2025-04-14 00:39:14,835 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:39:14,842 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;@d494c25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:39:14,842 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:39:14,861 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:39:14,861 INFO L116 PetriNetUnfolderBase]: 9/28 cut-off events. [2025-04-14 00:39:14,861 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:39:14,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:14,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:14,862 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 1 more)] === [2025-04-14 00:39:14,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2079547387, now seen corresponding path program 1 times [2025-04-14 00:39:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:14,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559868807] [2025-04-14 00:39:14,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:14,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:39:15,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:39:15,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:15,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:15,216 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-14 00:39:15,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:15,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559868807] [2025-04-14 00:39:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559868807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:15,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:39:15,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165236825] [2025-04-14 00:39:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:15,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:39:15,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:15,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:39:15,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:39:15,243 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:15,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-14 00:39:15,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:15,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:15,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:15,483 INFO L116 PetriNetUnfolderBase]: 277/376 cut-off events. [2025-04-14 00:39:15,483 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-14 00:39:15,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 376 events. 277/376 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 815 event pairs, 124 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 670. Up to 374 conditions per place. [2025-04-14 00:39:15,488 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 26 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2025-04-14 00:39:15,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 146 flow [2025-04-14 00:39:15,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:39:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:39:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-14 00:39:15,497 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 00:39:15,498 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 76 flow. Second operand 3 states and 44 transitions. [2025-04-14 00:39:15,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 146 flow [2025-04-14 00:39:15,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:39:15,505 INFO L231 Difference]: Finished difference. Result has 27 places, 32 transitions, 96 flow [2025-04-14 00:39:15,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=27, PETRI_TRANSITIONS=32} [2025-04-14 00:39:15,508 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-14 00:39:15,509 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 32 transitions, 96 flow [2025-04-14 00:39:15,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-14 00:39:15,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:15,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:15,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:39:15,510 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 1 more)] === [2025-04-14 00:39:15,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash -235870830, now seen corresponding path program 1 times [2025-04-14 00:39:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:15,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997677408] [2025-04-14 00:39:15,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:15,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:15,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:39:15,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:39:15,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:15,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:39:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:15,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997677408] [2025-04-14 00:39:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997677408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:15,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865260392] [2025-04-14 00:39:15,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:15,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:15,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:15,766 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-14 00:39:15,767 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-14 00:39:15,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:39:15,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:39:15,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:15,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:15,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:39:15,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:39:15,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:39:16,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865260392] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:16,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-14 00:39:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017855028] [2025-04-14 00:39:16,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:16,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:39:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:39:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:39:16,022 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:16,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 32 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-14 00:39:16,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:16,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:16,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:16,222 INFO L116 PetriNetUnfolderBase]: 277/385 cut-off events. [2025-04-14 00:39:16,223 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:39:16,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 385 events. 277/385 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 815 event pairs, 124 based on Foata normal form. 6/240 useless extension candidates. Maximal degree in co-relation 760. Up to 374 conditions per place. [2025-04-14 00:39:16,225 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 26 selfloop transitions, 15 changer transitions 0/41 dead transitions. [2025-04-14 00:39:16,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 214 flow [2025-04-14 00:39:16,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:39:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:39:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-14 00:39:16,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-04-14 00:39:16,226 INFO L175 Difference]: Start difference. First operand has 27 places, 32 transitions, 96 flow. Second operand 6 states and 68 transitions. [2025-04-14 00:39:16,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 214 flow [2025-04-14 00:39:16,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:39:16,227 INFO L231 Difference]: Finished difference. Result has 34 places, 41 transitions, 186 flow [2025-04-14 00:39:16,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=34, PETRI_TRANSITIONS=41} [2025-04-14 00:39:16,228 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2025-04-14 00:39:16,228 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 41 transitions, 186 flow [2025-04-14 00:39:16,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-14 00:39:16,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:16,228 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:16,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:39:16,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:16,429 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 1 more)] === [2025-04-14 00:39:16,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash -357615943, now seen corresponding path program 2 times [2025-04-14 00:39:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:16,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3297072] [2025-04-14 00:39:16,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:16,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:39:16,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-14 00:39:16,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:39:16,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:39:16,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:16,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3297072] [2025-04-14 00:39:16,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3297072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:16,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:16,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:16,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217410277] [2025-04-14 00:39:16,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:16,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:16,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:16,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:16,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:16,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:16,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 41 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:16,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:16,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:16,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:17,422 INFO L116 PetriNetUnfolderBase]: 522/741 cut-off events. [2025-04-14 00:39:17,422 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-14 00:39:17,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 741 events. 522/741 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2340 event pairs, 99 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 1474. Up to 354 conditions per place. [2025-04-14 00:39:17,426 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 68 selfloop transitions, 14 changer transitions 1/83 dead transitions. [2025-04-14 00:39:17,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 83 transitions, 448 flow [2025-04-14 00:39:17,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:39:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:39:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-14 00:39:17,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-04-14 00:39:17,427 INFO L175 Difference]: Start difference. First operand has 34 places, 41 transitions, 186 flow. Second operand 5 states and 87 transitions. [2025-04-14 00:39:17,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 83 transitions, 448 flow [2025-04-14 00:39:17,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 83 transitions, 424 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-14 00:39:17,430 INFO L231 Difference]: Finished difference. Result has 41 places, 55 transitions, 268 flow [2025-04-14 00:39:17,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=41, PETRI_TRANSITIONS=55} [2025-04-14 00:39:17,430 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2025-04-14 00:39:17,430 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 55 transitions, 268 flow [2025-04-14 00:39:17,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:17,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:17,430 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:17,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:39:17,431 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 1 more)] === [2025-04-14 00:39:17,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1546284113, now seen corresponding path program 3 times [2025-04-14 00:39:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:17,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396368557] [2025-04-14 00:39:17,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:39:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:17,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:39:17,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-14 00:39:17,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:39:17,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:39:17,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:17,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396368557] [2025-04-14 00:39:17,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396368557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:17,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:17,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:17,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504747384] [2025-04-14 00:39:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:17,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:17,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:17,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:17,870 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:17,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 55 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:17,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:17,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:17,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:18,457 INFO L116 PetriNetUnfolderBase]: 1258/1763 cut-off events. [2025-04-14 00:39:18,457 INFO L117 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2025-04-14 00:39:18,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 1763 events. 1258/1763 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6751 event pairs, 100 based on Foata normal form. 1/1147 useless extension candidates. Maximal degree in co-relation 4975. Up to 650 conditions per place. [2025-04-14 00:39:18,465 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 97 selfloop transitions, 40 changer transitions 1/138 dead transitions. [2025-04-14 00:39:18,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 138 transitions, 862 flow [2025-04-14 00:39:18,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:39:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:39:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-04-14 00:39:18,466 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2025-04-14 00:39:18,466 INFO L175 Difference]: Start difference. First operand has 41 places, 55 transitions, 268 flow. Second operand 6 states and 115 transitions. [2025-04-14 00:39:18,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 138 transitions, 862 flow [2025-04-14 00:39:18,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 138 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:39:18,475 INFO L231 Difference]: Finished difference. Result has 51 places, 93 transitions, 622 flow [2025-04-14 00:39:18,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=51, PETRI_TRANSITIONS=93} [2025-04-14 00:39:18,477 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-04-14 00:39:18,477 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 93 transitions, 622 flow [2025-04-14 00:39:18,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:18,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:18,477 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:18,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:39:18,478 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 1 more)] === [2025-04-14 00:39:18,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1456413225, now seen corresponding path program 4 times [2025-04-14 00:39:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:18,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170127204] [2025-04-14 00:39:18,478 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:39:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:18,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:39:18,509 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:39:18,509 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:39:18,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:39:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:18,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170127204] [2025-04-14 00:39:18,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170127204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:18,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284964425] [2025-04-14 00:39:18,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:39:18,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:18,629 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-14 00:39:18,630 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-14 00:39:18,772 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:39:18,807 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:39:18,807 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:39:18,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:18,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:39:18,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:39:18,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:39:18,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284964425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:18,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:18,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-14 00:39:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026268701] [2025-04-14 00:39:18,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:18,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:39:18,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:18,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:39:18,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:39:18,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:18,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 93 transitions, 622 flow. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-14 00:39:18,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:18,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:18,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:19,357 INFO L116 PetriNetUnfolderBase]: 1258/1766 cut-off events. [2025-04-14 00:39:19,358 INFO L117 PetriNetUnfolderBase]: For 2848/2848 co-relation queries the response was YES. [2025-04-14 00:39:19,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6894 conditions, 1766 events. 1258/1766 cut-off events. For 2848/2848 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6634 event pairs, 355 based on Foata normal form. 1/1281 useless extension candidates. Maximal degree in co-relation 6797. Up to 1752 conditions per place. [2025-04-14 00:39:19,366 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 78 selfloop transitions, 18 changer transitions 0/96 dead transitions. [2025-04-14 00:39:19,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 832 flow [2025-04-14 00:39:19,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:39:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:39:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2025-04-14 00:39:19,367 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2943722943722944 [2025-04-14 00:39:19,367 INFO L175 Difference]: Start difference. First operand has 51 places, 93 transitions, 622 flow. Second operand 7 states and 68 transitions. [2025-04-14 00:39:19,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 832 flow [2025-04-14 00:39:19,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 824 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-14 00:39:19,377 INFO L231 Difference]: Finished difference. Result has 58 places, 96 transitions, 682 flow [2025-04-14 00:39:19,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=682, PETRI_PLACES=58, PETRI_TRANSITIONS=96} [2025-04-14 00:39:19,378 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-04-14 00:39:19,378 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 96 transitions, 682 flow [2025-04-14 00:39:19,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-14 00:39:19,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:19,378 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:19,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:39:19,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:19,582 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 1 more)] === [2025-04-14 00:39:19,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1470382058, now seen corresponding path program 5 times [2025-04-14 00:39:19,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:19,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461005483] [2025-04-14 00:39:19,582 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:39:19,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:19,601 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-14 00:39:19,660 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:39:19,660 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:39:19,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:20,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:20,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461005483] [2025-04-14 00:39:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461005483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:20,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004038905] [2025-04-14 00:39:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:20,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:20,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:20,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:20,202 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:20,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 96 transitions, 682 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:20,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:20,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:20,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:20,864 INFO L116 PetriNetUnfolderBase]: 1513/2159 cut-off events. [2025-04-14 00:39:20,864 INFO L117 PetriNetUnfolderBase]: For 2843/2843 co-relation queries the response was YES. [2025-04-14 00:39:20,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8213 conditions, 2159 events. 1513/2159 cut-off events. For 2843/2843 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 8893 event pairs, 204 based on Foata normal form. 1/1547 useless extension candidates. Maximal degree in co-relation 8095. Up to 1095 conditions per place. [2025-04-14 00:39:20,874 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 119 selfloop transitions, 42 changer transitions 2/163 dead transitions. [2025-04-14 00:39:20,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 163 transitions, 1404 flow [2025-04-14 00:39:20,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:39:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:39:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-04-14 00:39:20,876 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2025-04-14 00:39:20,876 INFO L175 Difference]: Start difference. First operand has 58 places, 96 transitions, 682 flow. Second operand 5 states and 89 transitions. [2025-04-14 00:39:20,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 163 transitions, 1404 flow [2025-04-14 00:39:20,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 163 transitions, 1368 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-14 00:39:20,883 INFO L231 Difference]: Finished difference. Result has 62 places, 122 transitions, 1052 flow [2025-04-14 00:39:20,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1052, PETRI_PLACES=62, PETRI_TRANSITIONS=122} [2025-04-14 00:39:20,883 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2025-04-14 00:39:20,884 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 122 transitions, 1052 flow [2025-04-14 00:39:20,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:20,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:20,884 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:20,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:39:20,884 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 1 more)] === [2025-04-14 00:39:20,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1623243520, now seen corresponding path program 6 times [2025-04-14 00:39:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:20,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249235809] [2025-04-14 00:39:20,885 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:39:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:20,900 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-04-14 00:39:20,909 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-14 00:39:20,909 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:39:20,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:21,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:21,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249235809] [2025-04-14 00:39:21,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249235809] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:21,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:21,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898279488] [2025-04-14 00:39:21,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:21,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:21,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:21,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:21,166 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:21,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 122 transitions, 1052 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:21,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:21,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:21,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:21,928 INFO L116 PetriNetUnfolderBase]: 1591/2271 cut-off events. [2025-04-14 00:39:21,928 INFO L117 PetriNetUnfolderBase]: For 5369/5369 co-relation queries the response was YES. [2025-04-14 00:39:21,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9976 conditions, 2271 events. 1591/2271 cut-off events. For 5369/5369 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 9414 event pairs, 200 based on Foata normal form. 1/1631 useless extension candidates. Maximal degree in co-relation 9872. Up to 1108 conditions per place. [2025-04-14 00:39:21,978 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 124 selfloop transitions, 34 changer transitions 1/159 dead transitions. [2025-04-14 00:39:21,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 159 transitions, 1583 flow [2025-04-14 00:39:21,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:39:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:39:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-14 00:39:21,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-04-14 00:39:21,979 INFO L175 Difference]: Start difference. First operand has 62 places, 122 transitions, 1052 flow. Second operand 5 states and 87 transitions. [2025-04-14 00:39:21,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 159 transitions, 1583 flow [2025-04-14 00:39:21,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 159 transitions, 1569 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-04-14 00:39:21,993 INFO L231 Difference]: Finished difference. Result has 69 places, 133 transitions, 1267 flow [2025-04-14 00:39:21,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1267, PETRI_PLACES=69, PETRI_TRANSITIONS=133} [2025-04-14 00:39:21,994 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2025-04-14 00:39:21,994 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 133 transitions, 1267 flow [2025-04-14 00:39:21,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:21,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:21,994 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:21,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:39:21,994 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 1 more)] === [2025-04-14 00:39:21,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1861598646, now seen corresponding path program 7 times [2025-04-14 00:39:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:21,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778073982] [2025-04-14 00:39:21,995 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:39:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:22,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 00:39:22,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:39:22,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:22,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:22,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778073982] [2025-04-14 00:39:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778073982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:22,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:22,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61577967] [2025-04-14 00:39:22,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:22,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:22,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:22,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:22,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:22,410 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:22,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 133 transitions, 1267 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:22,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:22,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:22,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:23,031 INFO L116 PetriNetUnfolderBase]: 1723/2495 cut-off events. [2025-04-14 00:39:23,031 INFO L117 PetriNetUnfolderBase]: For 7858/7858 co-relation queries the response was YES. [2025-04-14 00:39:23,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11841 conditions, 2495 events. 1723/2495 cut-off events. For 7858/7858 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 10873 event pairs, 419 based on Foata normal form. 1/1780 useless extension candidates. Maximal degree in co-relation 11733. Up to 1823 conditions per place. [2025-04-14 00:39:23,046 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 158 selfloop transitions, 31 changer transitions 2/191 dead transitions. [2025-04-14 00:39:23,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 191 transitions, 2105 flow [2025-04-14 00:39:23,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:39:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:39:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-14 00:39:23,047 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2025-04-14 00:39:23,047 INFO L175 Difference]: Start difference. First operand has 69 places, 133 transitions, 1267 flow. Second operand 5 states and 83 transitions. [2025-04-14 00:39:23,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 191 transitions, 2105 flow [2025-04-14 00:39:23,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 191 transitions, 2013 flow, removed 27 selfloop flow, removed 1 redundant places. [2025-04-14 00:39:23,072 INFO L231 Difference]: Finished difference. Result has 75 places, 150 transitions, 1541 flow [2025-04-14 00:39:23,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1541, PETRI_PLACES=75, PETRI_TRANSITIONS=150} [2025-04-14 00:39:23,073 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2025-04-14 00:39:23,073 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 150 transitions, 1541 flow [2025-04-14 00:39:23,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:23,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:23,073 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:23,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:39:23,073 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 1 more)] === [2025-04-14 00:39:23,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1567798628, now seen corresponding path program 8 times [2025-04-14 00:39:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:23,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133894007] [2025-04-14 00:39:23,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:23,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-14 00:39:23,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-14 00:39:23,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:39:23,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:23,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133894007] [2025-04-14 00:39:23,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133894007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:23,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:23,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:23,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688677270] [2025-04-14 00:39:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:23,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:23,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:23,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:23,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:23,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:23,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 150 transitions, 1541 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:23,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:23,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:23,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:24,198 INFO L116 PetriNetUnfolderBase]: 2009/2909 cut-off events. [2025-04-14 00:39:24,199 INFO L117 PetriNetUnfolderBase]: For 9808/9808 co-relation queries the response was YES. [2025-04-14 00:39:24,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13826 conditions, 2909 events. 2009/2909 cut-off events. For 9808/9808 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 13327 event pairs, 129 based on Foata normal form. 1/2061 useless extension candidates. Maximal degree in co-relation 13715. Up to 1160 conditions per place. [2025-04-14 00:39:24,213 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 156 selfloop transitions, 105 changer transitions 2/263 dead transitions. [2025-04-14 00:39:24,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 263 transitions, 2970 flow [2025-04-14 00:39:24,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:39:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:39:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-04-14 00:39:24,214 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.601010101010101 [2025-04-14 00:39:24,214 INFO L175 Difference]: Start difference. First operand has 75 places, 150 transitions, 1541 flow. Second operand 6 states and 119 transitions. [2025-04-14 00:39:24,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 263 transitions, 2970 flow [2025-04-14 00:39:24,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 263 transitions, 2946 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 00:39:24,246 INFO L231 Difference]: Finished difference. Result has 83 places, 198 transitions, 2455 flow [2025-04-14 00:39:24,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2455, PETRI_PLACES=83, PETRI_TRANSITIONS=198} [2025-04-14 00:39:24,247 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2025-04-14 00:39:24,247 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 198 transitions, 2455 flow [2025-04-14 00:39:24,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-14 00:39:24,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:24,247 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:24,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:39:24,247 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 1 more)] === [2025-04-14 00:39:24,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1486756302, now seen corresponding path program 1 times [2025-04-14 00:39:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:24,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317714800] [2025-04-14 00:39:24,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:24,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:39:24,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:39:24,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:24,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:24,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317714800] [2025-04-14 00:39:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317714800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:24,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33789347] [2025-04-14 00:39:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:24,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:39:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:24,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:39:24,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:39:24,359 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:24,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 198 transitions, 2455 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:24,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:24,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:24,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:24,988 INFO L116 PetriNetUnfolderBase]: 2052/2986 cut-off events. [2025-04-14 00:39:24,988 INFO L117 PetriNetUnfolderBase]: For 13260/13260 co-relation queries the response was YES. [2025-04-14 00:39:24,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16289 conditions, 2986 events. 2052/2986 cut-off events. For 13260/13260 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 13746 event pairs, 196 based on Foata normal form. 3/2114 useless extension candidates. Maximal degree in co-relation 16174. Up to 2436 conditions per place. [2025-04-14 00:39:24,999 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 192 selfloop transitions, 15 changer transitions 39/246 dead transitions. [2025-04-14 00:39:24,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 246 transitions, 3452 flow [2025-04-14 00:39:25,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:39:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:39:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-14 00:39:25,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-04-14 00:39:25,000 INFO L175 Difference]: Start difference. First operand has 83 places, 198 transitions, 2455 flow. Second operand 4 states and 71 transitions. [2025-04-14 00:39:25,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 246 transitions, 3452 flow [2025-04-14 00:39:25,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 246 transitions, 3376 flow, removed 38 selfloop flow, removed 0 redundant places. [2025-04-14 00:39:25,045 INFO L231 Difference]: Finished difference. Result has 89 places, 185 transitions, 2301 flow [2025-04-14 00:39:25,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2301, PETRI_PLACES=89, PETRI_TRANSITIONS=185} [2025-04-14 00:39:25,046 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2025-04-14 00:39:25,046 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 185 transitions, 2301 flow [2025-04-14 00:39:25,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:25,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:25,046 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:25,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:39:25,046 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 1 more)] === [2025-04-14 00:39:25,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:25,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1446133202, now seen corresponding path program 1 times [2025-04-14 00:39:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:25,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858664580] [2025-04-14 00:39:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:25,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:39:25,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:39:25,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:25,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:25,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858664580] [2025-04-14 00:39:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858664580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:25,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315641386] [2025-04-14 00:39:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:25,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:39:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:25,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:39:25,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:39:25,176 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:25,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 185 transitions, 2301 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:25,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:25,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:25,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:25,773 INFO L116 PetriNetUnfolderBase]: 1963/2885 cut-off events. [2025-04-14 00:39:25,774 INFO L117 PetriNetUnfolderBase]: For 12617/12617 co-relation queries the response was YES. [2025-04-14 00:39:25,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15428 conditions, 2885 events. 1963/2885 cut-off events. For 12617/12617 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 13475 event pairs, 136 based on Foata normal form. 5/2025 useless extension candidates. Maximal degree in co-relation 15310. Up to 2331 conditions per place. [2025-04-14 00:39:25,786 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 181 selfloop transitions, 16 changer transitions 37/234 dead transitions. [2025-04-14 00:39:25,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 234 transitions, 3257 flow [2025-04-14 00:39:25,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:39:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:39:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-14 00:39:25,787 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2025-04-14 00:39:25,787 INFO L175 Difference]: Start difference. First operand has 89 places, 185 transitions, 2301 flow. Second operand 4 states and 67 transitions. [2025-04-14 00:39:25,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 234 transitions, 3257 flow [2025-04-14 00:39:25,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 234 transitions, 3206 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-04-14 00:39:25,828 INFO L231 Difference]: Finished difference. Result has 91 places, 178 transitions, 2232 flow [2025-04-14 00:39:25,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2232, PETRI_PLACES=91, PETRI_TRANSITIONS=178} [2025-04-14 00:39:25,828 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2025-04-14 00:39:25,829 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 178 transitions, 2232 flow [2025-04-14 00:39:25,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:25,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:25,829 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:25,829 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:39:25,829 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 1 more)] === [2025-04-14 00:39:25,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash 643376978, now seen corresponding path program 1 times [2025-04-14 00:39:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:25,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471001487] [2025-04-14 00:39:25,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:25,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:39:25,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:39:25,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:25,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:25,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471001487] [2025-04-14 00:39:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471001487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673923910] [2025-04-14 00:39:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:25,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:25,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:25,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:25,996 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:25,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 178 transitions, 2232 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-14 00:39:25,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:25,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:25,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:26,658 INFO L116 PetriNetUnfolderBase]: 1878/2798 cut-off events. [2025-04-14 00:39:26,658 INFO L117 PetriNetUnfolderBase]: For 11709/11709 co-relation queries the response was YES. [2025-04-14 00:39:26,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14920 conditions, 2798 events. 1878/2798 cut-off events. For 11709/11709 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 13308 event pairs, 155 based on Foata normal form. 5/1951 useless extension candidates. Maximal degree in co-relation 14802. Up to 1010 conditions per place. [2025-04-14 00:39:26,671 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 173 selfloop transitions, 48 changer transitions 51/272 dead transitions. [2025-04-14 00:39:26,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 272 transitions, 3514 flow [2025-04-14 00:39:26,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:39:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:39:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-04-14 00:39:26,672 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-14 00:39:26,672 INFO L175 Difference]: Start difference. First operand has 91 places, 178 transitions, 2232 flow. Second operand 6 states and 110 transitions. [2025-04-14 00:39:26,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 272 transitions, 3514 flow [2025-04-14 00:39:26,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 272 transitions, 3472 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-04-14 00:39:26,709 INFO L231 Difference]: Finished difference. Result has 96 places, 161 transitions, 1989 flow [2025-04-14 00:39:26,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1989, PETRI_PLACES=96, PETRI_TRANSITIONS=161} [2025-04-14 00:39:26,710 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2025-04-14 00:39:26,710 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 161 transitions, 1989 flow [2025-04-14 00:39:26,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-14 00:39:26,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:26,711 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:26,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:39:26,711 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 1 more)] === [2025-04-14 00:39:26,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash 389086508, now seen corresponding path program 2 times [2025-04-14 00:39:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:26,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474453643] [2025-04-14 00:39:26,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:26,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:26,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:39:26,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-14 00:39:26,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:39:26,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:26,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474453643] [2025-04-14 00:39:26,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474453643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:26,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759017275] [2025-04-14 00:39:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:26,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:39:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:26,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:39:26,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:39:26,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:26,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 161 transitions, 1989 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:26,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:26,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:26,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:27,342 INFO L116 PetriNetUnfolderBase]: 1644/2448 cut-off events. [2025-04-14 00:39:27,343 INFO L117 PetriNetUnfolderBase]: For 11049/11049 co-relation queries the response was YES. [2025-04-14 00:39:27,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13408 conditions, 2448 events. 1644/2448 cut-off events. For 11049/11049 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11198 event pairs, 378 based on Foata normal form. 6/1696 useless extension candidates. Maximal degree in co-relation 13370. Up to 2024 conditions per place. [2025-04-14 00:39:27,353 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 147 selfloop transitions, 4 changer transitions 40/191 dead transitions. [2025-04-14 00:39:27,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 191 transitions, 2606 flow [2025-04-14 00:39:27,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:39:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:39:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-04-14 00:39:27,354 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-04-14 00:39:27,354 INFO L175 Difference]: Start difference. First operand has 96 places, 161 transitions, 1989 flow. Second operand 4 states and 63 transitions. [2025-04-14 00:39:27,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 191 transitions, 2606 flow [2025-04-14 00:39:27,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 191 transitions, 2492 flow, removed 45 selfloop flow, removed 5 redundant places. [2025-04-14 00:39:27,383 INFO L231 Difference]: Finished difference. Result has 93 places, 144 transitions, 1616 flow [2025-04-14 00:39:27,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1616, PETRI_PLACES=93, PETRI_TRANSITIONS=144} [2025-04-14 00:39:27,384 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-04-14 00:39:27,384 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 144 transitions, 1616 flow [2025-04-14 00:39:27,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:27,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:27,384 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:27,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:39:27,385 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 1 more)] === [2025-04-14 00:39:27,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1522800714, now seen corresponding path program 2 times [2025-04-14 00:39:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:27,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457880347] [2025-04-14 00:39:27,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:27,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:39:27,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-14 00:39:27,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:39:27,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:27,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457880347] [2025-04-14 00:39:27,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457880347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:27,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70286658] [2025-04-14 00:39:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:27,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:39:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:27,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:39:27,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:39:27,466 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:27,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 144 transitions, 1616 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:27,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:27,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:27,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:27,994 INFO L116 PetriNetUnfolderBase]: 1467/2160 cut-off events. [2025-04-14 00:39:27,994 INFO L117 PetriNetUnfolderBase]: For 8676/8676 co-relation queries the response was YES. [2025-04-14 00:39:28,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11371 conditions, 2160 events. 1467/2160 cut-off events. For 8676/8676 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9312 event pairs, 342 based on Foata normal form. 5/1499 useless extension candidates. Maximal degree in co-relation 11335. Up to 1817 conditions per place. [2025-04-14 00:39:28,005 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 131 selfloop transitions, 5 changer transitions 43/179 dead transitions. [2025-04-14 00:39:28,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 179 transitions, 2292 flow [2025-04-14 00:39:28,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:39:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:39:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-14 00:39:28,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2025-04-14 00:39:28,007 INFO L175 Difference]: Start difference. First operand has 93 places, 144 transitions, 1616 flow. Second operand 4 states and 67 transitions. [2025-04-14 00:39:28,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 179 transitions, 2292 flow [2025-04-14 00:39:28,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 179 transitions, 2242 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-14 00:39:28,032 INFO L231 Difference]: Finished difference. Result has 91 places, 121 transitions, 1254 flow [2025-04-14 00:39:28,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1254, PETRI_PLACES=91, PETRI_TRANSITIONS=121} [2025-04-14 00:39:28,033 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2025-04-14 00:39:28,033 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 121 transitions, 1254 flow [2025-04-14 00:39:28,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:28,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:28,033 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:28,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:39:28,033 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 1 more)] === [2025-04-14 00:39:28,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1917811232, now seen corresponding path program 2 times [2025-04-14 00:39:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:28,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738426828] [2025-04-14 00:39:28,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:28,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:39:28,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-14 00:39:28,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:39:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:28,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:28,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738426828] [2025-04-14 00:39:28,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738426828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:28,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:28,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:28,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494575577] [2025-04-14 00:39:28,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:28,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:28,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:28,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:28,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:28,168 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:28,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 121 transitions, 1254 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-14 00:39:28,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:28,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:28,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:28,655 INFO L116 PetriNetUnfolderBase]: 1343/1960 cut-off events. [2025-04-14 00:39:28,656 INFO L117 PetriNetUnfolderBase]: For 7234/7234 co-relation queries the response was YES. [2025-04-14 00:39:28,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9841 conditions, 1960 events. 1343/1960 cut-off events. For 7234/7234 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8117 event pairs, 329 based on Foata normal form. 1/1353 useless extension candidates. Maximal degree in co-relation 9806. Up to 1814 conditions per place. [2025-04-14 00:39:28,664 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 123 selfloop transitions, 4 changer transitions 19/146 dead transitions. [2025-04-14 00:39:28,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 146 transitions, 1729 flow [2025-04-14 00:39:28,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:39:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:39:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-04-14 00:39:28,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-04-14 00:39:28,665 INFO L175 Difference]: Start difference. First operand has 91 places, 121 transitions, 1254 flow. Second operand 5 states and 65 transitions. [2025-04-14 00:39:28,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 146 transitions, 1729 flow [2025-04-14 00:39:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 146 transitions, 1614 flow, removed 20 selfloop flow, removed 7 redundant places. [2025-04-14 00:39:28,682 INFO L231 Difference]: Finished difference. Result has 87 places, 119 transitions, 1135 flow [2025-04-14 00:39:28,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1135, PETRI_PLACES=87, PETRI_TRANSITIONS=119} [2025-04-14 00:39:28,683 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2025-04-14 00:39:28,683 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 119 transitions, 1135 flow [2025-04-14 00:39:28,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-14 00:39:28,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:28,683 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:28,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:39:28,683 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 1 more)] === [2025-04-14 00:39:28,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1047043782, now seen corresponding path program 3 times [2025-04-14 00:39:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:28,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214179123] [2025-04-14 00:39:28,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:39:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:28,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-14 00:39:28,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-14 00:39:28,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:39:28,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:28,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214179123] [2025-04-14 00:39:28,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214179123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:28,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:28,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:39:28,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464176432] [2025-04-14 00:39:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:28,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:39:28,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:28,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:39:28,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:28,777 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:28,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 119 transitions, 1135 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-14 00:39:28,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:28,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:28,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:29,235 INFO L116 PetriNetUnfolderBase]: 1264/1826 cut-off events. [2025-04-14 00:39:29,235 INFO L117 PetriNetUnfolderBase]: For 5178/5178 co-relation queries the response was YES. [2025-04-14 00:39:29,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8506 conditions, 1826 events. 1264/1826 cut-off events. For 5178/5178 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7108 event pairs, 130 based on Foata normal form. 13/1267 useless extension candidates. Maximal degree in co-relation 8474. Up to 1142 conditions per place. [2025-04-14 00:39:29,244 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 103 selfloop transitions, 7 changer transitions 44/154 dead transitions. [2025-04-14 00:39:29,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 154 transitions, 1676 flow [2025-04-14 00:39:29,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:39:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:39:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-14 00:39:29,245 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2025-04-14 00:39:29,245 INFO L175 Difference]: Start difference. First operand has 87 places, 119 transitions, 1135 flow. Second operand 5 states and 68 transitions. [2025-04-14 00:39:29,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 154 transitions, 1676 flow [2025-04-14 00:39:29,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 154 transitions, 1637 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-14 00:39:29,257 INFO L231 Difference]: Finished difference. Result has 86 places, 93 transitions, 836 flow [2025-04-14 00:39:29,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=836, PETRI_PLACES=86, PETRI_TRANSITIONS=93} [2025-04-14 00:39:29,259 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2025-04-14 00:39:29,259 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 93 transitions, 836 flow [2025-04-14 00:39:29,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-14 00:39:29,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:29,259 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:29,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:39:29,260 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 1 more)] === [2025-04-14 00:39:29,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1205483494, now seen corresponding path program 1 times [2025-04-14 00:39:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:29,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425686117] [2025-04-14 00:39:29,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:29,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:39:29,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:39:29,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:29,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:29,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:29,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425686117] [2025-04-14 00:39:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425686117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:29,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:29,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223764154] [2025-04-14 00:39:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:29,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:39:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:29,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:39:29,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:39:29,368 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:29,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 93 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-14 00:39:29,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:29,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:29,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:29,730 INFO L116 PetriNetUnfolderBase]: 1164/1679 cut-off events. [2025-04-14 00:39:29,731 INFO L117 PetriNetUnfolderBase]: For 4496/4496 co-relation queries the response was YES. [2025-04-14 00:39:29,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7647 conditions, 1679 events. 1164/1679 cut-off events. For 4496/4496 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6478 event pairs, 237 based on Foata normal form. 0/1147 useless extension candidates. Maximal degree in co-relation 7617. Up to 1406 conditions per place. [2025-04-14 00:39:29,738 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 113 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-04-14 00:39:29,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 125 transitions, 1325 flow [2025-04-14 00:39:29,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:39:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:39:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-14 00:39:29,740 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-04-14 00:39:29,740 INFO L175 Difference]: Start difference. First operand has 86 places, 93 transitions, 836 flow. Second operand 3 states and 48 transitions. [2025-04-14 00:39:29,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 125 transitions, 1325 flow [2025-04-14 00:39:29,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 125 transitions, 1175 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-04-14 00:39:29,747 INFO L231 Difference]: Finished difference. Result has 68 places, 96 transitions, 795 flow [2025-04-14 00:39:29,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=68, PETRI_TRANSITIONS=96} [2025-04-14 00:39:29,747 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-04-14 00:39:29,747 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 96 transitions, 795 flow [2025-04-14 00:39:29,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-14 00:39:29,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:29,747 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:29,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:39:29,748 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 1 more)] === [2025-04-14 00:39:29,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash 871767644, now seen corresponding path program 1 times [2025-04-14 00:39:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:29,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131461375] [2025-04-14 00:39:29,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:29,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:39:29,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:39:29,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:29,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:39:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:29,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131461375] [2025-04-14 00:39:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131461375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:29,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:29,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810260200] [2025-04-14 00:39:29,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:29,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:39:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:29,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:39:29,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:39:29,884 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:29,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 96 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:29,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:29,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:29,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:30,302 INFO L116 PetriNetUnfolderBase]: 1312/1895 cut-off events. [2025-04-14 00:39:30,302 INFO L117 PetriNetUnfolderBase]: For 4166/4166 co-relation queries the response was YES. [2025-04-14 00:39:30,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8066 conditions, 1895 events. 1312/1895 cut-off events. For 4166/4166 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7443 event pairs, 316 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 8040. Up to 1631 conditions per place. [2025-04-14 00:39:30,308 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 105 selfloop transitions, 13 changer transitions 0/118 dead transitions. [2025-04-14 00:39:30,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 1189 flow [2025-04-14 00:39:30,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:39:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:39:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-14 00:39:30,308 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2025-04-14 00:39:30,308 INFO L175 Difference]: Start difference. First operand has 68 places, 96 transitions, 795 flow. Second operand 3 states and 46 transitions. [2025-04-14 00:39:30,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 1189 flow [2025-04-14 00:39:30,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 1141 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:39:30,313 INFO L231 Difference]: Finished difference. Result has 69 places, 102 transitions, 874 flow [2025-04-14 00:39:30,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=69, PETRI_TRANSITIONS=102} [2025-04-14 00:39:30,313 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2025-04-14 00:39:30,313 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 102 transitions, 874 flow [2025-04-14 00:39:30,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 00:39:30,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:30,314 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:30,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:39:30,314 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 1 more)] === [2025-04-14 00:39:30,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1099545108, now seen corresponding path program 1 times [2025-04-14 00:39:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:30,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801780609] [2025-04-14 00:39:30,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:30,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:39:30,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:39:30,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:30,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-14 00:39:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:30,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801780609] [2025-04-14 00:39:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801780609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:30,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:30,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250251790] [2025-04-14 00:39:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:30,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:39:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:30,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:39:30,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:39:30,460 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:30,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 102 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-14 00:39:30,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:30,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:30,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:30,893 INFO L116 PetriNetUnfolderBase]: 1394/2033 cut-off events. [2025-04-14 00:39:30,893 INFO L117 PetriNetUnfolderBase]: For 4350/4350 co-relation queries the response was YES. [2025-04-14 00:39:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8615 conditions, 2033 events. 1394/2033 cut-off events. For 4350/4350 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8126 event pairs, 341 based on Foata normal form. 0/1483 useless extension candidates. Maximal degree in co-relation 8589. Up to 1714 conditions per place. [2025-04-14 00:39:30,899 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 118 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2025-04-14 00:39:30,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 1336 flow [2025-04-14 00:39:30,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:39:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:39:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-14 00:39:30,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2025-04-14 00:39:30,900 INFO L175 Difference]: Start difference. First operand has 69 places, 102 transitions, 874 flow. Second operand 3 states and 47 transitions. [2025-04-14 00:39:30,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 1336 flow [2025-04-14 00:39:30,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 129 transitions, 1305 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 00:39:30,906 INFO L231 Difference]: Finished difference. Result has 71 places, 104 transitions, 900 flow [2025-04-14 00:39:30,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=71, PETRI_TRANSITIONS=104} [2025-04-14 00:39:30,906 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2025-04-14 00:39:30,906 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 104 transitions, 900 flow [2025-04-14 00:39:30,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-14 00:39:30,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:30,906 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:39:30,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:39:30,907 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 1 more)] === [2025-04-14 00:39:30,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash 633160558, now seen corresponding path program 1 times [2025-04-14 00:39:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:30,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533019590] [2025-04-14 00:39:30,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:30,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:39:31,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:39:31,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:31,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:39:35,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:35,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533019590] [2025-04-14 00:39:35,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533019590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:35,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047432675] [2025-04-14 00:39:35,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:35,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:35,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:35,026 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-14 00:39:35,027 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-14 00:39:35,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:39:35,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:39:35,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:35,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:35,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-14 00:39:35,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:36,778 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:36,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 250 treesize of output 378 [2025-04-14 00:39:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:37,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:39,460 INFO L325 Elim1Store]: treesize reduction 5, result has 95.9 percent of original size [2025-04-14 00:39:39,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 110 treesize of output 193 [2025-04-14 00:39:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047432675] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:39,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 8] total 36 [2025-04-14 00:39:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838800049] [2025-04-14 00:39:39,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:39,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 00:39:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:39,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 00:39:39,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 00:39:39,616 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:39,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 104 transitions, 900 flow. Second operand has 37 states, 37 states have (on average 5.162162162162162) internal successors, (191), 37 states have internal predecessors, (191), 0 states have call successors, (0), 0 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-14 00:39:39,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:39,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:39,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:47,348 INFO L116 PetriNetUnfolderBase]: 5064/7422 cut-off events. [2025-04-14 00:39:47,348 INFO L117 PetriNetUnfolderBase]: For 14667/14667 co-relation queries the response was YES. [2025-04-14 00:39:47,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30336 conditions, 7422 events. 5064/7422 cut-off events. For 14667/14667 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 39674 event pairs, 243 based on Foata normal form. 21/5243 useless extension candidates. Maximal degree in co-relation 30309. Up to 2835 conditions per place. [2025-04-14 00:39:47,378 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 482 selfloop transitions, 237 changer transitions 79/798 dead transitions. [2025-04-14 00:39:47,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 798 transitions, 7354 flow [2025-04-14 00:39:47,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-14 00:39:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-04-14 00:39:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 532 transitions. [2025-04-14 00:39:47,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2878787878787879 [2025-04-14 00:39:47,381 INFO L175 Difference]: Start difference. First operand has 71 places, 104 transitions, 900 flow. Second operand 56 states and 532 transitions. [2025-04-14 00:39:47,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 798 transitions, 7354 flow [2025-04-14 00:39:47,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 798 transitions, 7207 flow, removed 35 selfloop flow, removed 1 redundant places. [2025-04-14 00:39:47,402 INFO L231 Difference]: Finished difference. Result has 157 places, 312 transitions, 3430 flow [2025-04-14 00:39:47,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=3430, PETRI_PLACES=157, PETRI_TRANSITIONS=312} [2025-04-14 00:39:47,402 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2025-04-14 00:39:47,402 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 312 transitions, 3430 flow [2025-04-14 00:39:47,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.162162162162162) internal successors, (191), 37 states have internal predecessors, (191), 0 states have call successors, (0), 0 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-14 00:39:47,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:47,403 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:39:47,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:39:47,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:47,603 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 1 more)] === [2025-04-14 00:39:47,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1444774964, now seen corresponding path program 2 times [2025-04-14 00:39:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:47,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639015732] [2025-04-14 00:39:47,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:47,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:39:47,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:39:47,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:39:47,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:39:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:53,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639015732] [2025-04-14 00:39:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639015732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:53,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661364730] [2025-04-14 00:39:53,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:53,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:53,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:53,710 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-14 00:39:53,711 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-14 00:39:53,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:39:53,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:39:53,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:39:53,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:53,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 00:39:53,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:54,978 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:54,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 229 treesize of output 281 [2025-04-14 00:39:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:55,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:57,031 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:57,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 372 treesize of output 613 [2025-04-14 00:39:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:58,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661364730] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:58,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:58,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12, 8] total 48 [2025-04-14 00:39:58,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311034459] [2025-04-14 00:39:58,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:58,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-14 00:39:58,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:58,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-14 00:39:58,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2189, Unknown=0, NotChecked=0, Total=2352 [2025-04-14 00:39:58,534 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:58,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 312 transitions, 3430 flow. Second operand has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-14 00:39:58,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:58,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:58,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:41:14,799 INFO L116 PetriNetUnfolderBase]: 6381/9497 cut-off events. [2025-04-14 00:41:14,799 INFO L117 PetriNetUnfolderBase]: For 73487/73487 co-relation queries the response was YES. [2025-04-14 00:41:14,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55780 conditions, 9497 events. 6381/9497 cut-off events. For 73487/73487 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 54693 event pairs, 429 based on Foata normal form. 10/7909 useless extension candidates. Maximal degree in co-relation 55721. Up to 3770 conditions per place. [2025-04-14 00:41:14,859 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 333 selfloop transitions, 445 changer transitions 63/841 dead transitions. [2025-04-14 00:41:14,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 841 transitions, 10433 flow [2025-04-14 00:41:14,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-14 00:41:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2025-04-14 00:41:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 613 transitions. [2025-04-14 00:41:14,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24124360487996852 [2025-04-14 00:41:14,862 INFO L175 Difference]: Start difference. First operand has 157 places, 312 transitions, 3430 flow. Second operand 77 states and 613 transitions. [2025-04-14 00:41:14,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 841 transitions, 10433 flow [2025-04-14 00:41:15,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 841 transitions, 9706 flow, removed 300 selfloop flow, removed 17 redundant places. [2025-04-14 00:41:15,769 INFO L231 Difference]: Finished difference. Result has 244 places, 578 transitions, 7548 flow [2025-04-14 00:41:15,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3019, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=7548, PETRI_PLACES=244, PETRI_TRANSITIONS=578} [2025-04-14 00:41:15,770 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2025-04-14 00:41:15,770 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 578 transitions, 7548 flow [2025-04-14 00:41:15,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-14 00:41:15,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:41:15,770 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:41:15,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 00:41:15,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:41:15,971 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 1 more)] === [2025-04-14 00:41:15,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:41:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1976533728, now seen corresponding path program 3 times [2025-04-14 00:41:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:41:15,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166558592] [2025-04-14 00:41:15,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:41:15,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:41:15,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:41:16,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:41:16,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:41:16,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:41:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:41:23,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:41:23,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166558592] [2025-04-14 00:41:23,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166558592] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:41:23,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633381462] [2025-04-14 00:41:23,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:41:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:41:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:41:23,495 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-14 00:41:23,495 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-14 00:41:23,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:41:23,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:41:23,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:41:23,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:41:23,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-14 00:41:23,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:41:34,072 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:41:34,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 302 treesize of output 306 [2025-04-14 00:41:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:41:40,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:41:51,624 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:41:51,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 347 treesize of output 453 [2025-04-14 00:41:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:41:56,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633381462] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:41:56,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:41:56,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 27 [2025-04-14 00:41:56,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334545478] [2025-04-14 00:41:56,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:41:56,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:41:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:41:56,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:41:56,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:41:56,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:41:56,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 578 transitions, 7548 flow. Second operand has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-14 00:41:56,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:41:56,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:41:56,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:40,379 INFO L116 PetriNetUnfolderBase]: 7647/11522 cut-off events. [2025-04-14 00:42:40,380 INFO L117 PetriNetUnfolderBase]: For 285526/285526 co-relation queries the response was YES. [2025-04-14 00:42:40,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90803 conditions, 11522 events. 7647/11522 cut-off events. For 285526/285526 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 70400 event pairs, 732 based on Foata normal form. 8/11398 useless extension candidates. Maximal degree in co-relation 90721. Up to 4834 conditions per place. [2025-04-14 00:42:40,488 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 540 selfloop transitions, 387 changer transitions 25/952 dead transitions. [2025-04-14 00:42:40,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 952 transitions, 14959 flow [2025-04-14 00:42:40,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:42:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:42:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 308 transitions. [2025-04-14 00:42:40,490 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3218390804597701 [2025-04-14 00:42:40,490 INFO L175 Difference]: Start difference. First operand has 244 places, 578 transitions, 7548 flow. Second operand 29 states and 308 transitions. [2025-04-14 00:42:40,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 952 transitions, 14959 flow [2025-04-14 00:42:43,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 952 transitions, 13249 flow, removed 772 selfloop flow, removed 24 redundant places. [2025-04-14 00:42:43,666 INFO L231 Difference]: Finished difference. Result has 259 places, 721 transitions, 10066 flow [2025-04-14 00:42:43,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6462, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=10066, PETRI_PLACES=259, PETRI_TRANSITIONS=721} [2025-04-14 00:42:43,666 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2025-04-14 00:42:43,666 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 721 transitions, 10066 flow [2025-04-14 00:42:43,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-14 00:42:43,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:43,667 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:42:43,674 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-14 00:42:43,867 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,SelfDestructingSolverStorable21 [2025-04-14 00:42:43,867 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 1 more)] === [2025-04-14 00:42:43,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1861014044, now seen corresponding path program 4 times [2025-04-14 00:42:43,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:43,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089465688] [2025-04-14 00:42:43,868 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:42:43,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:43,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:42:44,081 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:42:44,081 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:42:44,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:43:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:05,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089465688] [2025-04-14 00:43:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089465688] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:43:05,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391250275] [2025-04-14 00:43:05,757 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:43:05,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:43:05,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:43:05,759 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-14 00:43:05,760 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-14 00:43:05,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:43:06,034 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:43:06,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:43:06,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:06,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-14 00:43:06,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:43:17,880 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:43:17,881 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 270 treesize of output 334 [2025-04-14 00:43:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:43:24,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:43:33,895 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-14 00:43:33,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 297 treesize of output 260 [2025-04-14 00:43:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:43:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391250275] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:43:36,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:43:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7, 7] total 40 [2025-04-14 00:43:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149743043] [2025-04-14 00:43:36,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:43:36,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 00:43:36,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:36,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 00:43:36,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2025-04-14 00:43:36,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:43:36,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 721 transitions, 10066 flow. Second operand has 41 states, 41 states have (on average 4.902439024390244) internal successors, (201), 41 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-14 00:43:36,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:36,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:43:36,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:27,791 INFO L116 PetriNetUnfolderBase]: 7929/11995 cut-off events. [2025-04-14 00:44:27,792 INFO L117 PetriNetUnfolderBase]: For 301331/301331 co-relation queries the response was YES. [2025-04-14 00:44:27,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97961 conditions, 11995 events. 7929/11995 cut-off events. For 301331/301331 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 74248 event pairs, 775 based on Foata normal form. 6/11995 useless extension candidates. Maximal degree in co-relation 97872. Up to 5045 conditions per place. [2025-04-14 00:44:27,928 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 650 selfloop transitions, 341 changer transitions 5/996 dead transitions. [2025-04-14 00:44:27,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 996 transitions, 16074 flow [2025-04-14 00:44:27,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 00:44:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 00:44:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 243 transitions. [2025-04-14 00:44:27,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.262987012987013 [2025-04-14 00:44:27,929 INFO L175 Difference]: Start difference. First operand has 259 places, 721 transitions, 10066 flow. Second operand 28 states and 243 transitions. [2025-04-14 00:44:27,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 996 transitions, 16074 flow [2025-04-14 00:44:32,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 996 transitions, 15016 flow, removed 518 selfloop flow, removed 6 redundant places. [2025-04-14 00:44:32,148 INFO L231 Difference]: Finished difference. Result has 281 places, 783 transitions, 10877 flow [2025-04-14 00:44:32,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9226, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=10877, PETRI_PLACES=281, PETRI_TRANSITIONS=783} [2025-04-14 00:44:32,149 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 251 predicate places. [2025-04-14 00:44:32,149 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 783 transitions, 10877 flow [2025-04-14 00:44:32,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.902439024390244) internal successors, (201), 41 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-14 00:44:32,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:32,149 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:44:32,157 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-14 00:44:32,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:32,350 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 1 more)] === [2025-04-14 00:44:32,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 280200784, now seen corresponding path program 5 times [2025-04-14 00:44:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:32,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417695683] [2025-04-14 00:44:32,351 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:44:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:32,369 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:44:32,522 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:44:32,522 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:44:32,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-14 00:44:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:40,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417695683] [2025-04-14 00:44:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417695683] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:44:40,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665047282] [2025-04-14 00:44:40,227 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:44:40,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:40,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:44:40,229 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-14 00:44:40,230 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-14 00:44:40,417 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:44:40,625 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:44:40,625 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:44:40,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:40,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-14 00:44:40,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:44:49,925 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:44:49,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 241 [2025-04-14 00:44:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:44:54,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:45:03,442 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:45:03,443 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 251 treesize of output 387 [2025-04-14 00:45:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:45:09,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665047282] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:45:09,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:45:09,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 7] total 29 [2025-04-14 00:45:09,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172758667] [2025-04-14 00:45:09,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:45:09,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:45:09,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:09,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:45:09,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:45:09,345 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:09,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 783 transitions, 10877 flow. Second operand has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-14 00:45:09,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:09,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:09,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:37,729 INFO L116 PetriNetUnfolderBase]: 7929/11992 cut-off events. [2025-04-14 00:45:37,730 INFO L117 PetriNetUnfolderBase]: For 250489/250489 co-relation queries the response was YES. [2025-04-14 00:45:37,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94582 conditions, 11992 events. 7929/11992 cut-off events. For 250489/250489 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 74204 event pairs, 911 based on Foata normal form. 3/11985 useless extension candidates. Maximal degree in co-relation 94493. Up to 5017 conditions per place. [2025-04-14 00:45:37,846 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 640 selfloop transitions, 239 changer transitions 21/900 dead transitions. [2025-04-14 00:45:37,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 900 transitions, 14251 flow [2025-04-14 00:45:37,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:45:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:45:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 161 transitions. [2025-04-14 00:45:37,847 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27104377104377103 [2025-04-14 00:45:37,847 INFO L175 Difference]: Start difference. First operand has 281 places, 783 transitions, 10877 flow. Second operand 18 states and 161 transitions. [2025-04-14 00:45:37,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 900 transitions, 14251 flow [2025-04-14 00:45:40,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 900 transitions, 14181 flow, removed 20 selfloop flow, removed 13 redundant places. [2025-04-14 00:45:40,978 INFO L231 Difference]: Finished difference. Result has 284 places, 766 transitions, 11076 flow [2025-04-14 00:45:40,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10802, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11076, PETRI_PLACES=284, PETRI_TRANSITIONS=766} [2025-04-14 00:45:40,979 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2025-04-14 00:45:40,979 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 766 transitions, 11076 flow [2025-04-14 00:45:40,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-14 00:45:40,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:40,979 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:45:40,987 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-14 00:45:41,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:45:41,180 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 1 more)] === [2025-04-14 00:45:41,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash -147788390, now seen corresponding path program 6 times [2025-04-14 00:45:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:41,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127813423] [2025-04-14 00:45:41,181 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:41,198 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:45:41,277 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-14 00:45:41,278 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:45:41,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:45:46,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:46,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127813423] [2025-04-14 00:45:46,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127813423] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:45:46,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875418118] [2025-04-14 00:45:46,187 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:46,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:45:46,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:45:46,189 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-14 00:45:46,190 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-14 00:45:46,385 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:45:46,435 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-14 00:45:46,435 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:45:46,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:46,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 00:45:46,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:45:55,315 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:45:55,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 306 treesize of output 342 [2025-04-14 00:46:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:46:01,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:46:09,895 INFO L325 Elim1Store]: treesize reduction 5, result has 95.8 percent of original size [2025-04-14 00:46:09,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 221 treesize of output 291 [2025-04-14 00:46:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:46:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875418118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:46:14,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:46:14,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 24 [2025-04-14 00:46:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457434322] [2025-04-14 00:46:14,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:46:14,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:46:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:14,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:46:14,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:46:14,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:14,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 766 transitions, 11076 flow. Second operand has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:46:14,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:14,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:55,475 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 00:46:59,483 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 00:47:09,458 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 00:47:23,098 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 00:47:27,273 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 00:48:09,162 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 00:48:13,177 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 00:48:55,336 INFO L116 PetriNetUnfolderBase]: 12100/18652 cut-off events. [2025-04-14 00:48:55,336 INFO L117 PetriNetUnfolderBase]: For 433661/433661 co-relation queries the response was YES. [2025-04-14 00:48:55,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155644 conditions, 18652 events. 12100/18652 cut-off events. For 433661/433661 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 127543 event pairs, 791 based on Foata normal form. 35/18677 useless extension candidates. Maximal degree in co-relation 155555. Up to 8424 conditions per place. [2025-04-14 00:48:55,593 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 913 selfloop transitions, 707 changer transitions 159/1779 dead transitions. [2025-04-14 00:48:55,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 1779 transitions, 30069 flow [2025-04-14 00:48:55,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 00:48:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-04-14 00:48:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 663 transitions. [2025-04-14 00:48:55,595 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2025-04-14 00:48:55,596 INFO L175 Difference]: Start difference. First operand has 284 places, 766 transitions, 11076 flow. Second operand 65 states and 663 transitions. [2025-04-14 00:48:55,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 1779 transitions, 30069 flow [2025-04-14 00:49:02,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 1779 transitions, 29266 flow, removed 84 selfloop flow, removed 17 redundant places. [2025-04-14 00:49:02,161 INFO L231 Difference]: Finished difference. Result has 358 places, 1089 transitions, 18272 flow [2025-04-14 00:49:02,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10645, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=18272, PETRI_PLACES=358, PETRI_TRANSITIONS=1089} [2025-04-14 00:49:02,162 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 328 predicate places. [2025-04-14 00:49:02,162 INFO L485 AbstractCegarLoop]: Abstraction has has 358 places, 1089 transitions, 18272 flow [2025-04-14 00:49:02,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:02,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:02,162 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:49:02,170 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-14 00:49:02,363 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-14 00:49:02,363 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 1 more)] === [2025-04-14 00:49:02,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1237422888, now seen corresponding path program 7 times [2025-04-14 00:49:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:02,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45850259] [2025-04-14 00:49:02,364 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:49:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:02,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:49:02,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:49:02,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:49:02,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:49:14,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:14,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45850259] [2025-04-14 00:49:14,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45850259] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:14,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948211442] [2025-04-14 00:49:14,634 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:49:14,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:14,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:14,636 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-14 00:49:14,637 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-14 00:49:14,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:49:14,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:49:14,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:49:14,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:14,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-14 00:49:14,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:21,563 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:49:21,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 245 [2025-04-14 00:49:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:49:26,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:34,444 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-14 00:49:34,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 194 [2025-04-14 00:49:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:49:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948211442] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:38,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:38,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 32 [2025-04-14 00:49:38,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359908763] [2025-04-14 00:49:38,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:38,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 00:49:38,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:38,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 00:49:38,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 00:49:38,053 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:49:38,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1089 transitions, 18272 flow. Second operand has 33 states, 33 states have (on average 5.0606060606060606) internal successors, (167), 33 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-14 00:49:38,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:38,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:49:38,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:50:17,960 INFO L116 PetriNetUnfolderBase]: 11676/17910 cut-off events. [2025-04-14 00:50:17,960 INFO L117 PetriNetUnfolderBase]: For 743440/743440 co-relation queries the response was YES. [2025-04-14 00:50:18,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178049 conditions, 17910 events. 11676/17910 cut-off events. For 743440/743440 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 120506 event pairs, 1143 based on Foata normal form. 5/17905 useless extension candidates. Maximal degree in co-relation 177931. Up to 8108 conditions per place. [2025-04-14 00:50:18,208 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 852 selfloop transitions, 448 changer transitions 5/1305 dead transitions. [2025-04-14 00:50:18,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1305 transitions, 24644 flow [2025-04-14 00:50:18,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 00:50:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 00:50:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 221 transitions. [2025-04-14 00:50:18,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29117259552042163 [2025-04-14 00:50:18,210 INFO L175 Difference]: Start difference. First operand has 358 places, 1089 transitions, 18272 flow. Second operand 23 states and 221 transitions. [2025-04-14 00:50:18,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 1305 transitions, 24644 flow [2025-04-14 00:50:28,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1305 transitions, 22665 flow, removed 675 selfloop flow, removed 13 redundant places. [2025-04-14 00:50:28,997 INFO L231 Difference]: Finished difference. Result has 353 places, 1087 transitions, 17292 flow [2025-04-14 00:50:28,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=16396, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=448, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=17292, PETRI_PLACES=353, PETRI_TRANSITIONS=1087} [2025-04-14 00:50:28,998 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 323 predicate places. [2025-04-14 00:50:28,998 INFO L485 AbstractCegarLoop]: Abstraction has has 353 places, 1087 transitions, 17292 flow [2025-04-14 00:50:28,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.0606060606060606) internal successors, (167), 33 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-14 00:50:28,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:50:28,999 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:50:29,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 00:50:29,199 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,SelfDestructingSolverStorable25 [2025-04-14 00:50:29,199 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 1 more)] === [2025-04-14 00:50:29,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:50:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash 806282592, now seen corresponding path program 8 times [2025-04-14 00:50:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:50:29,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121407323] [2025-04-14 00:50:29,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:50:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:50:29,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:50:29,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:50:29,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:50:29,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:50:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-14 00:50:36,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:50:36,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121407323] [2025-04-14 00:50:36,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121407323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:50:36,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463861599] [2025-04-14 00:50:36,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:50:36,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:50:36,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:50:36,438 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-14 00:50:36,438 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-14 00:50:36,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:50:36,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:50:36,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:50:36,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:50:36,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-14 00:50:36,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:50:47,541 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:50:47,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 314 treesize of output 494 [2025-04-14 00:50:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:50:53,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:51:01,196 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-14 00:51:01,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 179 [2025-04-14 00:51:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:51:05,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463861599] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:51:05,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:51:05,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 7] total 31 [2025-04-14 00:51:05,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28378359] [2025-04-14 00:51:05,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:51:05,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 00:51:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:05,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 00:51:05,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2025-04-14 00:51:05,158 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:51:05,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 1087 transitions, 17292 flow. Second operand has 32 states, 32 states have (on average 5.53125) internal successors, (177), 32 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-14 00:51:05,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:05,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:51:05,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:46,843 INFO L116 PetriNetUnfolderBase]: 21922/33643 cut-off events. [2025-04-14 00:52:46,843 INFO L117 PetriNetUnfolderBase]: For 1380203/1380203 co-relation queries the response was YES. [2025-04-14 00:52:47,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330706 conditions, 33643 events. 21922/33643 cut-off events. For 1380203/1380203 co-relation queries the response was YES. Maximal size of possible extension queue 1914. Compared 247303 event pairs, 1703 based on Foata normal form. 35/33654 useless extension candidates. Maximal degree in co-relation 330593. Up to 15663 conditions per place. [2025-04-14 00:52:47,930 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 1215 selfloop transitions, 1347 changer transitions 94/2656 dead transitions. [2025-04-14 00:52:47,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 2656 transitions, 49149 flow [2025-04-14 00:52:47,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 00:52:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-14 00:52:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 482 transitions. [2025-04-14 00:52:47,931 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28639334521687465 [2025-04-14 00:52:47,932 INFO L175 Difference]: Start difference. First operand has 353 places, 1087 transitions, 17292 flow. Second operand 51 states and 482 transitions. [2025-04-14 00:52:47,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 2656 transitions, 49149 flow [2025-04-14 00:53:11,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 2656 transitions, 48514 flow, removed 12 selfloop flow, removed 18 redundant places. [2025-04-14 00:53:11,031 INFO L231 Difference]: Finished difference. Result has 412 places, 1889 transitions, 36460 flow [2025-04-14 00:53:11,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=16967, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=603, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=36460, PETRI_PLACES=412, PETRI_TRANSITIONS=1889} [2025-04-14 00:53:11,032 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 382 predicate places. [2025-04-14 00:53:11,032 INFO L485 AbstractCegarLoop]: Abstraction has has 412 places, 1889 transitions, 36460 flow [2025-04-14 00:53:11,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.53125) internal successors, (177), 32 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-14 00:53:11,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:11,032 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 00:53:11,041 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-14 00:53:11,233 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,SelfDestructingSolverStorable26 [2025-04-14 00:53:11,233 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 1 more)] === [2025-04-14 00:53:11,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash 314563358, now seen corresponding path program 9 times [2025-04-14 00:53:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:11,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858152882] [2025-04-14 00:53:11,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:53:11,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:11,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:53:11,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:53:11,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:53:11,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2025-04-14 00:53:12,659 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:53:12,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 00:53:12,660 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while InterpolatingTraceCheckCraig was while computing interpolants. [2025-04-14 00:53:12,661 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:53:12,661 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:53:12,662 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:53:12,662 INFO L422 BasicCegarLoop]: Path program histogram: [9, 8, 3, 2, 2, 1, 1, 1, 1] [2025-04-14 00:53:12,674 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:53:12,674 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:53:12,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:53:12 BasicIcfg [2025-04-14 00:53:12,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:53:12,683 INFO L158 Benchmark]: Toolchain (without parser) took 839957.61ms. Allocated memory was 125.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 89.3MB in the beginning and 771.2MB in the end (delta: -681.9MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-14 00:53:12,683 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:53:12,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.91ms. Allocated memory is still 125.8MB. Free memory was 89.3MB in the beginning and 71.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 00:53:12,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.41ms. Allocated memory is still 125.8MB. Free memory was 71.5MB in the beginning and 66.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:53:12,683 INFO L158 Benchmark]: Boogie Preprocessor took 61.56ms. Allocated memory is still 125.8MB. Free memory was 66.8MB in the beginning and 62.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:53:12,683 INFO L158 Benchmark]: IcfgBuilder took 1565.97ms. Allocated memory was 125.8MB in the beginning and 297.8MB in the end (delta: 172.0MB). Free memory was 62.6MB in the beginning and 198.9MB in the end (delta: -136.3MB). Peak memory consumption was 60.1MB. Max. memory is 8.0GB. [2025-04-14 00:53:12,683 INFO L158 Benchmark]: TraceAbstraction took 838039.82ms. Allocated memory was 297.8MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 197.8MB in the beginning and 771.2MB in the end (delta: -573.4MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-14 00:53:12,684 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.91ms. Allocated memory is still 125.8MB. Free memory was 89.3MB in the beginning and 71.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.41ms. Allocated memory is still 125.8MB. Free memory was 71.5MB in the beginning and 66.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.56ms. Allocated memory is still 125.8MB. Free memory was 66.8MB in the beginning and 62.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1565.97ms. Allocated memory was 125.8MB in the beginning and 297.8MB in the end (delta: 172.0MB). Free memory was 62.6MB in the beginning and 198.9MB in the end (delta: -136.3MB). Peak memory consumption was 60.1MB. Max. memory is 8.0GB. * TraceAbstraction took 838039.82ms. Allocated memory was 297.8MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 197.8MB in the beginning and 771.2MB in the end (delta: -573.4MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while InterpolatingTraceCheckCraig was while computing interpolants. - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while InterpolatingTraceCheckCraig was while computing interpolants. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while InterpolatingTraceCheckCraig was while computing interpolants. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while InterpolatingTraceCheckCraig was while computing interpolants. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances [2025-04-14 00:53:12,691 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end CFG has 7 procedures, 37 locations, 51 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 837.9s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 575.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 2441 SdHoareTripleChecker+Valid, 250.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2441 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 245.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27221 IncrementalHoareTripleChecker+Invalid, 27601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 373 mSolverCounterUnsat, 0 mSDtfsCounter, 27221 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1415 GetRequests, 771 SyntacticMatches, 5 SemanticMatches, 639 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10970 ImplicationChecksByTransitivity, 295.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36460occurred in iteration=27, InterpolantAutomatonStates: 436, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 254.2s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1104 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1554 ConstructedInterpolants, 51 QuantifiedInterpolants, 17546 SizeOfPredicates, 380 NumberOfNonLiveVariables, 4172 ConjunctsInSsa, 398 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 1678/1962 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown