/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-chromosome-opt-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:31:39,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:31:40,001 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:31:40,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:31:40,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:31:40,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:31:40,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:31:40,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:31:40,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:31:40,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:31:40,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:31:40,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:31:40,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:31:40,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:31:40,030 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:31:40,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:31:40,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:31:40,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:31:40,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:31:40,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:31:40,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:31:40,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:31:40,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:31:40,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:31:40,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:31:40,033 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:31:40,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:31:40,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:31:40,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:31:40,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:31:40,247 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:31:40,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2025-04-14 00:31:41,496 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e1bc7b3/d2bd93797c0e41faad483a16f51d6513/FLAGba4585730 [2025-04-14 00:31:41,710 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:31:41,710 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2025-04-14 00:31:41,718 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e1bc7b3/d2bd93797c0e41faad483a16f51d6513/FLAGba4585730 [2025-04-14 00:31:42,547 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e1bc7b3/d2bd93797c0e41faad483a16f51d6513 [2025-04-14 00:31:42,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:31:42,550 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:31:42,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:31:42,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:31:42,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:31:42,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e00ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42, skipping insertion in model container [2025-04-14 00:31:42,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:31:42,731 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-chromosome-opt-symm.wvr.c[2592,2605] [2025-04-14 00:31:42,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:31:42,755 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:31:42,784 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-chromosome-opt-symm.wvr.c[2592,2605] [2025-04-14 00:31:42,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:31:42,800 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:31:42,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42 WrapperNode [2025-04-14 00:31:42,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:31:42,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:31:42,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:31:42,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:31:42,807 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:31:42" (1/1) ... [2025-04-14 00:31:42,813 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:31:42" (1/1) ... [2025-04-14 00:31:42,832 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 157 [2025-04-14 00:31:42,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:31:42,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:31:42,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:31:42,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:31:42,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,848 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-14 00:31:42,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:31:42,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:31:42,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:31:42,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:31:42,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (1/1) ... [2025-04-14 00:31:42,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:31:42,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:42,887 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:31:42,892 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:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:31:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:31:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:31:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:31:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:31:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:31:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:31:42,906 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:31:42,985 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:31:42,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:31:43,204 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:31:43,205 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:31:43,205 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:31:43,419 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:31:43,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:31:43 BoogieIcfgContainer [2025-04-14 00:31:43,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:31:43,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:31:43,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:31:43,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:31:43,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:31:42" (1/3) ... [2025-04-14 00:31:43,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a94222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:31:43, skipping insertion in model container [2025-04-14 00:31:43,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:42" (2/3) ... [2025-04-14 00:31:43,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a94222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:31:43, skipping insertion in model container [2025-04-14 00:31:43,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:31:43" (3/3) ... [2025-04-14 00:31:43,427 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-04-14 00:31:43,437 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:31:43,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 00:31:43,438 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:31:43,483 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:31:43,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 56 flow [2025-04-14 00:31:43,527 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-14 00:31:43,528 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:31:43,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 4/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-14 00:31:43,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 56 flow [2025-04-14 00:31:43,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 48 flow [2025-04-14 00:31:43,540 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:31:43,551 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;@10c23550, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:31:43,551 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:31:43,557 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:31:43,557 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-14 00:31:43,557 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:31:43,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:43,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:43,558 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:43,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -452046836, now seen corresponding path program 1 times [2025-04-14 00:31:43,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:43,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208145314] [2025-04-14 00:31:43,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:43,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:31:43,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:31:43,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:43,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:43,871 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:31:43,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:43,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208145314] [2025-04-14 00:31:43,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208145314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:43,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:31:43,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:31:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19777020] [2025-04-14 00:31:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:43,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:31:43,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:43,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:31:43,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:31:43,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:43,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:31:43,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:43,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:43,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:43,966 INFO L116 PetriNetUnfolderBase]: 39/73 cut-off events. [2025-04-14 00:31:43,966 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-14 00:31:43,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 73 events. 39/73 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 22 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 120. Up to 72 conditions per place. [2025-04-14 00:31:43,969 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 16 selfloop transitions, 4 changer transitions 0/20 dead transitions. [2025-04-14 00:31:43,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 92 flow [2025-04-14 00:31:43,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:31:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:31:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-14 00:31:43,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 00:31:43,979 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 48 flow. Second operand 3 states and 28 transitions. [2025-04-14 00:31:43,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 92 flow [2025-04-14 00:31:43,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:31:43,983 INFO L231 Difference]: Finished difference. Result has 20 places, 20 transitions, 62 flow [2025-04-14 00:31:43,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=20, PETRI_TRANSITIONS=20} [2025-04-14 00:31:43,988 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-04-14 00:31:43,989 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 20 transitions, 62 flow [2025-04-14 00:31:43,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:31:43,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:43,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:43,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:31:43,989 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:43,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:43,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2110153105, now seen corresponding path program 1 times [2025-04-14 00:31:43,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:43,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713983400] [2025-04-14 00:31:43,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:43,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:44,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:31:44,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:31:44,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:44,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:31:44,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:44,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713983400] [2025-04-14 00:31:44,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713983400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:44,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921237798] [2025-04-14 00:31:44,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:44,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:44,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:44,166 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:31:44,167 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:31:44,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:31:44,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:31:44,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:44,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:44,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:31:44,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:31:44,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:31:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921237798] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:44,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:44,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-14 00:31:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040136218] [2025-04-14 00:31:44,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:44,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:31:44,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:44,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:31:44,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:31:44,319 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:44,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 20 transitions, 62 flow. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:31:44,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:44,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:44,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:44,405 INFO L116 PetriNetUnfolderBase]: 39/79 cut-off events. [2025-04-14 00:31:44,405 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:31:44,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 79 events. 39/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 22 based on Foata normal form. 3/66 useless extension candidates. Maximal degree in co-relation 151. Up to 72 conditions per place. [2025-04-14 00:31:44,406 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 16 selfloop transitions, 10 changer transitions 0/26 dead transitions. [2025-04-14 00:31:44,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 138 flow [2025-04-14 00:31:44,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:31:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:31:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2025-04-14 00:31:44,407 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2025-04-14 00:31:44,407 INFO L175 Difference]: Start difference. First operand has 20 places, 20 transitions, 62 flow. Second operand 6 states and 44 transitions. [2025-04-14 00:31:44,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 138 flow [2025-04-14 00:31:44,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:31:44,410 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 124 flow [2025-04-14 00:31:44,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2025-04-14 00:31:44,410 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2025-04-14 00:31:44,410 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 124 flow [2025-04-14 00:31:44,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:31:44,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:44,411 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:44,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:31:44,611 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:31:44,611 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:44,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1338859972, now seen corresponding path program 2 times [2025-04-14 00:31:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:44,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089097319] [2025-04-14 00:31:44,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:31:44,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:44,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:31:44,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 22 statements. [2025-04-14 00:31:44,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:31:44,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:31:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:45,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089097319] [2025-04-14 00:31:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089097319] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:31:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:31:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471696541] [2025-04-14 00:31:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:45,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:31:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:45,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:31:45,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:31:45,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:45,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 124 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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:31:45,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:45,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:45,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:45,763 INFO L116 PetriNetUnfolderBase]: 68/136 cut-off events. [2025-04-14 00:31:45,763 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:31:45,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 136 events. 68/136 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 340 event pairs, 9 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 258. Up to 37 conditions per place. [2025-04-14 00:31:45,766 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 45 selfloop transitions, 13 changer transitions 4/62 dead transitions. [2025-04-14 00:31:45,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 62 transitions, 328 flow [2025-04-14 00:31:45,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:31:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:31:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2025-04-14 00:31:45,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-14 00:31:45,768 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 124 flow. Second operand 10 states and 75 transitions. [2025-04-14 00:31:45,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 62 transitions, 328 flow [2025-04-14 00:31:45,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 62 transitions, 312 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 00:31:45,770 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 191 flow [2025-04-14 00:31:45,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=191, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-04-14 00:31:45,772 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2025-04-14 00:31:45,772 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 191 flow [2025-04-14 00:31:45,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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:31:45,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:45,772 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:45,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:31:45,772 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:45,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:45,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1952484288, now seen corresponding path program 3 times [2025-04-14 00:31:45,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:45,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897934554] [2025-04-14 00:31:45,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:31:45,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:45,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-14 00:31:45,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 22 statements. [2025-04-14 00:31:45,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:31:45,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:31:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:46,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897934554] [2025-04-14 00:31:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897934554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:46,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:31:46,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:31:46,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833924430] [2025-04-14 00:31:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:46,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:31:46,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:46,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:31:46,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:31:46,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:46,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 191 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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:31:46,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:46,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:46,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:46,625 INFO L116 PetriNetUnfolderBase]: 110/218 cut-off events. [2025-04-14 00:31:46,625 INFO L117 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-04-14 00:31:46,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 218 events. 110/218 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 691 event pairs, 15 based on Foata normal form. 4/221 useless extension candidates. Maximal degree in co-relation 708. Up to 72 conditions per place. [2025-04-14 00:31:46,627 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 50 selfloop transitions, 23 changer transitions 5/78 dead transitions. [2025-04-14 00:31:46,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 529 flow [2025-04-14 00:31:46,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:31:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:31:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2025-04-14 00:31:46,630 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.354978354978355 [2025-04-14 00:31:46,630 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 191 flow. Second operand 11 states and 82 transitions. [2025-04-14 00:31:46,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 529 flow [2025-04-14 00:31:46,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 506 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-04-14 00:31:46,635 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 343 flow [2025-04-14 00:31:46,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=343, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-04-14 00:31:46,637 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2025-04-14 00:31:46,637 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 343 flow [2025-04-14 00:31:46,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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:31:46,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:46,637 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:46,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:31:46,637 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:46,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash 391436528, now seen corresponding path program 4 times [2025-04-14 00:31:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:46,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436550984] [2025-04-14 00:31:46,638 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:31:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:46,651 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:31:46,661 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 11 of 22 statements. [2025-04-14 00:31:46,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:31:46,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:31:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:46,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436550984] [2025-04-14 00:31:46,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436550984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:46,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:31:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:31:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345126334] [2025-04-14 00:31:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:46,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:31:46,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:46,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:31:46,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:31:46,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:46,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:31:46,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:46,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:46,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:47,053 INFO L116 PetriNetUnfolderBase]: 123/236 cut-off events. [2025-04-14 00:31:47,054 INFO L117 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2025-04-14 00:31:47,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 236 events. 123/236 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 760 event pairs, 11 based on Foata normal form. 1/236 useless extension candidates. Maximal degree in co-relation 925. Up to 66 conditions per place. [2025-04-14 00:31:47,056 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 62 selfloop transitions, 30 changer transitions 4/96 dead transitions. [2025-04-14 00:31:47,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 96 transitions, 741 flow [2025-04-14 00:31:47,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:31:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:31:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2025-04-14 00:31:47,062 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4199134199134199 [2025-04-14 00:31:47,062 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 343 flow. Second operand 11 states and 97 transitions. [2025-04-14 00:31:47,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 96 transitions, 741 flow [2025-04-14 00:31:47,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 699 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-04-14 00:31:47,066 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 500 flow [2025-04-14 00:31:47,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=500, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-04-14 00:31:47,067 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 42 predicate places. [2025-04-14 00:31:47,067 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 500 flow [2025-04-14 00:31:47,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:31:47,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:47,067 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:47,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:31:47,067 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:47,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:47,068 INFO L85 PathProgramCache]: Analyzing trace with hash -624139302, now seen corresponding path program 5 times [2025-04-14 00:31:47,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:47,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855591872] [2025-04-14 00:31:47,068 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:31:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:47,076 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-14 00:31:47,087 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:31:47,088 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:31:47,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:31:47,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:47,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855591872] [2025-04-14 00:31:47,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855591872] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:47,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970545889] [2025-04-14 00:31:47,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:31:47,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:47,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:47,160 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:31:47,161 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:31:47,209 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-14 00:31:47,247 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:31:47,247 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:31:47,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:47,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:31:47,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:31:47,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:31:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970545889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:47,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-14 00:31:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582118025] [2025-04-14 00:31:47,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:47,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:31:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:47,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:31:47,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:31:47,328 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:47,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 500 flow. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:31:47,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:47,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:47,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:47,414 INFO L116 PetriNetUnfolderBase]: 122/233 cut-off events. [2025-04-14 00:31:47,414 INFO L117 PetriNetUnfolderBase]: For 601/601 co-relation queries the response was YES. [2025-04-14 00:31:47,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 233 events. 122/233 cut-off events. For 601/601 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 703 event pairs, 48 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 1016. Up to 224 conditions per place. [2025-04-14 00:31:47,416 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 53 selfloop transitions, 12 changer transitions 0/65 dead transitions. [2025-04-14 00:31:47,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 642 flow [2025-04-14 00:31:47,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:31:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:31:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2025-04-14 00:31:47,417 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29931972789115646 [2025-04-14 00:31:47,417 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 500 flow. Second operand 7 states and 44 transitions. [2025-04-14 00:31:47,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 642 flow [2025-04-14 00:31:47,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 594 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-04-14 00:31:47,421 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 498 flow [2025-04-14 00:31:47,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=498, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2025-04-14 00:31:47,422 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 45 predicate places. [2025-04-14 00:31:47,422 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 498 flow [2025-04-14 00:31:47,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:31:47,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:47,422 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:47,428 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:31:47,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 00:31:47,623 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:47,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1755865427, now seen corresponding path program 6 times [2025-04-14 00:31:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:47,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944011378] [2025-04-14 00:31:47,624 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:31:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:47,635 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 4 equivalence classes. [2025-04-14 00:31:47,651 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-14 00:31:47,651 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:31:47,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:47,950 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:31:47,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:47,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944011378] [2025-04-14 00:31:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944011378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:47,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:31:47,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:31:47,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716104132] [2025-04-14 00:31:47,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:47,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:31:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:47,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:31:47,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:31:47,951 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:47,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 498 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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:31:47,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:47,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:47,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:48,168 INFO L116 PetriNetUnfolderBase]: 119/229 cut-off events. [2025-04-14 00:31:48,169 INFO L117 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-04-14 00:31:48,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 229 events. 119/229 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 718 event pairs, 14 based on Foata normal form. 4/233 useless extension candidates. Maximal degree in co-relation 889. Up to 65 conditions per place. [2025-04-14 00:31:48,170 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 53 selfloop transitions, 27 changer transitions 7/87 dead transitions. [2025-04-14 00:31:48,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 87 transitions, 729 flow [2025-04-14 00:31:48,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:31:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:31:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2025-04-14 00:31:48,171 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36796536796536794 [2025-04-14 00:31:48,171 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 498 flow. Second operand 11 states and 85 transitions. [2025-04-14 00:31:48,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 87 transitions, 729 flow [2025-04-14 00:31:48,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 705 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:31:48,175 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 500 flow [2025-04-14 00:31:48,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=500, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2025-04-14 00:31:48,175 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2025-04-14 00:31:48,176 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 500 flow [2025-04-14 00:31:48,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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:31:48,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:48,176 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:48,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:31:48,176 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:48,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash -834509539, now seen corresponding path program 7 times [2025-04-14 00:31:48,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:48,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113927996] [2025-04-14 00:31:48,178 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:31:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:48,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:31:48,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:31:48,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:48,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:31:49,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:49,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113927996] [2025-04-14 00:31:49,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113927996] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:49,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422311781] [2025-04-14 00:31:49,345 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:31:49,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:49,347 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:31:49,348 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:31:49,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:31:49,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:31:49,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:49,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:49,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:31:49,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:49,574 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:31:49,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 52 [2025-04-14 00:31:49,619 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:31:49,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:31:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422311781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:31:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 22 [2025-04-14 00:31:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484572559] [2025-04-14 00:31:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:49,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:31:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:49,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:31:49,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:31:49,621 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:49,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:31:49,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:49,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:49,782 INFO L116 PetriNetUnfolderBase]: 116/225 cut-off events. [2025-04-14 00:31:49,782 INFO L117 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2025-04-14 00:31:49,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 225 events. 116/225 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 694 event pairs, 30 based on Foata normal form. 3/228 useless extension candidates. Maximal degree in co-relation 983. Up to 155 conditions per place. [2025-04-14 00:31:49,784 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 58 selfloop transitions, 13 changer transitions 6/77 dead transitions. [2025-04-14 00:31:49,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 77 transitions, 714 flow [2025-04-14 00:31:49,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:31:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:31:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-04-14 00:31:49,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-04-14 00:31:49,786 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 500 flow. Second operand 6 states and 51 transitions. [2025-04-14 00:31:49,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 77 transitions, 714 flow [2025-04-14 00:31:49,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 650 flow, removed 3 selfloop flow, removed 11 redundant places. [2025-04-14 00:31:49,791 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 482 flow [2025-04-14 00:31:49,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2025-04-14 00:31:49,793 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2025-04-14 00:31:49,793 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 482 flow [2025-04-14 00:31:49,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:31:49,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:49,793 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:49,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 00:31:49,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:49,994 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:49,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash -973037689, now seen corresponding path program 8 times [2025-04-14 00:31:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:49,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472032668] [2025-04-14 00:31:49,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:31:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:50,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:31:50,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-14 00:31:50,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:31:50,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:50,310 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:31:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:50,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472032668] [2025-04-14 00:31:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472032668] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:50,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:31:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:31:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625831657] [2025-04-14 00:31:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:50,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:31:50,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:50,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:31:50,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:31:50,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:50,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 482 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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:31:50,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:50,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:50,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:50,506 INFO L116 PetriNetUnfolderBase]: 114/216 cut-off events. [2025-04-14 00:31:50,506 INFO L117 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-04-14 00:31:50,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 216 events. 114/216 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 627 event pairs, 15 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 939. Up to 89 conditions per place. [2025-04-14 00:31:50,508 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 51 selfloop transitions, 24 changer transitions 4/79 dead transitions. [2025-04-14 00:31:50,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 695 flow [2025-04-14 00:31:50,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:31:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:31:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2025-04-14 00:31:50,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2025-04-14 00:31:50,509 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 482 flow. Second operand 10 states and 72 transitions. [2025-04-14 00:31:50,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 695 flow [2025-04-14 00:31:50,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 676 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-14 00:31:50,515 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 506 flow [2025-04-14 00:31:50,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=506, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2025-04-14 00:31:50,516 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2025-04-14 00:31:50,516 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 506 flow [2025-04-14 00:31:50,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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:31:50,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:50,516 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:50,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:31:50,516 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:50,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1640451876, now seen corresponding path program 1 times [2025-04-14 00:31:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:50,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040153118] [2025-04-14 00:31:50,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:50,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:50,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:31:50,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:50,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:50,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:50,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040153118] [2025-04-14 00:31:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040153118] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:50,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276156077] [2025-04-14 00:31:50,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:50,834 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:31:50,835 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:31:50,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:31:50,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:50,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:50,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:50,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:31:50,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:50,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:51,082 INFO L325 Elim1Store]: treesize reduction 11, result has 84.1 percent of original size [2025-04-14 00:31:51,082 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 37 treesize of output 70 [2025-04-14 00:31:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:51,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276156077] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:51,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:51,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-04-14 00:31:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509506942] [2025-04-14 00:31:51,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:51,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:31:51,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:51,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:31:51,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:31:51,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:51,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 506 flow. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:31:51,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:51,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:51,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:51,291 INFO L116 PetriNetUnfolderBase]: 120/223 cut-off events. [2025-04-14 00:31:51,291 INFO L117 PetriNetUnfolderBase]: For 491/491 co-relation queries the response was YES. [2025-04-14 00:31:51,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 223 events. 120/223 cut-off events. For 491/491 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 657 event pairs, 8 based on Foata normal form. 5/228 useless extension candidates. Maximal degree in co-relation 1024. Up to 90 conditions per place. [2025-04-14 00:31:51,294 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 66 selfloop transitions, 16 changer transitions 1/83 dead transitions. [2025-04-14 00:31:51,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 793 flow [2025-04-14 00:31:51,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:31:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:31:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2025-04-14 00:31:51,295 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2025-04-14 00:31:51,295 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 506 flow. Second operand 7 states and 55 transitions. [2025-04-14 00:31:51,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 793 flow [2025-04-14 00:31:51,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 727 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-04-14 00:31:51,300 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 536 flow [2025-04-14 00:31:51,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=536, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2025-04-14 00:31:51,301 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2025-04-14 00:31:51,301 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 536 flow [2025-04-14 00:31:51,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:31:51,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:51,301 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:51,307 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:31:51,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:51,502 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:51,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash -987499551, now seen corresponding path program 1 times [2025-04-14 00:31:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:51,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669961220] [2025-04-14 00:31:51,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:51,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:31:51,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:51,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:51,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:31:51,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:51,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669961220] [2025-04-14 00:31:51,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669961220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:51,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772884393] [2025-04-14 00:31:51,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:51,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:51,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:51,983 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:31:51,984 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:31:52,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:31:52,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:52,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:52,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:52,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:31:52,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:52,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:52,221 INFO L325 Elim1Store]: treesize reduction 11, result has 84.1 percent of original size [2025-04-14 00:31:52,222 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 37 treesize of output 70 [2025-04-14 00:31:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772884393] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:52,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:52,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2025-04-14 00:31:52,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324026870] [2025-04-14 00:31:52,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:52,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:31:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:52,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:31:52,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:31:52,251 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:52,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 536 flow. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:31:52,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:52,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:52,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:52,464 INFO L116 PetriNetUnfolderBase]: 126/233 cut-off events. [2025-04-14 00:31:52,464 INFO L117 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2025-04-14 00:31:52,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 233 events. 126/233 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 680 event pairs, 12 based on Foata normal form. 4/237 useless extension candidates. Maximal degree in co-relation 1025. Up to 106 conditions per place. [2025-04-14 00:31:52,466 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 57 selfloop transitions, 25 changer transitions 0/82 dead transitions. [2025-04-14 00:31:52,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 807 flow [2025-04-14 00:31:52,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:31:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:31:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2025-04-14 00:31:52,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3 [2025-04-14 00:31:52,469 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 536 flow. Second operand 10 states and 63 transitions. [2025-04-14 00:31:52,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 807 flow [2025-04-14 00:31:52,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 771 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-14 00:31:52,475 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 608 flow [2025-04-14 00:31:52,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=608, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-04-14 00:31:52,476 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2025-04-14 00:31:52,476 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 608 flow [2025-04-14 00:31:52,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:31:52,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:52,476 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:52,482 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:31:52,676 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,SelfDestructingSolverStorable10 [2025-04-14 00:31:52,677 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:52,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1097364939, now seen corresponding path program 2 times [2025-04-14 00:31:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:52,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820024910] [2025-04-14 00:31:52,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:31:52,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:52,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:31:52,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:52,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:31:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:52,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820024910] [2025-04-14 00:31:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820024910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:31:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:31:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192210315] [2025-04-14 00:31:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:52,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:31:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:52,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:31:52,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:31:52,971 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:52,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 608 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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:31:52,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:52,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:52,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:53,109 INFO L116 PetriNetUnfolderBase]: 118/222 cut-off events. [2025-04-14 00:31:53,109 INFO L117 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2025-04-14 00:31:53,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 222 events. 118/222 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 655 event pairs, 23 based on Foata normal form. 3/225 useless extension candidates. Maximal degree in co-relation 1022. Up to 125 conditions per place. [2025-04-14 00:31:53,111 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 54 selfloop transitions, 19 changer transitions 5/78 dead transitions. [2025-04-14 00:31:53,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 783 flow [2025-04-14 00:31:53,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:31:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:31:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2025-04-14 00:31:53,112 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3273809523809524 [2025-04-14 00:31:53,112 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 608 flow. Second operand 8 states and 55 transitions. [2025-04-14 00:31:53,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 783 flow [2025-04-14 00:31:53,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 78 transitions, 725 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-04-14 00:31:53,116 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 560 flow [2025-04-14 00:31:53,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=560, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2025-04-14 00:31:53,117 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2025-04-14 00:31:53,117 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 560 flow [2025-04-14 00:31:53,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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:31:53,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:53,117 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:53,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:31:53,117 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:53,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1188618702, now seen corresponding path program 2 times [2025-04-14 00:31:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:53,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986917620] [2025-04-14 00:31:53,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:31:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:53,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:31:53,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:53,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:31:53,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:53,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:53,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986917620] [2025-04-14 00:31:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986917620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:53,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175901301] [2025-04-14 00:31:53,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:31:53,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:53,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:53,406 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:31:53,407 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:31:53,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:31:53,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:53,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:31:53,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:53,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:31:53,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:53,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:53,660 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:31:53,660 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 48 treesize of output 81 [2025-04-14 00:31:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:53,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175901301] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:53,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:53,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2025-04-14 00:31:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216319121] [2025-04-14 00:31:53,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:53,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:31:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:53,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:31:53,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:31:53,720 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:53,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 560 flow. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:31:53,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:53,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:53,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:53,854 INFO L116 PetriNetUnfolderBase]: 125/238 cut-off events. [2025-04-14 00:31:53,854 INFO L117 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2025-04-14 00:31:53,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 238 events. 125/238 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 736 event pairs, 23 based on Foata normal form. 5/243 useless extension candidates. Maximal degree in co-relation 1086. Up to 126 conditions per place. [2025-04-14 00:31:53,856 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 63 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2025-04-14 00:31:53,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 82 transitions, 800 flow [2025-04-14 00:31:53,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:31:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:31:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2025-04-14 00:31:53,857 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2025-04-14 00:31:53,857 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 560 flow. Second operand 7 states and 55 transitions. [2025-04-14 00:31:53,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 82 transitions, 800 flow [2025-04-14 00:31:53,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 82 transitions, 759 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:31:53,860 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 590 flow [2025-04-14 00:31:53,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=590, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2025-04-14 00:31:53,861 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 53 predicate places. [2025-04-14 00:31:53,861 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 590 flow [2025-04-14 00:31:53,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:31:53,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:53,861 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:53,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 00:31:54,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:54,062 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:54,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1601016959, now seen corresponding path program 3 times [2025-04-14 00:31:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:54,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470807076] [2025-04-14 00:31:54,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:31:54,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:54,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-14 00:31:54,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-14 00:31:54,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:31:54,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:54,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470807076] [2025-04-14 00:31:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470807076] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:54,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619450647] [2025-04-14 00:31:54,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:31:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:54,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:54,288 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:31:54,289 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:31:54,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-14 00:31:54,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-14 00:31:54,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:31:54,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:54,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:31:54,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:54,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:54,508 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:31:54,508 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 48 treesize of output 81 [2025-04-14 00:31:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619450647] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:54,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:54,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2025-04-14 00:31:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923320706] [2025-04-14 00:31:54,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:54,550 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:31:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:54,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:31:54,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:31:54,550 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:54,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 590 flow. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:31:54,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:54,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:54,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:54,681 INFO L116 PetriNetUnfolderBase]: 119/231 cut-off events. [2025-04-14 00:31:54,682 INFO L117 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2025-04-14 00:31:54,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 231 events. 119/231 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 718 event pairs, 27 based on Foata normal form. 4/235 useless extension candidates. Maximal degree in co-relation 1078. Up to 148 conditions per place. [2025-04-14 00:31:54,683 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 58 selfloop transitions, 18 changer transitions 0/76 dead transitions. [2025-04-14 00:31:54,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 770 flow [2025-04-14 00:31:54,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:31:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:31:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2025-04-14 00:31:54,684 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35374149659863946 [2025-04-14 00:31:54,684 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 590 flow. Second operand 7 states and 52 transitions. [2025-04-14 00:31:54,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 770 flow [2025-04-14 00:31:54,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 707 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-04-14 00:31:54,687 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 565 flow [2025-04-14 00:31:54,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=565, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-04-14 00:31:54,687 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 53 predicate places. [2025-04-14 00:31:54,688 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 565 flow [2025-04-14 00:31:54,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:31:54,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:54,688 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:54,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 00:31:54,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:54,888 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:54,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:54,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1881854098, now seen corresponding path program 3 times [2025-04-14 00:31:54,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:54,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877227030] [2025-04-14 00:31:54,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:31:54,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:54,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-14 00:31:54,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-14 00:31:54,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:31:54,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:55,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877227030] [2025-04-14 00:31:55,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877227030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:55,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:31:55,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:31:55,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004896200] [2025-04-14 00:31:55,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:55,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:31:55,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:55,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:31:55,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:31:55,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:55,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 565 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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:31:55,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:55,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:55,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:55,203 INFO L116 PetriNetUnfolderBase]: 115/220 cut-off events. [2025-04-14 00:31:55,203 INFO L117 PetriNetUnfolderBase]: For 587/587 co-relation queries the response was YES. [2025-04-14 00:31:55,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 220 events. 115/220 cut-off events. For 587/587 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 668 event pairs, 25 based on Foata normal form. 2/222 useless extension candidates. Maximal degree in co-relation 1026. Up to 137 conditions per place. [2025-04-14 00:31:55,204 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 55 selfloop transitions, 17 changer transitions 2/74 dead transitions. [2025-04-14 00:31:55,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 728 flow [2025-04-14 00:31:55,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:31:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:31:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2025-04-14 00:31:55,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:31:55,205 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 565 flow. Second operand 7 states and 49 transitions. [2025-04-14 00:31:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 728 flow [2025-04-14 00:31:55,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 74 transitions, 704 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-14 00:31:55,208 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 548 flow [2025-04-14 00:31:55,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=548, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2025-04-14 00:31:55,209 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2025-04-14 00:31:55,209 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 548 flow [2025-04-14 00:31:55,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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:31:55,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:55,209 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:55,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:31:55,209 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:55,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -128030375, now seen corresponding path program 4 times [2025-04-14 00:31:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:55,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525350764] [2025-04-14 00:31:55,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:31:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:55,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:31:55,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-14 00:31:55,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:31:55,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:55,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525350764] [2025-04-14 00:31:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525350764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:55,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045177609] [2025-04-14 00:31:55,299 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:31:55,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:55,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:55,301 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:31:55,302 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:31:55,367 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:31:55,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-14 00:31:55,374 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:31:55,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:55,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:31:55,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:55,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:55,493 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:31:55,493 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 48 treesize of output 81 [2025-04-14 00:31:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045177609] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:55,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-14 00:31:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591743800] [2025-04-14 00:31:55,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:55,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:31:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:55,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:31:55,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:31:55,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:55,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 548 flow. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:31:55,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:55,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:55,630 INFO L116 PetriNetUnfolderBase]: 106/201 cut-off events. [2025-04-14 00:31:55,631 INFO L117 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2025-04-14 00:31:55,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 201 events. 106/201 cut-off events. For 632/632 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 562 event pairs, 23 based on Foata normal form. 4/205 useless extension candidates. Maximal degree in co-relation 986. Up to 133 conditions per place. [2025-04-14 00:31:55,632 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 54 selfloop transitions, 17 changer transitions 1/72 dead transitions. [2025-04-14 00:31:55,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 725 flow [2025-04-14 00:31:55,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:31:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:31:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-04-14 00:31:55,632 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2025-04-14 00:31:55,633 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 548 flow. Second operand 5 states and 46 transitions. [2025-04-14 00:31:55,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 725 flow [2025-04-14 00:31:55,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 676 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-14 00:31:55,636 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 523 flow [2025-04-14 00:31:55,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=523, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2025-04-14 00:31:55,636 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2025-04-14 00:31:55,636 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 523 flow [2025-04-14 00:31:55,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:31:55,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:55,636 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:55,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 00:31:55,841 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,SelfDestructingSolverStorable15 [2025-04-14 00:31:55,841 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:55,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash -211409618, now seen corresponding path program 4 times [2025-04-14 00:31:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:55,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483498089] [2025-04-14 00:31:55,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:31:55,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:55,849 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:31:55,853 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-14 00:31:55,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:31:55,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:55,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483498089] [2025-04-14 00:31:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483498089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:55,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269664784] [2025-04-14 00:31:55,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:31:55,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:55,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:55,924 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:31:55,926 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:31:55,997 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:31:56,004 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-14 00:31:56,004 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:31:56,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:56,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:31:56,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:56,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:56,129 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:31:56,129 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 48 treesize of output 81 [2025-04-14 00:31:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269664784] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:56,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:56,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-14 00:31:56,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320147191] [2025-04-14 00:31:56,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:56,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:31:56,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:56,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:31:56,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:31:56,165 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:56,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 523 flow. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:31:56,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:56,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:56,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:56,266 INFO L116 PetriNetUnfolderBase]: 98/188 cut-off events. [2025-04-14 00:31:56,266 INFO L117 PetriNetUnfolderBase]: For 608/608 co-relation queries the response was YES. [2025-04-14 00:31:56,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 188 events. 98/188 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 22 based on Foata normal form. 5/193 useless extension candidates. Maximal degree in co-relation 893. Up to 133 conditions per place. [2025-04-14 00:31:56,268 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 55 selfloop transitions, 16 changer transitions 1/72 dead transitions. [2025-04-14 00:31:56,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 710 flow [2025-04-14 00:31:56,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:31:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:31:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-14 00:31:56,269 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2025-04-14 00:31:56,269 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 523 flow. Second operand 5 states and 47 transitions. [2025-04-14 00:31:56,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 710 flow [2025-04-14 00:31:56,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 72 transitions, 655 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-14 00:31:56,273 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 487 flow [2025-04-14 00:31:56,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=487, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2025-04-14 00:31:56,273 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2025-04-14 00:31:56,274 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 487 flow [2025-04-14 00:31:56,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:31:56,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:56,274 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:56,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-14 00:31:56,474 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,SelfDestructingSolverStorable16 [2025-04-14 00:31:56,474 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:56,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash -100587098, now seen corresponding path program 5 times [2025-04-14 00:31:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:56,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374704853] [2025-04-14 00:31:56,475 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:31:56,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:56,483 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes. [2025-04-14 00:31:56,510 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:56,510 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:31:56,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 00:31:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:56,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374704853] [2025-04-14 00:31:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374704853] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:56,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852765156] [2025-04-14 00:31:56,794 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:31:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:56,796 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:31:56,797 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:31:56,869 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes. [2025-04-14 00:31:56,921 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:31:56,921 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:31:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:56,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:31:56,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:56,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:31:56,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852765156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:31:56,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:31:56,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-04-14 00:31:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480248338] [2025-04-14 00:31:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:31:56,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:31:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:56,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:31:56,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:31:56,992 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:56,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 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:31:56,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:56,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:56,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:57,076 INFO L116 PetriNetUnfolderBase]: 93/174 cut-off events. [2025-04-14 00:31:57,076 INFO L117 PetriNetUnfolderBase]: For 486/486 co-relation queries the response was YES. [2025-04-14 00:31:57,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 174 events. 93/174 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 446 event pairs, 22 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 811. Up to 118 conditions per place. [2025-04-14 00:31:57,077 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 45 selfloop transitions, 17 changer transitions 2/64 dead transitions. [2025-04-14 00:31:57,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 620 flow [2025-04-14 00:31:57,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:31:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:31:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2025-04-14 00:31:57,079 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29931972789115646 [2025-04-14 00:31:57,079 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 487 flow. Second operand 7 states and 44 transitions. [2025-04-14 00:31:57,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 620 flow [2025-04-14 00:31:57,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 580 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-14 00:31:57,081 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 459 flow [2025-04-14 00:31:57,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=459, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2025-04-14 00:31:57,082 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2025-04-14 00:31:57,082 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 459 flow [2025-04-14 00:31:57,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 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:31:57,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:57,082 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:57,089 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:31:57,282 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,SelfDestructingSolverStorable17 [2025-04-14 00:31:57,283 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:57,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -518608412, now seen corresponding path program 1 times [2025-04-14 00:31:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:57,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362065188] [2025-04-14 00:31:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:57,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:31:57,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:31:57,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:57,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:31:57,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:57,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362065188] [2025-04-14 00:31:57,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362065188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:57,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107143593] [2025-04-14 00:31:57,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:31:57,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:57,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:57,843 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:31:57,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 00:31:57,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:31:57,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:31:57,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:31:57,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:57,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:31:57,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:58,071 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:31:58,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:31:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:58,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:58,242 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:31:58,242 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 195 treesize of output 191 [2025-04-14 00:31:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:31:58,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107143593] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:58,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:58,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2025-04-14 00:31:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628738728] [2025-04-14 00:31:58,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:58,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:31:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:58,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:31:58,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:31:58,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:31:58,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 459 flow. Second operand has 25 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:31:58,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:58,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:31:58,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:00,018 INFO L116 PetriNetUnfolderBase]: 212/401 cut-off events. [2025-04-14 00:32:00,019 INFO L117 PetriNetUnfolderBase]: For 749/749 co-relation queries the response was YES. [2025-04-14 00:32:00,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 401 events. 212/401 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1503 event pairs, 12 based on Foata normal form. 5/406 useless extension candidates. Maximal degree in co-relation 1623. Up to 96 conditions per place. [2025-04-14 00:32:00,021 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 93 selfloop transitions, 83 changer transitions 9/185 dead transitions. [2025-04-14 00:32:00,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 185 transitions, 1410 flow [2025-04-14 00:32:00,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 00:32:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 00:32:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 236 transitions. [2025-04-14 00:32:00,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31216931216931215 [2025-04-14 00:32:00,023 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 459 flow. Second operand 36 states and 236 transitions. [2025-04-14 00:32:00,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 185 transitions, 1410 flow [2025-04-14 00:32:00,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 185 transitions, 1360 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-14 00:32:00,027 INFO L231 Difference]: Finished difference. Result has 107 places, 118 transitions, 1032 flow [2025-04-14 00:32:00,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1032, PETRI_PLACES=107, PETRI_TRANSITIONS=118} [2025-04-14 00:32:00,027 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2025-04-14 00:32:00,027 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 118 transitions, 1032 flow [2025-04-14 00:32:00,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:00,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:00,028 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:00,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 00:32:00,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:00,234 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:00,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1671465200, now seen corresponding path program 2 times [2025-04-14 00:32:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:00,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316481575] [2025-04-14 00:32:00,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:00,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:00,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:00,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:00,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:00,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:00,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316481575] [2025-04-14 00:32:00,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316481575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:00,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758003107] [2025-04-14 00:32:00,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:00,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:00,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:00,666 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:32:00,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 00:32:00,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:00,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:00,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:00,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:00,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 00:32:00,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:01,089 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:32:01,089 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:32:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 00:32:01,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:01,434 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-14 00:32:01,434 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 168 treesize of output 212 [2025-04-14 00:32:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758003107] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:02,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 25 [2025-04-14 00:32:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069354526] [2025-04-14 00:32:02,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:02,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 00:32:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 00:32:02,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2025-04-14 00:32:02,571 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:02,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 118 transitions, 1032 flow. Second operand has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:32:02,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:02,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:02,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:03,571 INFO L116 PetriNetUnfolderBase]: 226/428 cut-off events. [2025-04-14 00:32:03,571 INFO L117 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-04-14 00:32:03,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 428 events. 226/428 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1651 event pairs, 7 based on Foata normal form. 7/435 useless extension candidates. Maximal degree in co-relation 2041. Up to 100 conditions per place. [2025-04-14 00:32:03,575 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 91 selfloop transitions, 69 changer transitions 16/176 dead transitions. [2025-04-14 00:32:03,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 176 transitions, 1645 flow [2025-04-14 00:32:03,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:32:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:32:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 152 transitions. [2025-04-14 00:32:03,576 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30158730158730157 [2025-04-14 00:32:03,576 INFO L175 Difference]: Start difference. First operand has 107 places, 118 transitions, 1032 flow. Second operand 24 states and 152 transitions. [2025-04-14 00:32:03,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 176 transitions, 1645 flow [2025-04-14 00:32:03,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 176 transitions, 1370 flow, removed 84 selfloop flow, removed 17 redundant places. [2025-04-14 00:32:03,584 INFO L231 Difference]: Finished difference. Result has 116 places, 125 transitions, 999 flow [2025-04-14 00:32:03,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=999, PETRI_PLACES=116, PETRI_TRANSITIONS=125} [2025-04-14 00:32:03,584 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2025-04-14 00:32:03,584 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 125 transitions, 999 flow [2025-04-14 00:32:03,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:32:03,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:03,584 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:03,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:03,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:03,785 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:03,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1992528716, now seen corresponding path program 3 times [2025-04-14 00:32:03,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:03,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279436205] [2025-04-14 00:32:03,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:03,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:03,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:03,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:32:03,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:03,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:04,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279436205] [2025-04-14 00:32:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279436205] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:04,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344287240] [2025-04-14 00:32:04,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:04,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:04,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:04,150 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:32:04,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 00:32:04,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:04,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:32:04,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:04,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:04,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:32:04,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:04,374 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:32:04,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:32:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:04,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:04,534 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:04,535 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 199 treesize of output 197 [2025-04-14 00:32:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:05,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344287240] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:05,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 18 [2025-04-14 00:32:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294094996] [2025-04-14 00:32:05,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:05,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:32:05,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:05,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:32:05,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-04-14 00:32:05,223 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:05,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 125 transitions, 999 flow. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:32:05,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:05,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:05,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:05,614 INFO L116 PetriNetUnfolderBase]: 228/432 cut-off events. [2025-04-14 00:32:05,614 INFO L117 PetriNetUnfolderBase]: For 1241/1241 co-relation queries the response was YES. [2025-04-14 00:32:05,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 432 events. 228/432 cut-off events. For 1241/1241 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1676 event pairs, 22 based on Foata normal form. 7/433 useless extension candidates. Maximal degree in co-relation 1941. Up to 114 conditions per place. [2025-04-14 00:32:05,616 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 93 selfloop transitions, 61 changer transitions 16/170 dead transitions. [2025-04-14 00:32:05,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 170 transitions, 1515 flow [2025-04-14 00:32:05,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:32:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:32:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 129 transitions. [2025-04-14 00:32:05,617 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3233082706766917 [2025-04-14 00:32:05,617 INFO L175 Difference]: Start difference. First operand has 116 places, 125 transitions, 999 flow. Second operand 19 states and 129 transitions. [2025-04-14 00:32:05,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 170 transitions, 1515 flow [2025-04-14 00:32:05,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 170 transitions, 1384 flow, removed 22 selfloop flow, removed 14 redundant places. [2025-04-14 00:32:05,623 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 1021 flow [2025-04-14 00:32:05,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1021, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2025-04-14 00:32:05,624 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2025-04-14 00:32:05,624 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 1021 flow [2025-04-14 00:32:05,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:32:05,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:05,624 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:05,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 00:32:05,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-14 00:32:05,825 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:05,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1934609246, now seen corresponding path program 4 times [2025-04-14 00:32:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:05,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969654734] [2025-04-14 00:32:05,826 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:05,833 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:05,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-14 00:32:05,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:05,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:05,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:05,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969654734] [2025-04-14 00:32:05,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969654734] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:05,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830527423] [2025-04-14 00:32:05,982 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:05,984 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:32:05,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 00:32:06,067 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:06,074 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-14 00:32:06,074 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:06,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:06,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:32:06,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:06,144 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:32:06,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:32:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:06,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:06,269 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:06,269 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 211 treesize of output 207 [2025-04-14 00:32:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830527423] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:06,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:06,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-14 00:32:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109124159] [2025-04-14 00:32:06,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:06,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:32:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:06,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:32:06,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:32:06,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:06,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 1021 flow. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:32:06,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:06,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:06,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:07,268 INFO L116 PetriNetUnfolderBase]: 247/447 cut-off events. [2025-04-14 00:32:07,268 INFO L117 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2025-04-14 00:32:07,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 447 events. 247/447 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1668 event pairs, 20 based on Foata normal form. 4/445 useless extension candidates. Maximal degree in co-relation 2104. Up to 115 conditions per place. [2025-04-14 00:32:07,271 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 118 selfloop transitions, 71 changer transitions 11/200 dead transitions. [2025-04-14 00:32:07,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 200 transitions, 1792 flow [2025-04-14 00:32:07,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 00:32:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 00:32:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2025-04-14 00:32:07,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2025-04-14 00:32:07,273 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 1021 flow. Second operand 27 states and 198 transitions. [2025-04-14 00:32:07,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 200 transitions, 1792 flow [2025-04-14 00:32:07,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 200 transitions, 1647 flow, removed 27 selfloop flow, removed 12 redundant places. [2025-04-14 00:32:07,279 INFO L231 Difference]: Finished difference. Result has 131 places, 132 transitions, 1181 flow [2025-04-14 00:32:07,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1181, PETRI_PLACES=131, PETRI_TRANSITIONS=132} [2025-04-14 00:32:07,280 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 110 predicate places. [2025-04-14 00:32:07,280 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 132 transitions, 1181 flow [2025-04-14 00:32:07,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:32:07,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:07,280 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:07,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 00:32:07,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:07,480 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:07,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:07,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1944847854, now seen corresponding path program 5 times [2025-04-14 00:32:07,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:07,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181193326] [2025-04-14 00:32:07,481 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:07,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:07,488 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:07,505 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:07,506 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:32:07,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:32:08,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:08,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181193326] [2025-04-14 00:32:08,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181193326] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:08,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589804514] [2025-04-14 00:32:08,240 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:08,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:08,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:08,241 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:32:08,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 00:32:08,326 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:08,369 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:08,370 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:32:08,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:08,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:32:08,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:08,528 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:32:08,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-14 00:32:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:08,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:08,694 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:08,695 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 195 treesize of output 191 [2025-04-14 00:32:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:09,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589804514] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:09,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:09,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 28 [2025-04-14 00:32:09,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303307837] [2025-04-14 00:32:09,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:09,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:32:09,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:09,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:32:09,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:32:09,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:09,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 132 transitions, 1181 flow. Second operand has 29 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 29 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:09,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:09,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:09,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:09,877 INFO L116 PetriNetUnfolderBase]: 298/552 cut-off events. [2025-04-14 00:32:09,877 INFO L117 PetriNetUnfolderBase]: For 1754/1754 co-relation queries the response was YES. [2025-04-14 00:32:09,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 552 events. 298/552 cut-off events. For 1754/1754 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2296 event pairs, 36 based on Foata normal form. 8/554 useless extension candidates. Maximal degree in co-relation 2640. Up to 209 conditions per place. [2025-04-14 00:32:09,881 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 113 selfloop transitions, 84 changer transitions 13/210 dead transitions. [2025-04-14 00:32:09,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 210 transitions, 2027 flow [2025-04-14 00:32:09,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:32:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:32:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 178 transitions. [2025-04-14 00:32:09,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2922824302134647 [2025-04-14 00:32:09,883 INFO L175 Difference]: Start difference. First operand has 131 places, 132 transitions, 1181 flow. Second operand 29 states and 178 transitions. [2025-04-14 00:32:09,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 210 transitions, 2027 flow [2025-04-14 00:32:09,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 210 transitions, 1787 flow, removed 76 selfloop flow, removed 13 redundant places. [2025-04-14 00:32:09,891 INFO L231 Difference]: Finished difference. Result has 153 places, 159 transitions, 1428 flow [2025-04-14 00:32:09,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1428, PETRI_PLACES=153, PETRI_TRANSITIONS=159} [2025-04-14 00:32:09,891 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2025-04-14 00:32:09,892 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 159 transitions, 1428 flow [2025-04-14 00:32:09,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 29 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:09,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:09,892 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:09,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:10,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:10,093 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:10,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1729737664, now seen corresponding path program 6 times [2025-04-14 00:32:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:10,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128859624] [2025-04-14 00:32:10,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:32:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:10,111 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:10,125 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-14 00:32:10,125 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:32:10,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:10,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:10,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128859624] [2025-04-14 00:32:10,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128859624] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:10,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103137196] [2025-04-14 00:32:10,447 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:32:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:10,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:10,449 INFO L229 MonitoredProcess]: Starting monitored process 17 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:32:10,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 00:32:10,535 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:10,557 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-14 00:32:10,557 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:32:10,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:10,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 00:32:10,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:10,759 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:32:10,760 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:32:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:10,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:11,154 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-14 00:32:11,155 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 195 treesize of output 233 [2025-04-14 00:32:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103137196] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:12,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-14 00:32:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292382886] [2025-04-14 00:32:12,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:12,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:32:12,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:12,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:32:12,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:32:12,615 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:12,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 159 transitions, 1428 flow. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:12,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:12,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:12,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:13,390 INFO L116 PetriNetUnfolderBase]: 334/614 cut-off events. [2025-04-14 00:32:13,391 INFO L117 PetriNetUnfolderBase]: For 2073/2073 co-relation queries the response was YES. [2025-04-14 00:32:13,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 614 events. 334/614 cut-off events. For 2073/2073 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2663 event pairs, 25 based on Foata normal form. 6/610 useless extension candidates. Maximal degree in co-relation 2913. Up to 220 conditions per place. [2025-04-14 00:32:13,396 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 124 selfloop transitions, 91 changer transitions 16/231 dead transitions. [2025-04-14 00:32:13,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 231 transitions, 2260 flow [2025-04-14 00:32:13,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:32:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:32:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 168 transitions. [2025-04-14 00:32:13,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-04-14 00:32:13,398 INFO L175 Difference]: Start difference. First operand has 153 places, 159 transitions, 1428 flow. Second operand 25 states and 168 transitions. [2025-04-14 00:32:13,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 231 transitions, 2260 flow [2025-04-14 00:32:13,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 231 transitions, 2139 flow, removed 46 selfloop flow, removed 11 redundant places. [2025-04-14 00:32:13,409 INFO L231 Difference]: Finished difference. Result has 171 places, 178 transitions, 1758 flow [2025-04-14 00:32:13,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1758, PETRI_PLACES=171, PETRI_TRANSITIONS=178} [2025-04-14 00:32:13,410 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 150 predicate places. [2025-04-14 00:32:13,410 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 178 transitions, 1758 flow [2025-04-14 00:32:13,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:13,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:13,410 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:13,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:13,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-14 00:32:13,614 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:13,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1942339644, now seen corresponding path program 7 times [2025-04-14 00:32:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:13,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769171768] [2025-04-14 00:32:13,615 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:32:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:13,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:32:13,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:13,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:32:13,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:32:14,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:14,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769171768] [2025-04-14 00:32:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769171768] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:14,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622072833] [2025-04-14 00:32:14,178 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:32:14,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:14,180 INFO L229 MonitoredProcess]: Starting monitored process 18 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:32:14,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 00:32:14,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:32:14,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:14,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:32:14,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:14,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:32:14,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:14,406 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:32:14,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:32:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:14,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:14,593 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:14,593 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 226 treesize of output 222 [2025-04-14 00:32:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:15,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622072833] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:15,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:15,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 27 [2025-04-14 00:32:15,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640940749] [2025-04-14 00:32:15,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:15,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:32:15,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:15,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:32:15,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:32:15,136 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:15,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 178 transitions, 1758 flow. Second operand has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:32:15,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:15,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:15,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:16,032 INFO L116 PetriNetUnfolderBase]: 347/640 cut-off events. [2025-04-14 00:32:16,032 INFO L117 PetriNetUnfolderBase]: For 2811/2811 co-relation queries the response was YES. [2025-04-14 00:32:16,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3342 conditions, 640 events. 347/640 cut-off events. For 2811/2811 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2799 event pairs, 42 based on Foata normal form. 7/639 useless extension candidates. Maximal degree in co-relation 3300. Up to 238 conditions per place. [2025-04-14 00:32:16,036 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 127 selfloop transitions, 97 changer transitions 14/238 dead transitions. [2025-04-14 00:32:16,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 238 transitions, 2533 flow [2025-04-14 00:32:16,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 00:32:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-14 00:32:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 189 transitions. [2025-04-14 00:32:16,037 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2025-04-14 00:32:16,037 INFO L175 Difference]: Start difference. First operand has 171 places, 178 transitions, 1758 flow. Second operand 33 states and 189 transitions. [2025-04-14 00:32:16,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 238 transitions, 2533 flow [2025-04-14 00:32:16,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 238 transitions, 2399 flow, removed 25 selfloop flow, removed 13 redundant places. [2025-04-14 00:32:16,047 INFO L231 Difference]: Finished difference. Result has 189 places, 184 transitions, 1986 flow [2025-04-14 00:32:16,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1986, PETRI_PLACES=189, PETRI_TRANSITIONS=184} [2025-04-14 00:32:16,047 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 168 predicate places. [2025-04-14 00:32:16,047 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 184 transitions, 1986 flow [2025-04-14 00:32:16,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:32:16,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:16,048 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:16,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 00:32:16,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:16,248 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:16,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1831517124, now seen corresponding path program 8 times [2025-04-14 00:32:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:16,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877589320] [2025-04-14 00:32:16,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:16,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:16,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:16,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:16,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:16,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:16,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877589320] [2025-04-14 00:32:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877589320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:16,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655516302] [2025-04-14 00:32:16,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:16,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:16,714 INFO L229 MonitoredProcess]: Starting monitored process 19 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:32:16,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 00:32:16,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:16,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:16,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:16,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:16,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:32:16,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:17,073 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:32:17,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:32:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 00:32:17,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:17,218 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:17,218 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 215 treesize of output 213 [2025-04-14 00:32:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655516302] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:17,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:17,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 25 [2025-04-14 00:32:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393523530] [2025-04-14 00:32:17,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:17,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 00:32:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:17,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 00:32:17,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-04-14 00:32:17,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:17,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 184 transitions, 1986 flow. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:32:17,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:17,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:17,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:18,534 INFO L116 PetriNetUnfolderBase]: 351/642 cut-off events. [2025-04-14 00:32:18,535 INFO L117 PetriNetUnfolderBase]: For 3596/3596 co-relation queries the response was YES. [2025-04-14 00:32:18,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 642 events. 351/642 cut-off events. For 3596/3596 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2752 event pairs, 44 based on Foata normal form. 13/649 useless extension candidates. Maximal degree in co-relation 3503. Up to 188 conditions per place. [2025-04-14 00:32:18,539 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 124 selfloop transitions, 84 changer transitions 18/226 dead transitions. [2025-04-14 00:32:18,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 226 transitions, 2623 flow [2025-04-14 00:32:18,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:32:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:32:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 145 transitions. [2025-04-14 00:32:18,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2761904761904762 [2025-04-14 00:32:18,541 INFO L175 Difference]: Start difference. First operand has 189 places, 184 transitions, 1986 flow. Second operand 25 states and 145 transitions. [2025-04-14 00:32:18,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 226 transitions, 2623 flow [2025-04-14 00:32:18,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 226 transitions, 2456 flow, removed 19 selfloop flow, removed 27 redundant places. [2025-04-14 00:32:18,554 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 2041 flow [2025-04-14 00:32:18,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2041, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2025-04-14 00:32:18,555 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2025-04-14 00:32:18,555 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 2041 flow [2025-04-14 00:32:18,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:32:18,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:18,555 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:18,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:18,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:18,755 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:18,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2007603346, now seen corresponding path program 9 times [2025-04-14 00:32:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:18,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228022064] [2025-04-14 00:32:18,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:18,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:18,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:32:18,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:18,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:19,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:19,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228022064] [2025-04-14 00:32:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228022064] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:19,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183666053] [2025-04-14 00:32:19,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:19,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:19,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:19,081 INFO L229 MonitoredProcess]: Starting monitored process 20 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:32:19,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 00:32:19,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:19,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:32:19,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:19,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:19,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 00:32:19,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:19,301 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:32:19,301 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:32:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:19,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:19,430 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:19,430 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 195 treesize of output 191 [2025-04-14 00:32:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183666053] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:19,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 18 [2025-04-14 00:32:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858259608] [2025-04-14 00:32:19,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:19,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:32:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:19,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:32:19,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-04-14 00:32:19,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:19,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 2041 flow. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:32:19,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:19,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:19,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:20,416 INFO L116 PetriNetUnfolderBase]: 405/740 cut-off events. [2025-04-14 00:32:20,416 INFO L117 PetriNetUnfolderBase]: For 4420/4420 co-relation queries the response was YES. [2025-04-14 00:32:20,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 740 events. 405/740 cut-off events. For 4420/4420 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3324 event pairs, 45 based on Foata normal form. 5/739 useless extension candidates. Maximal degree in co-relation 4237. Up to 345 conditions per place. [2025-04-14 00:32:20,421 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 165 selfloop transitions, 98 changer transitions 9/272 dead transitions. [2025-04-14 00:32:20,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 272 transitions, 3287 flow [2025-04-14 00:32:20,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:32:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:32:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 175 transitions. [2025-04-14 00:32:20,423 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32051282051282054 [2025-04-14 00:32:20,423 INFO L175 Difference]: Start difference. First operand has 187 places, 184 transitions, 2041 flow. Second operand 26 states and 175 transitions. [2025-04-14 00:32:20,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 272 transitions, 3287 flow [2025-04-14 00:32:20,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 272 transitions, 3161 flow, removed 34 selfloop flow, removed 16 redundant places. [2025-04-14 00:32:20,439 INFO L231 Difference]: Finished difference. Result has 198 places, 215 transitions, 2626 flow [2025-04-14 00:32:20,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2626, PETRI_PLACES=198, PETRI_TRANSITIONS=215} [2025-04-14 00:32:20,439 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 177 predicate places. [2025-04-14 00:32:20,440 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 215 transitions, 2626 flow [2025-04-14 00:32:20,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:32:20,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:20,440 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:20,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:20,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:20,640 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:20,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash 289259640, now seen corresponding path program 10 times [2025-04-14 00:32:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:20,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206190657] [2025-04-14 00:32:20,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:20,648 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:20,650 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-14 00:32:20,650 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:20,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:20,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206190657] [2025-04-14 00:32:20,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206190657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:20,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601441699] [2025-04-14 00:32:20,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:20,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:20,775 INFO L229 MonitoredProcess]: Starting monitored process 21 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:32:20,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 00:32:20,867 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:20,876 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-14 00:32:20,876 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:20,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:32:20,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:20,970 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:32:20,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:32:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:20,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:21,094 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:21,094 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 195 treesize of output 191 [2025-04-14 00:32:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601441699] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:21,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-14 00:32:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229845442] [2025-04-14 00:32:21,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:21,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:32:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:21,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:32:21,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:32:21,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:21,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 215 transitions, 2626 flow. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:32:21,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:21,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:21,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:21,915 INFO L116 PetriNetUnfolderBase]: 456/834 cut-off events. [2025-04-14 00:32:21,915 INFO L117 PetriNetUnfolderBase]: For 6041/6041 co-relation queries the response was YES. [2025-04-14 00:32:21,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 834 events. 456/834 cut-off events. For 6041/6041 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3899 event pairs, 54 based on Foata normal form. 5/833 useless extension candidates. Maximal degree in co-relation 5180. Up to 439 conditions per place. [2025-04-14 00:32:21,920 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 178 selfloop transitions, 102 changer transitions 9/289 dead transitions. [2025-04-14 00:32:21,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 289 transitions, 3863 flow [2025-04-14 00:32:21,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:32:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:32:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 152 transitions. [2025-04-14 00:32:21,921 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.329004329004329 [2025-04-14 00:32:21,921 INFO L175 Difference]: Start difference. First operand has 198 places, 215 transitions, 2626 flow. Second operand 22 states and 152 transitions. [2025-04-14 00:32:21,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 289 transitions, 3863 flow [2025-04-14 00:32:21,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 289 transitions, 3609 flow, removed 94 selfloop flow, removed 9 redundant places. [2025-04-14 00:32:21,940 INFO L231 Difference]: Finished difference. Result has 218 places, 242 transitions, 3058 flow [2025-04-14 00:32:21,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2390, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3058, PETRI_PLACES=218, PETRI_TRANSITIONS=242} [2025-04-14 00:32:21,940 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 197 predicate places. [2025-04-14 00:32:21,940 INFO L485 AbstractCegarLoop]: Abstraction has has 218 places, 242 transitions, 3058 flow [2025-04-14 00:32:21,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:32:21,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:21,941 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:21,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-14 00:32:22,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-14 00:32:22,141 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:22,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -584481040, now seen corresponding path program 11 times [2025-04-14 00:32:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:22,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274662723] [2025-04-14 00:32:22,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:22,151 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:22,169 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:22,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:32:22,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:32:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:22,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274662723] [2025-04-14 00:32:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274662723] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:22,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183720032] [2025-04-14 00:32:22,564 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:22,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:22,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:22,565 INFO L229 MonitoredProcess]: Starting monitored process 22 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:32:22,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 00:32:22,664 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:22,704 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:22,704 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:32:22,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:22,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:32:22,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:22,826 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:32:22,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-14 00:32:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:22,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:22,959 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:22,960 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 195 treesize of output 191 [2025-04-14 00:32:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183720032] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:23,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:23,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2025-04-14 00:32:23,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016706512] [2025-04-14 00:32:23,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:23,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:32:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:23,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:32:23,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:32:23,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:23,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 242 transitions, 3058 flow. Second operand has 22 states, 22 states have (on average 4.045454545454546) internal successors, (89), 22 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:23,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:23,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:23,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:24,140 INFO L116 PetriNetUnfolderBase]: 573/1033 cut-off events. [2025-04-14 00:32:24,140 INFO L117 PetriNetUnfolderBase]: For 10132/10132 co-relation queries the response was YES. [2025-04-14 00:32:24,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6924 conditions, 1033 events. 573/1033 cut-off events. For 10132/10132 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5119 event pairs, 40 based on Foata normal form. 5/1030 useless extension candidates. Maximal degree in co-relation 6864. Up to 367 conditions per place. [2025-04-14 00:32:24,147 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 187 selfloop transitions, 160 changer transitions 11/358 dead transitions. [2025-04-14 00:32:24,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 358 transitions, 5083 flow [2025-04-14 00:32:24,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 00:32:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 00:32:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 197 transitions. [2025-04-14 00:32:24,148 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30261136712749614 [2025-04-14 00:32:24,148 INFO L175 Difference]: Start difference. First operand has 218 places, 242 transitions, 3058 flow. Second operand 31 states and 197 transitions. [2025-04-14 00:32:24,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 358 transitions, 5083 flow [2025-04-14 00:32:24,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 358 transitions, 4834 flow, removed 103 selfloop flow, removed 7 redundant places. [2025-04-14 00:32:24,175 INFO L231 Difference]: Finished difference. Result has 252 places, 293 transitions, 4223 flow [2025-04-14 00:32:24,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4223, PETRI_PLACES=252, PETRI_TRANSITIONS=293} [2025-04-14 00:32:24,176 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 231 predicate places. [2025-04-14 00:32:24,176 INFO L485 AbstractCegarLoop]: Abstraction has has 252 places, 293 transitions, 4223 flow [2025-04-14 00:32:24,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.045454545454546) internal successors, (89), 22 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:24,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:24,176 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:24,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:24,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 00:32:24,377 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:24,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash -471744956, now seen corresponding path program 12 times [2025-04-14 00:32:24,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:24,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261672307] [2025-04-14 00:32:24,377 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:32:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:24,385 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:24,393 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-14 00:32:24,393 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:32:24,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:24,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:24,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261672307] [2025-04-14 00:32:24,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261672307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:24,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297970329] [2025-04-14 00:32:24,724 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:32:24,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:24,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:24,726 INFO L229 MonitoredProcess]: Starting monitored process 23 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:32:24,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 00:32:24,819 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:24,837 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-14 00:32:24,837 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:32:24,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:24,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:32:24,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:25,089 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:32:25,089 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:32:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:25,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:25,474 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-14 00:32:25,474 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 201 treesize of output 245 [2025-04-14 00:32:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:26,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297970329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:26,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:26,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2025-04-14 00:32:26,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724936288] [2025-04-14 00:32:26,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:26,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:32:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:26,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:32:26,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:32:26,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:26,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 293 transitions, 4223 flow. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:32:26,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:26,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:26,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:28,243 INFO L116 PetriNetUnfolderBase]: 676/1204 cut-off events. [2025-04-14 00:32:28,244 INFO L117 PetriNetUnfolderBase]: For 13640/13640 co-relation queries the response was YES. [2025-04-14 00:32:28,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8731 conditions, 1204 events. 676/1204 cut-off events. For 13640/13640 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6145 event pairs, 9 based on Foata normal form. 4/1202 useless extension candidates. Maximal degree in co-relation 8660. Up to 247 conditions per place. [2025-04-14 00:32:28,253 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 170 selfloop transitions, 228 changer transitions 14/412 dead transitions. [2025-04-14 00:32:28,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 412 transitions, 6395 flow [2025-04-14 00:32:28,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 00:32:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 00:32:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 187 transitions. [2025-04-14 00:32:28,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2968253968253968 [2025-04-14 00:32:28,254 INFO L175 Difference]: Start difference. First operand has 252 places, 293 transitions, 4223 flow. Second operand 30 states and 187 transitions. [2025-04-14 00:32:28,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 412 transitions, 6395 flow [2025-04-14 00:32:28,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 412 transitions, 6030 flow, removed 155 selfloop flow, removed 10 redundant places. [2025-04-14 00:32:28,300 INFO L231 Difference]: Finished difference. Result has 282 places, 337 transitions, 5337 flow [2025-04-14 00:32:28,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3900, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5337, PETRI_PLACES=282, PETRI_TRANSITIONS=337} [2025-04-14 00:32:28,300 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 261 predicate places. [2025-04-14 00:32:28,300 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 337 transitions, 5337 flow [2025-04-14 00:32:28,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:32:28,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:28,300 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:28,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-14 00:32:28,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:28,501 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:28,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:28,502 INFO L85 PathProgramCache]: Analyzing trace with hash 291767850, now seen corresponding path program 13 times [2025-04-14 00:32:28,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:28,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386657927] [2025-04-14 00:32:28,502 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:32:28,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:28,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:32:28,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:28,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:32:28,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:32:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:28,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386657927] [2025-04-14 00:32:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386657927] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:28,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136504727] [2025-04-14 00:32:28,991 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:32:28,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:28,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:28,993 INFO L229 MonitoredProcess]: Starting monitored process 24 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:32:28,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 00:32:29,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:32:29,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:29,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:32:29,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:29,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:32:29,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:29,251 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:32:29,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:32:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:29,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:29,395 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:29,395 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 226 treesize of output 222 [2025-04-14 00:32:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136504727] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:30,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:30,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 27 [2025-04-14 00:32:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135608854] [2025-04-14 00:32:30,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:30,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:32:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:30,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:32:30,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:32:30,154 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:30,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 337 transitions, 5337 flow. Second operand has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:32:30,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:30,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:30,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:31,099 INFO L116 PetriNetUnfolderBase]: 690/1230 cut-off events. [2025-04-14 00:32:31,099 INFO L117 PetriNetUnfolderBase]: For 16896/16896 co-relation queries the response was YES. [2025-04-14 00:32:31,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9450 conditions, 1230 events. 690/1230 cut-off events. For 16896/16896 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6310 event pairs, 73 based on Foata normal form. 7/1237 useless extension candidates. Maximal degree in co-relation 9369. Up to 329 conditions per place. [2025-04-14 00:32:31,109 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 192 selfloop transitions, 197 changer transitions 14/403 dead transitions. [2025-04-14 00:32:31,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 403 transitions, 6642 flow [2025-04-14 00:32:31,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 00:32:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-14 00:32:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 188 transitions. [2025-04-14 00:32:31,110 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2712842712842713 [2025-04-14 00:32:31,110 INFO L175 Difference]: Start difference. First operand has 282 places, 337 transitions, 5337 flow. Second operand 33 states and 188 transitions. [2025-04-14 00:32:31,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 403 transitions, 6642 flow [2025-04-14 00:32:31,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 403 transitions, 5959 flow, removed 118 selfloop flow, removed 20 redundant places. [2025-04-14 00:32:31,166 INFO L231 Difference]: Finished difference. Result has 295 places, 344 transitions, 5351 flow [2025-04-14 00:32:31,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4673, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5351, PETRI_PLACES=295, PETRI_TRANSITIONS=344} [2025-04-14 00:32:31,166 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 274 predicate places. [2025-04-14 00:32:31,166 INFO L485 AbstractCegarLoop]: Abstraction has has 295 places, 344 transitions, 5351 flow [2025-04-14 00:32:31,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:32:31,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:31,167 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:31,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:31,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:31,367 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:31,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1952192086, now seen corresponding path program 14 times [2025-04-14 00:32:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:31,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523403310] [2025-04-14 00:32:31,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:31,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:31,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:31,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:31,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:31,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:31,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523403310] [2025-04-14 00:32:31,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523403310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:31,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122750764] [2025-04-14 00:32:31,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:31,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:31,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:31,773 INFO L229 MonitoredProcess]: Starting monitored process 25 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:32:31,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 00:32:31,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:31,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:31,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:31,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:31,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:32:31,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:32,029 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:32:32,030 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:32:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 00:32:32,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:32,187 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:32,187 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 199 treesize of output 197 [2025-04-14 00:32:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:32,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122750764] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:32,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:32,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 19 [2025-04-14 00:32:32,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547234110] [2025-04-14 00:32:32,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:32,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:32:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:32,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:32:32,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:32:32,771 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:32,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 344 transitions, 5351 flow. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:32,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:32,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:32,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:33,575 INFO L116 PetriNetUnfolderBase]: 683/1233 cut-off events. [2025-04-14 00:32:33,575 INFO L117 PetriNetUnfolderBase]: For 17729/17729 co-relation queries the response was YES. [2025-04-14 00:32:33,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9163 conditions, 1233 events. 683/1233 cut-off events. For 17729/17729 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6436 event pairs, 86 based on Foata normal form. 17/1250 useless extension candidates. Maximal degree in co-relation 9086. Up to 443 conditions per place. [2025-04-14 00:32:33,584 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 215 selfloop transitions, 163 changer transitions 23/401 dead transitions. [2025-04-14 00:32:33,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 401 transitions, 6439 flow [2025-04-14 00:32:33,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:32:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:32:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 181 transitions. [2025-04-14 00:32:33,585 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29720853858784896 [2025-04-14 00:32:33,585 INFO L175 Difference]: Start difference. First operand has 295 places, 344 transitions, 5351 flow. Second operand 29 states and 181 transitions. [2025-04-14 00:32:33,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 401 transitions, 6439 flow [2025-04-14 00:32:33,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 401 transitions, 6226 flow, removed 32 selfloop flow, removed 26 redundant places. [2025-04-14 00:32:33,635 INFO L231 Difference]: Finished difference. Result has 300 places, 339 transitions, 5451 flow [2025-04-14 00:32:33,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5009, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5451, PETRI_PLACES=300, PETRI_TRANSITIONS=339} [2025-04-14 00:32:33,636 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 279 predicate places. [2025-04-14 00:32:33,636 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 339 transitions, 5451 flow [2025-04-14 00:32:33,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:33,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:33,636 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:33,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-14 00:32:33,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:33,837 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:33,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2010111556, now seen corresponding path program 15 times [2025-04-14 00:32:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:33,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903335893] [2025-04-14 00:32:33,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:33,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:33,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:32:33,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:33,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:34,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903335893] [2025-04-14 00:32:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903335893] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:34,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249768497] [2025-04-14 00:32:34,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:34,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:34,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:34,155 INFO L229 MonitoredProcess]: Starting monitored process 26 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:32:34,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 00:32:34,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:34,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:32:34,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:34,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:34,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-14 00:32:34,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:34,465 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:32:34,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:32:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:34,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:34,810 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-14 00:32:34,810 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 209 treesize of output 247 [2025-04-14 00:32:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249768497] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:36,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2025-04-14 00:32:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750536077] [2025-04-14 00:32:36,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:36,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:32:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:36,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:32:36,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:32:36,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:36,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 339 transitions, 5451 flow. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:32:36,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:36,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:36,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:37,552 INFO L116 PetriNetUnfolderBase]: 704/1244 cut-off events. [2025-04-14 00:32:37,553 INFO L117 PetriNetUnfolderBase]: For 20281/20281 co-relation queries the response was YES. [2025-04-14 00:32:37,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9615 conditions, 1244 events. 704/1244 cut-off events. For 20281/20281 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6356 event pairs, 74 based on Foata normal form. 10/1254 useless extension candidates. Maximal degree in co-relation 9536. Up to 413 conditions per place. [2025-04-14 00:32:37,561 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 214 selfloop transitions, 169 changer transitions 14/397 dead transitions. [2025-04-14 00:32:37,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 397 transitions, 6792 flow [2025-04-14 00:32:37,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:32:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:32:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 154 transitions. [2025-04-14 00:32:37,562 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2025-04-14 00:32:37,562 INFO L175 Difference]: Start difference. First operand has 300 places, 339 transitions, 5451 flow. Second operand 26 states and 154 transitions. [2025-04-14 00:32:37,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 397 transitions, 6792 flow [2025-04-14 00:32:37,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 397 transitions, 6599 flow, removed 61 selfloop flow, removed 17 redundant places. [2025-04-14 00:32:37,618 INFO L231 Difference]: Finished difference. Result has 307 places, 352 transitions, 5998 flow [2025-04-14 00:32:37,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5256, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5998, PETRI_PLACES=307, PETRI_TRANSITIONS=352} [2025-04-14 00:32:37,619 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 286 predicate places. [2025-04-14 00:32:37,619 INFO L485 AbstractCegarLoop]: Abstraction has has 307 places, 352 transitions, 5998 flow [2025-04-14 00:32:37,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:32:37,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:37,619 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:37,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 00:32:37,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-14 00:32:37,820 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:37,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:37,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1106191420, now seen corresponding path program 16 times [2025-04-14 00:32:37,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:37,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566758633] [2025-04-14 00:32:37,820 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:37,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:37,827 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:37,831 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-14 00:32:37,831 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:37,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:37,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566758633] [2025-04-14 00:32:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566758633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:37,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130343014] [2025-04-14 00:32:37,989 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:37,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:37,991 INFO L229 MonitoredProcess]: Starting monitored process 27 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:32:37,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 00:32:38,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:32:38,102 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-14 00:32:38,102 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:38,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:38,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:32:38,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:38,180 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:32:38,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:32:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:38,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:38,331 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:38,331 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 215 treesize of output 213 [2025-04-14 00:32:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:38,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130343014] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:38,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:38,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-14 00:32:38,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422521495] [2025-04-14 00:32:38,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:38,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:32:38,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:38,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:32:38,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:32:38,754 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:38,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 352 transitions, 5998 flow. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:32:38,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:38,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:38,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:39,217 INFO L116 PetriNetUnfolderBase]: 723/1261 cut-off events. [2025-04-14 00:32:39,218 INFO L117 PetriNetUnfolderBase]: For 22705/22705 co-relation queries the response was YES. [2025-04-14 00:32:39,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10102 conditions, 1261 events. 723/1261 cut-off events. For 22705/22705 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6359 event pairs, 66 based on Foata normal form. 3/1264 useless extension candidates. Maximal degree in co-relation 10018. Up to 571 conditions per place. [2025-04-14 00:32:39,227 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 213 selfloop transitions, 169 changer transitions 8/390 dead transitions. [2025-04-14 00:32:39,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 390 transitions, 7161 flow [2025-04-14 00:32:39,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 00:32:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 00:32:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2025-04-14 00:32:39,228 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35034013605442177 [2025-04-14 00:32:39,228 INFO L175 Difference]: Start difference. First operand has 307 places, 352 transitions, 5998 flow. Second operand 14 states and 103 transitions. [2025-04-14 00:32:39,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 390 transitions, 7161 flow [2025-04-14 00:32:39,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 390 transitions, 6797 flow, removed 81 selfloop flow, removed 16 redundant places. [2025-04-14 00:32:39,291 INFO L231 Difference]: Finished difference. Result has 301 places, 357 transitions, 6169 flow [2025-04-14 00:32:39,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5673, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6169, PETRI_PLACES=301, PETRI_TRANSITIONS=357} [2025-04-14 00:32:39,292 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 280 predicate places. [2025-04-14 00:32:39,292 INFO L485 AbstractCegarLoop]: Abstraction has has 301 places, 357 transitions, 6169 flow [2025-04-14 00:32:39,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:32:39,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:39,292 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:39,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-14 00:32:39,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-14 00:32:39,493 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:39,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash -581972830, now seen corresponding path program 17 times [2025-04-14 00:32:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:39,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492711486] [2025-04-14 00:32:39,493 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:39,500 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:39,512 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:39,512 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:32:39,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:32:40,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:40,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492711486] [2025-04-14 00:32:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492711486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:40,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846745415] [2025-04-14 00:32:40,059 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:40,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:40,061 INFO L229 MonitoredProcess]: Starting monitored process 28 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:32:40,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 00:32:40,167 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:40,219 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:32:40,219 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:32:40,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:40,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:32:40,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:40,373 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:32:40,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:32:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:40,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:40,512 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:40,512 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 211 treesize of output 207 [2025-04-14 00:32:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:40,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846745415] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:40,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 7] total 26 [2025-04-14 00:32:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921195355] [2025-04-14 00:32:40,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:40,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 00:32:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:40,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 00:32:40,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2025-04-14 00:32:40,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:40,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 357 transitions, 6169 flow. Second operand has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:32:40,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:40,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:40,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:41,776 INFO L116 PetriNetUnfolderBase]: 746/1292 cut-off events. [2025-04-14 00:32:41,776 INFO L117 PetriNetUnfolderBase]: For 23594/23594 co-relation queries the response was YES. [2025-04-14 00:32:41,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10148 conditions, 1292 events. 746/1292 cut-off events. For 23594/23594 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6481 event pairs, 66 based on Foata normal form. 4/1296 useless extension candidates. Maximal degree in co-relation 10067. Up to 562 conditions per place. [2025-04-14 00:32:41,785 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 214 selfloop transitions, 191 changer transitions 10/415 dead transitions. [2025-04-14 00:32:41,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 415 transitions, 7473 flow [2025-04-14 00:32:41,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:32:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:32:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 168 transitions. [2025-04-14 00:32:41,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2025-04-14 00:32:41,786 INFO L175 Difference]: Start difference. First operand has 301 places, 357 transitions, 6169 flow. Second operand 26 states and 168 transitions. [2025-04-14 00:32:41,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 415 transitions, 7473 flow [2025-04-14 00:32:41,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 415 transitions, 7212 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-04-14 00:32:41,843 INFO L231 Difference]: Finished difference. Result has 318 places, 364 transitions, 6502 flow [2025-04-14 00:32:41,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5890, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6502, PETRI_PLACES=318, PETRI_TRANSITIONS=364} [2025-04-14 00:32:41,844 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 297 predicate places. [2025-04-14 00:32:41,844 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 364 transitions, 6502 flow [2025-04-14 00:32:41,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:32:41,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:41,844 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:41,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-14 00:32:42,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-14 00:32:42,044 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:42,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash 402590370, now seen corresponding path program 18 times [2025-04-14 00:32:42,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:42,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586725739] [2025-04-14 00:32:42,045 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:32:42,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:42,052 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:42,062 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-14 00:32:42,062 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:32:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:42,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:42,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586725739] [2025-04-14 00:32:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586725739] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:42,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959325553] [2025-04-14 00:32:42,410 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:32:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:42,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:42,411 INFO L229 MonitoredProcess]: Starting monitored process 29 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:32:42,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 00:32:42,521 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:32:42,539 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-14 00:32:42,539 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:32:42,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:42,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:32:42,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:42,702 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:32:42,702 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:32:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:42,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:42,845 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:32:42,845 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 215 treesize of output 213 [2025-04-14 00:32:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959325553] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:43,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:43,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-14 00:32:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352524111] [2025-04-14 00:32:43,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:43,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 00:32:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:43,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 00:32:43,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-04-14 00:32:43,442 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:43,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 364 transitions, 6502 flow. Second operand has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:43,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:43,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:43,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:44,114 INFO L116 PetriNetUnfolderBase]: 731/1275 cut-off events. [2025-04-14 00:32:44,114 INFO L117 PetriNetUnfolderBase]: For 26334/26334 co-relation queries the response was YES. [2025-04-14 00:32:44,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10189 conditions, 1275 events. 731/1275 cut-off events. For 26334/26334 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6437 event pairs, 84 based on Foata normal form. 16/1291 useless extension candidates. Maximal degree in co-relation 10105. Up to 382 conditions per place. [2025-04-14 00:32:44,124 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 217 selfloop transitions, 165 changer transitions 18/400 dead transitions. [2025-04-14 00:32:44,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 400 transitions, 7483 flow [2025-04-14 00:32:44,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:32:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:32:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2025-04-14 00:32:44,125 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2813852813852814 [2025-04-14 00:32:44,125 INFO L175 Difference]: Start difference. First operand has 318 places, 364 transitions, 6502 flow. Second operand 22 states and 130 transitions. [2025-04-14 00:32:44,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 400 transitions, 7483 flow [2025-04-14 00:32:44,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 400 transitions, 7238 flow, removed 29 selfloop flow, removed 20 redundant places. [2025-04-14 00:32:44,188 INFO L231 Difference]: Finished difference. Result has 320 places, 358 transitions, 6539 flow [2025-04-14 00:32:44,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6092, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6539, PETRI_PLACES=320, PETRI_TRANSITIONS=358} [2025-04-14 00:32:44,188 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 299 predicate places. [2025-04-14 00:32:44,188 INFO L485 AbstractCegarLoop]: Abstraction has has 320 places, 358 transitions, 6539 flow [2025-04-14 00:32:44,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:44,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:44,188 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:44,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-14 00:32:44,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:44,391 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:44,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash -455979443, now seen corresponding path program 19 times [2025-04-14 00:32:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:44,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141571536] [2025-04-14 00:32:44,392 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:32:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:44,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:32:44,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:44,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:32:44,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:32:44,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:44,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141571536] [2025-04-14 00:32:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141571536] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:44,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799473628] [2025-04-14 00:32:44,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:32:44,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:44,800 INFO L229 MonitoredProcess]: Starting monitored process 30 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:32:44,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 00:32:44,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:32:44,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:44,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:32:44,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:44,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:32:44,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:45,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:45,081 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:32:45,082 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 48 treesize of output 81 [2025-04-14 00:32:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799473628] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:45,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 23 [2025-04-14 00:32:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408077432] [2025-04-14 00:32:45,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:45,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:32:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:45,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:32:45,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:32:45,128 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:45,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 358 transitions, 6539 flow. Second operand has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:45,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:45,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:45,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:45,699 INFO L116 PetriNetUnfolderBase]: 702/1211 cut-off events. [2025-04-14 00:32:45,699 INFO L117 PetriNetUnfolderBase]: For 29187/29187 co-relation queries the response was YES. [2025-04-14 00:32:45,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 1211 events. 702/1211 cut-off events. For 29187/29187 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5970 event pairs, 122 based on Foata normal form. 20/1231 useless extension candidates. Maximal degree in co-relation 9948. Up to 746 conditions per place. [2025-04-14 00:32:45,708 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 279 selfloop transitions, 96 changer transitions 0/375 dead transitions. [2025-04-14 00:32:45,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 375 transitions, 7190 flow [2025-04-14 00:32:45,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:32:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:32:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 131 transitions. [2025-04-14 00:32:45,709 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3119047619047619 [2025-04-14 00:32:45,709 INFO L175 Difference]: Start difference. First operand has 320 places, 358 transitions, 6539 flow. Second operand 20 states and 131 transitions. [2025-04-14 00:32:45,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 375 transitions, 7190 flow [2025-04-14 00:32:45,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 375 transitions, 6969 flow, removed 47 selfloop flow, removed 14 redundant places. [2025-04-14 00:32:45,778 INFO L231 Difference]: Finished difference. Result has 313 places, 347 transitions, 6358 flow [2025-04-14 00:32:45,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6114, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6358, PETRI_PLACES=313, PETRI_TRANSITIONS=347} [2025-04-14 00:32:45,778 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 292 predicate places. [2025-04-14 00:32:45,778 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 347 transitions, 6358 flow [2025-04-14 00:32:45,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:45,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:45,779 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:45,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:45,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-14 00:32:45,979 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:45,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash 130530640, now seen corresponding path program 20 times [2025-04-14 00:32:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:45,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56471511] [2025-04-14 00:32:45,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:45,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:32:46,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:46,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:46,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:46,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56471511] [2025-04-14 00:32:46,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56471511] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:46,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911447913] [2025-04-14 00:32:46,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:46,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:46,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:46,267 INFO L229 MonitoredProcess]: Starting monitored process 31 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:32:46,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-14 00:32:46,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:32:46,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:46,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:46,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-14 00:32:46,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 00:32:46,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:46,660 INFO L325 Elim1Store]: treesize reduction 43, result has 72.4 percent of original size [2025-04-14 00:32:46,661 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 62 treesize of output 128 [2025-04-14 00:32:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911447913] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:46,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2025-04-14 00:32:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645852370] [2025-04-14 00:32:46,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:46,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:32:46,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:46,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:32:46,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:32:46,703 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:46,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 347 transitions, 6358 flow. Second operand has 20 states, 20 states have (on average 4.15) internal successors, (83), 20 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:32:46,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:46,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:46,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:47,126 INFO L116 PetriNetUnfolderBase]: 734/1270 cut-off events. [2025-04-14 00:32:47,126 INFO L117 PetriNetUnfolderBase]: For 29300/29300 co-relation queries the response was YES. [2025-04-14 00:32:47,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10457 conditions, 1270 events. 734/1270 cut-off events. For 29300/29300 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6352 event pairs, 141 based on Foata normal form. 12/1282 useless extension candidates. Maximal degree in co-relation 10375. Up to 828 conditions per place. [2025-04-14 00:32:47,136 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 305 selfloop transitions, 87 changer transitions 0/392 dead transitions. [2025-04-14 00:32:47,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 392 transitions, 7569 flow [2025-04-14 00:32:47,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:32:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:32:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 112 transitions. [2025-04-14 00:32:47,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:32:47,137 INFO L175 Difference]: Start difference. First operand has 313 places, 347 transitions, 6358 flow. Second operand 16 states and 112 transitions. [2025-04-14 00:32:47,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 392 transitions, 7569 flow [2025-04-14 00:32:47,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 392 transitions, 7362 flow, removed 6 selfloop flow, removed 17 redundant places. [2025-04-14 00:32:47,203 INFO L231 Difference]: Finished difference. Result has 313 places, 355 transitions, 6440 flow [2025-04-14 00:32:47,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6161, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6440, PETRI_PLACES=313, PETRI_TRANSITIONS=355} [2025-04-14 00:32:47,204 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 292 predicate places. [2025-04-14 00:32:47,204 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 355 transitions, 6440 flow [2025-04-14 00:32:47,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.15) internal successors, (83), 20 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:32:47,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:47,204 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:47,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-14 00:32:47,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-14 00:32:47,405 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:47,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1589165717, now seen corresponding path program 21 times [2025-04-14 00:32:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:47,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546218516] [2025-04-14 00:32:47,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:47,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-14 00:32:47,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-14 00:32:47,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:47,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:47,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:47,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546218516] [2025-04-14 00:32:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546218516] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:47,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391441487] [2025-04-14 00:32:47,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:47,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:47,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:47,664 INFO L229 MonitoredProcess]: Starting monitored process 32 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:32:47,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-14 00:32:47,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-14 00:32:47,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-14 00:32:47,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:47,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:47,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:32:47,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:47,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:47,966 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:32:47,967 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 50 treesize of output 87 [2025-04-14 00:32:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391441487] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:48,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:48,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-04-14 00:32:48,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349353817] [2025-04-14 00:32:48,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:48,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:32:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:48,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:32:48,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:32:48,009 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:48,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 355 transitions, 6440 flow. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:48,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:48,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:48,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:48,376 INFO L116 PetriNetUnfolderBase]: 745/1292 cut-off events. [2025-04-14 00:32:48,376 INFO L117 PetriNetUnfolderBase]: For 29360/29360 co-relation queries the response was YES. [2025-04-14 00:32:48,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10651 conditions, 1292 events. 745/1292 cut-off events. For 29360/29360 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6525 event pairs, 201 based on Foata normal form. 10/1302 useless extension candidates. Maximal degree in co-relation 10567. Up to 1126 conditions per place. [2025-04-14 00:32:48,385 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 335 selfloop transitions, 45 changer transitions 0/380 dead transitions. [2025-04-14 00:32:48,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 380 transitions, 7396 flow [2025-04-14 00:32:48,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:32:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:32:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2025-04-14 00:32:48,386 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31868131868131866 [2025-04-14 00:32:48,386 INFO L175 Difference]: Start difference. First operand has 313 places, 355 transitions, 6440 flow. Second operand 13 states and 87 transitions. [2025-04-14 00:32:48,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 380 transitions, 7396 flow [2025-04-14 00:32:48,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 380 transitions, 7219 flow, removed 12 selfloop flow, removed 10 redundant places. [2025-04-14 00:32:48,466 INFO L231 Difference]: Finished difference. Result has 317 places, 358 transitions, 6414 flow [2025-04-14 00:32:48,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6214, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6414, PETRI_PLACES=317, PETRI_TRANSITIONS=358} [2025-04-14 00:32:48,466 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 296 predicate places. [2025-04-14 00:32:48,466 INFO L485 AbstractCegarLoop]: Abstraction has has 317 places, 358 transitions, 6414 flow [2025-04-14 00:32:48,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:48,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:48,467 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:48,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:48,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-14 00:32:48,667 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:48,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -656296654, now seen corresponding path program 22 times [2025-04-14 00:32:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:48,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485067572] [2025-04-14 00:32:48,668 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:48,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:32:48,678 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 27 statements. [2025-04-14 00:32:48,678 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:48,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:48,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485067572] [2025-04-14 00:32:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485067572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:48,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525148360] [2025-04-14 00:32:48,762 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:48,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:48,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:48,764 INFO L229 MonitoredProcess]: Starting monitored process 33 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:32:48,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-14 00:32:48,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:32:48,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 27 statements. [2025-04-14 00:32:48,888 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:48,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:48,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:32:48,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:48,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:49,010 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:32:49,010 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 48 treesize of output 81 [2025-04-14 00:32:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525148360] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:49,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-14 00:32:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956491682] [2025-04-14 00:32:49,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:49,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:32:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:49,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:32:49,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:32:49,059 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:49,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 358 transitions, 6414 flow. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:32:49,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:49,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:49,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:49,376 INFO L116 PetriNetUnfolderBase]: 726/1275 cut-off events. [2025-04-14 00:32:49,377 INFO L117 PetriNetUnfolderBase]: For 28093/28093 co-relation queries the response was YES. [2025-04-14 00:32:49,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10425 conditions, 1275 events. 726/1275 cut-off events. For 28093/28093 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6526 event pairs, 204 based on Foata normal form. 12/1287 useless extension candidates. Maximal degree in co-relation 10339. Up to 1125 conditions per place. [2025-04-14 00:32:49,386 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 341 selfloop transitions, 41 changer transitions 0/382 dead transitions. [2025-04-14 00:32:49,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 382 transitions, 7384 flow [2025-04-14 00:32:49,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:32:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:32:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2025-04-14 00:32:49,386 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-04-14 00:32:49,386 INFO L175 Difference]: Start difference. First operand has 317 places, 358 transitions, 6414 flow. Second operand 11 states and 84 transitions. [2025-04-14 00:32:49,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 382 transitions, 7384 flow [2025-04-14 00:32:49,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 382 transitions, 7285 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-04-14 00:32:49,457 INFO L231 Difference]: Finished difference. Result has 318 places, 354 transitions, 6303 flow [2025-04-14 00:32:49,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6166, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6303, PETRI_PLACES=318, PETRI_TRANSITIONS=354} [2025-04-14 00:32:49,458 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 297 predicate places. [2025-04-14 00:32:49,458 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 354 transitions, 6303 flow [2025-04-14 00:32:49,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:32:49,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:49,458 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:49,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-14 00:32:49,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-14 00:32:49,658 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:49,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash -417573954, now seen corresponding path program 23 times [2025-04-14 00:32:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:49,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428561164] [2025-04-14 00:32:49,659 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:49,667 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-14 00:32:49,682 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:49,682 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:32:49,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:32:50,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:50,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428561164] [2025-04-14 00:32:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428561164] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:50,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941047152] [2025-04-14 00:32:50,403 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:50,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:50,406 INFO L229 MonitoredProcess]: Starting monitored process 34 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:32:50,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-14 00:32:50,542 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-14 00:32:50,587 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:50,587 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:32:50,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:50,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:32:50,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:50,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:50,797 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:32:50,797 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 46 treesize of output 83 [2025-04-14 00:32:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941047152] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:50,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:50,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 7] total 28 [2025-04-14 00:32:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614670419] [2025-04-14 00:32:50,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:50,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:32:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:50,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:32:50,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:32:50,827 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:50,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 354 transitions, 6303 flow. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:32:50,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:50,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:50,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:51,320 INFO L116 PetriNetUnfolderBase]: 722/1279 cut-off events. [2025-04-14 00:32:51,321 INFO L117 PetriNetUnfolderBase]: For 28626/28626 co-relation queries the response was YES. [2025-04-14 00:32:51,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10488 conditions, 1279 events. 722/1279 cut-off events. For 28626/28626 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6539 event pairs, 169 based on Foata normal form. 8/1287 useless extension candidates. Maximal degree in co-relation 10400. Up to 939 conditions per place. [2025-04-14 00:32:51,331 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 281 selfloop transitions, 98 changer transitions 0/379 dead transitions. [2025-04-14 00:32:51,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 379 transitions, 7255 flow [2025-04-14 00:32:51,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:32:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:32:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 101 transitions. [2025-04-14 00:32:51,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28291316526610644 [2025-04-14 00:32:51,332 INFO L175 Difference]: Start difference. First operand has 318 places, 354 transitions, 6303 flow. Second operand 17 states and 101 transitions. [2025-04-14 00:32:51,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 379 transitions, 7255 flow [2025-04-14 00:32:51,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 379 transitions, 7151 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-04-14 00:32:51,409 INFO L231 Difference]: Finished difference. Result has 327 places, 363 transitions, 6487 flow [2025-04-14 00:32:51,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6095, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6487, PETRI_PLACES=327, PETRI_TRANSITIONS=363} [2025-04-14 00:32:51,410 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 306 predicate places. [2025-04-14 00:32:51,410 INFO L485 AbstractCegarLoop]: Abstraction has has 327 places, 363 transitions, 6487 flow [2025-04-14 00:32:51,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:32:51,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:51,410 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:51,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:51,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-04-14 00:32:51,611 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:51,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash -973300877, now seen corresponding path program 24 times [2025-04-14 00:32:51,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:51,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354506211] [2025-04-14 00:32:51,612 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:32:51,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:51,620 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-14 00:32:51,634 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 27 statements. [2025-04-14 00:32:51,634 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:32:51,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:51,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354506211] [2025-04-14 00:32:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354506211] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:51,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390775627] [2025-04-14 00:32:51,872 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:32:51,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:51,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:51,874 INFO L229 MonitoredProcess]: Starting monitored process 35 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:32:51,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-14 00:32:52,012 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-14 00:32:52,030 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 27 statements. [2025-04-14 00:32:52,030 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:32:52,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:52,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 00:32:52,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:52,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:52,149 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:32:52,149 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 48 treesize of output 81 [2025-04-14 00:32:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:52,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390775627] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:52,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:52,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 17 [2025-04-14 00:32:52,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233141223] [2025-04-14 00:32:52,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:52,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:32:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:52,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:32:52,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:32:52,200 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:52,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 363 transitions, 6487 flow. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:32:52,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:52,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:52,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:52,609 INFO L116 PetriNetUnfolderBase]: 701/1253 cut-off events. [2025-04-14 00:32:52,610 INFO L117 PetriNetUnfolderBase]: For 28953/28953 co-relation queries the response was YES. [2025-04-14 00:32:52,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10271 conditions, 1253 events. 701/1253 cut-off events. For 28953/28953 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6448 event pairs, 153 based on Foata normal form. 14/1267 useless extension candidates. Maximal degree in co-relation 10182. Up to 873 conditions per place. [2025-04-14 00:32:52,620 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 288 selfloop transitions, 98 changer transitions 0/386 dead transitions. [2025-04-14 00:32:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 386 transitions, 7245 flow [2025-04-14 00:32:52,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 00:32:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 00:32:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 102 transitions. [2025-04-14 00:32:52,621 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3469387755102041 [2025-04-14 00:32:52,621 INFO L175 Difference]: Start difference. First operand has 327 places, 363 transitions, 6487 flow. Second operand 14 states and 102 transitions. [2025-04-14 00:32:52,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 386 transitions, 7245 flow [2025-04-14 00:32:52,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 386 transitions, 6976 flow, removed 36 selfloop flow, removed 15 redundant places. [2025-04-14 00:32:52,693 INFO L231 Difference]: Finished difference. Result has 320 places, 355 transitions, 6214 flow [2025-04-14 00:32:52,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5984, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6214, PETRI_PLACES=320, PETRI_TRANSITIONS=355} [2025-04-14 00:32:52,693 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 299 predicate places. [2025-04-14 00:32:52,694 INFO L485 AbstractCegarLoop]: Abstraction has has 320 places, 355 transitions, 6214 flow [2025-04-14 00:32:52,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:32:52,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:52,694 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:52,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-04-14 00:32:52,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:52,894 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:52,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:52,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1896968054, now seen corresponding path program 25 times [2025-04-14 00:32:52,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:52,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353375389] [2025-04-14 00:32:52,895 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:32:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:52,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:32:52,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:52,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:32:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:32:53,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:53,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353375389] [2025-04-14 00:32:53,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353375389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:53,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393281216] [2025-04-14 00:32:53,291 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:32:53,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:53,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:53,293 INFO L229 MonitoredProcess]: Starting monitored process 36 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:32:53,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-14 00:32:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:32:53,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:53,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:32:53,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:53,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:32:53,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:53,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:53,593 INFO L325 Elim1Store]: treesize reduction 11, result has 84.9 percent of original size [2025-04-14 00:32:53,593 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 41 treesize of output 74 [2025-04-14 00:32:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393281216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:53,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:53,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 22 [2025-04-14 00:32:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750029022] [2025-04-14 00:32:53,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:53,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:32:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:53,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:32:53,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:32:53,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:53,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 355 transitions, 6214 flow. Second operand has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:53,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:53,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:53,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:54,061 INFO L116 PetriNetUnfolderBase]: 687/1230 cut-off events. [2025-04-14 00:32:54,061 INFO L117 PetriNetUnfolderBase]: For 26086/26086 co-relation queries the response was YES. [2025-04-14 00:32:54,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10092 conditions, 1230 events. 687/1230 cut-off events. For 26086/26086 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6270 event pairs, 24 based on Foata normal form. 8/1234 useless extension candidates. Maximal degree in co-relation 10006. Up to 860 conditions per place. [2025-04-14 00:32:54,070 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 268 selfloop transitions, 97 changer transitions 0/365 dead transitions. [2025-04-14 00:32:54,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 365 transitions, 6986 flow [2025-04-14 00:32:54,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:32:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:32:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2025-04-14 00:32:54,071 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25595238095238093 [2025-04-14 00:32:54,071 INFO L175 Difference]: Start difference. First operand has 320 places, 355 transitions, 6214 flow. Second operand 16 states and 86 transitions. [2025-04-14 00:32:54,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 365 transitions, 6986 flow [2025-04-14 00:32:54,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 365 transitions, 6823 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-04-14 00:32:54,142 INFO L231 Difference]: Finished difference. Result has 321 places, 351 transitions, 6185 flow [2025-04-14 00:32:54,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5954, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6185, PETRI_PLACES=321, PETRI_TRANSITIONS=351} [2025-04-14 00:32:54,143 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 300 predicate places. [2025-04-14 00:32:54,143 INFO L485 AbstractCegarLoop]: Abstraction has has 321 places, 351 transitions, 6185 flow [2025-04-14 00:32:54,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:54,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:54,143 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:54,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-14 00:32:54,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-14 00:32:54,343 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:54,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash -890094614, now seen corresponding path program 26 times [2025-04-14 00:32:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:54,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268279621] [2025-04-14 00:32:54,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:54,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:32:54,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:54,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:54,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:54,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268279621] [2025-04-14 00:32:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268279621] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:54,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371324994] [2025-04-14 00:32:54,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:32:54,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:54,617 INFO L229 MonitoredProcess]: Starting monitored process 37 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:32:54,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-14 00:32:54,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:32:54,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:32:54,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:54,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:54,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:32:54,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 00:32:54,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:54,911 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:32:54,911 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 48 treesize of output 81 [2025-04-14 00:32:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371324994] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:54,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 18 [2025-04-14 00:32:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091227001] [2025-04-14 00:32:54,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:54,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:32:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:54,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:32:54,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:32:54,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:54,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 351 transitions, 6185 flow. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:32:54,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:54,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:54,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:55,342 INFO L116 PetriNetUnfolderBase]: 658/1181 cut-off events. [2025-04-14 00:32:55,342 INFO L117 PetriNetUnfolderBase]: For 25848/25848 co-relation queries the response was YES. [2025-04-14 00:32:55,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9666 conditions, 1181 events. 658/1181 cut-off events. For 25848/25848 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5999 event pairs, 137 based on Foata normal form. 14/1195 useless extension candidates. Maximal degree in co-relation 9582. Up to 781 conditions per place. [2025-04-14 00:32:55,352 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 259 selfloop transitions, 109 changer transitions 0/368 dead transitions. [2025-04-14 00:32:55,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 368 transitions, 6841 flow [2025-04-14 00:32:55,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:32:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:32:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 106 transitions. [2025-04-14 00:32:55,352 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2025-04-14 00:32:55,352 INFO L175 Difference]: Start difference. First operand has 321 places, 351 transitions, 6185 flow. Second operand 16 states and 106 transitions. [2025-04-14 00:32:55,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 368 transitions, 6841 flow [2025-04-14 00:32:55,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 368 transitions, 6455 flow, removed 9 selfloop flow, removed 20 redundant places. [2025-04-14 00:32:55,415 INFO L231 Difference]: Finished difference. Result has 312 places, 341 transitions, 5792 flow [2025-04-14 00:32:55,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5543, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5792, PETRI_PLACES=312, PETRI_TRANSITIONS=341} [2025-04-14 00:32:55,416 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 291 predicate places. [2025-04-14 00:32:55,416 INFO L485 AbstractCegarLoop]: Abstraction has has 312 places, 341 transitions, 5792 flow [2025-04-14 00:32:55,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:32:55,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:55,416 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:55,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-14 00:32:55,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:55,617 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:55,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -368282143, now seen corresponding path program 27 times [2025-04-14 00:32:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:55,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591804522] [2025-04-14 00:32:55,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:55,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:32:55,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-14 00:32:55,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:55,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:56,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591804522] [2025-04-14 00:32:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591804522] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:56,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237277237] [2025-04-14 00:32:56,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:32:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:56,054 INFO L229 MonitoredProcess]: Starting monitored process 38 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:32:56,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-14 00:32:56,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:32:56,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-14 00:32:56,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:32:56,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:56,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:32:56,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:56,472 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:32:56,472 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:32:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:56,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:56,887 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-14 00:32:56,887 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 134 treesize of output 190 [2025-04-14 00:32:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237277237] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:57,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:57,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-14 00:32:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971568089] [2025-04-14 00:32:57,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:57,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:32:57,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:57,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:32:57,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:32:57,997 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:32:57,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 341 transitions, 5792 flow. Second operand has 31 states, 31 states have (on average 3.870967741935484) internal successors, (120), 31 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:57,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:57,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:32:57,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:59,409 INFO L116 PetriNetUnfolderBase]: 772/1392 cut-off events. [2025-04-14 00:32:59,410 INFO L117 PetriNetUnfolderBase]: For 29804/29804 co-relation queries the response was YES. [2025-04-14 00:32:59,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11283 conditions, 1392 events. 772/1392 cut-off events. For 29804/29804 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7421 event pairs, 23 based on Foata normal form. 7/1399 useless extension candidates. Maximal degree in co-relation 11203. Up to 303 conditions per place. [2025-04-14 00:32:59,420 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 204 selfloop transitions, 225 changer transitions 20/449 dead transitions. [2025-04-14 00:32:59,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 449 transitions, 8011 flow [2025-04-14 00:32:59,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:32:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:32:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 182 transitions. [2025-04-14 00:32:59,421 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2988505747126437 [2025-04-14 00:32:59,421 INFO L175 Difference]: Start difference. First operand has 312 places, 341 transitions, 5792 flow. Second operand 29 states and 182 transitions. [2025-04-14 00:32:59,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 449 transitions, 8011 flow [2025-04-14 00:32:59,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 449 transitions, 7715 flow, removed 13 selfloop flow, removed 17 redundant places. [2025-04-14 00:32:59,511 INFO L231 Difference]: Finished difference. Result has 334 places, 369 transitions, 6837 flow [2025-04-14 00:32:59,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5538, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=6837, PETRI_PLACES=334, PETRI_TRANSITIONS=369} [2025-04-14 00:32:59,511 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 313 predicate places. [2025-04-14 00:32:59,511 INFO L485 AbstractCegarLoop]: Abstraction has has 334 places, 369 transitions, 6837 flow [2025-04-14 00:32:59,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.870967741935484) internal successors, (120), 31 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:59,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:59,512 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:59,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-14 00:32:59,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-14 00:32:59,712 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:59,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:59,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1594948047, now seen corresponding path program 28 times [2025-04-14 00:32:59,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:59,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77508653] [2025-04-14 00:32:59,713 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:59,721 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:32:59,724 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:32:59,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:32:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:32:59,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:59,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77508653] [2025-04-14 00:32:59,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77508653] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:59,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922871477] [2025-04-14 00:32:59,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:32:59,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:59,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:59,899 INFO L229 MonitoredProcess]: Starting monitored process 39 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:32:59,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-14 00:33:00,033 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:00,040 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:33:00,040 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:33:00,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:00,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:33:00,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:00,137 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:33:00,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:33:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:00,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:00,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:00,267 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 195 treesize of output 191 [2025-04-14 00:33:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922871477] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:00,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:00,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-14 00:33:00,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614184214] [2025-04-14 00:33:00,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:00,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:33:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:00,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:33:00,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-04-14 00:33:00,656 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:00,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 369 transitions, 6837 flow. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:33:00,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:00,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:00,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:01,687 INFO L116 PetriNetUnfolderBase]: 888/1606 cut-off events. [2025-04-14 00:33:01,687 INFO L117 PetriNetUnfolderBase]: For 40634/40634 co-relation queries the response was YES. [2025-04-14 00:33:01,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13987 conditions, 1606 events. 888/1606 cut-off events. For 40634/40634 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8956 event pairs, 51 based on Foata normal form. 11/1613 useless extension candidates. Maximal degree in co-relation 13900. Up to 396 conditions per place. [2025-04-14 00:33:01,698 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 226 selfloop transitions, 290 changer transitions 12/528 dead transitions. [2025-04-14 00:33:01,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 528 transitions, 10092 flow [2025-04-14 00:33:01,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 00:33:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 00:33:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 271 transitions. [2025-04-14 00:33:01,699 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32261904761904764 [2025-04-14 00:33:01,699 INFO L175 Difference]: Start difference. First operand has 334 places, 369 transitions, 6837 flow. Second operand 40 states and 271 transitions. [2025-04-14 00:33:01,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 528 transitions, 10092 flow [2025-04-14 00:33:01,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 528 transitions, 9635 flow, removed 99 selfloop flow, removed 15 redundant places. [2025-04-14 00:33:01,798 INFO L231 Difference]: Finished difference. Result has 368 places, 439 transitions, 8816 flow [2025-04-14 00:33:01,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6513, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=8816, PETRI_PLACES=368, PETRI_TRANSITIONS=439} [2025-04-14 00:33:01,798 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 347 predicate places. [2025-04-14 00:33:01,798 INFO L485 AbstractCegarLoop]: Abstraction has has 368 places, 439 transitions, 8816 flow [2025-04-14 00:33:01,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:33:01,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:01,798 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:01,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-14 00:33:01,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-14 00:33:01,999 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:01,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash 21983247, now seen corresponding path program 29 times [2025-04-14 00:33:02,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:02,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484038214] [2025-04-14 00:33:02,000 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:02,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:02,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:02,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:02,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:33:02,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:02,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484038214] [2025-04-14 00:33:02,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484038214] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:02,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722192691] [2025-04-14 00:33:02,741 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:02,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:02,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:02,743 INFO L229 MonitoredProcess]: Starting monitored process 40 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:33:02,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-14 00:33:02,881 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:02,930 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:02,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:02,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:02,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 00:33:02,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:03,180 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:33:03,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-14 00:33:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 00:33:03,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:03,498 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:03,498 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 195 treesize of output 193 [2025-04-14 00:33:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:03,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722192691] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:03,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:03,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 9] total 37 [2025-04-14 00:33:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111642815] [2025-04-14 00:33:03,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:03,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-14 00:33:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:03,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-14 00:33:03,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-04-14 00:33:03,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:03,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 439 transitions, 8816 flow. Second operand has 38 states, 38 states have (on average 3.736842105263158) internal successors, (142), 38 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:03,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:03,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:03,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:05,039 INFO L116 PetriNetUnfolderBase]: 900/1625 cut-off events. [2025-04-14 00:33:05,039 INFO L117 PetriNetUnfolderBase]: For 43093/43093 co-relation queries the response was YES. [2025-04-14 00:33:05,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14491 conditions, 1625 events. 900/1625 cut-off events. For 43093/43093 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 9066 event pairs, 78 based on Foata normal form. 7/1628 useless extension candidates. Maximal degree in co-relation 14393. Up to 451 conditions per place. [2025-04-14 00:33:05,054 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 250 selfloop transitions, 234 changer transitions 17/501 dead transitions. [2025-04-14 00:33:05,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 501 transitions, 10403 flow [2025-04-14 00:33:05,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:33:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:33:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 164 transitions. [2025-04-14 00:33:05,055 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30036630036630035 [2025-04-14 00:33:05,055 INFO L175 Difference]: Start difference. First operand has 368 places, 439 transitions, 8816 flow. Second operand 26 states and 164 transitions. [2025-04-14 00:33:05,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 501 transitions, 10403 flow [2025-04-14 00:33:05,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 501 transitions, 9401 flow, removed 351 selfloop flow, removed 18 redundant places. [2025-04-14 00:33:05,189 INFO L231 Difference]: Finished difference. Result has 379 places, 443 transitions, 8474 flow [2025-04-14 00:33:05,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7866, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=8474, PETRI_PLACES=379, PETRI_TRANSITIONS=443} [2025-04-14 00:33:05,190 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 358 predicate places. [2025-04-14 00:33:05,190 INFO L485 AbstractCegarLoop]: Abstraction has has 379 places, 443 transitions, 8474 flow [2025-04-14 00:33:05,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.736842105263158) internal successors, (142), 38 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:05,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:05,190 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:05,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-14 00:33:05,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-14 00:33:05,391 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:05,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1539536787, now seen corresponding path program 30 times [2025-04-14 00:33:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:05,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039466676] [2025-04-14 00:33:05,391 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:05,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:05,400 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:05,409 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 00:33:05,409 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:05,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:05,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039466676] [2025-04-14 00:33:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039466676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:05,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672598053] [2025-04-14 00:33:05,748 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:05,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:05,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:05,750 INFO L229 MonitoredProcess]: Starting monitored process 41 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:33:05,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-14 00:33:05,891 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:05,910 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 00:33:05,910 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:05,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:05,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 00:33:05,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:06,194 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:33:06,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:33:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:06,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:06,644 INFO L325 Elim1Store]: treesize reduction 11, result has 93.1 percent of original size [2025-04-14 00:33:06,644 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 168 treesize of output 216 [2025-04-14 00:33:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672598053] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:07,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-14 00:33:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504223978] [2025-04-14 00:33:07,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:07,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:33:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:07,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:33:07,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:33:07,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:07,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 443 transitions, 8474 flow. Second operand has 31 states, 31 states have (on average 3.870967741935484) internal successors, (120), 31 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:07,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:07,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:07,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:09,759 INFO L116 PetriNetUnfolderBase]: 1124/2032 cut-off events. [2025-04-14 00:33:09,759 INFO L117 PetriNetUnfolderBase]: For 53029/53029 co-relation queries the response was YES. [2025-04-14 00:33:09,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16987 conditions, 2032 events. 1124/2032 cut-off events. For 53029/53029 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 12015 event pairs, 59 based on Foata normal form. 7/2039 useless extension candidates. Maximal degree in co-relation 16885. Up to 470 conditions per place. [2025-04-14 00:33:09,776 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 282 selfloop transitions, 338 changer transitions 21/641 dead transitions. [2025-04-14 00:33:09,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 641 transitions, 12623 flow [2025-04-14 00:33:09,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-14 00:33:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-14 00:33:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 266 transitions. [2025-04-14 00:33:09,777 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30158730158730157 [2025-04-14 00:33:09,777 INFO L175 Difference]: Start difference. First operand has 379 places, 443 transitions, 8474 flow. Second operand 42 states and 266 transitions. [2025-04-14 00:33:09,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 641 transitions, 12623 flow [2025-04-14 00:33:09,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 641 transitions, 12054 flow, removed 74 selfloop flow, removed 18 redundant places. [2025-04-14 00:33:09,925 INFO L231 Difference]: Finished difference. Result has 412 places, 516 transitions, 10649 flow [2025-04-14 00:33:09,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8035, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=10649, PETRI_PLACES=412, PETRI_TRANSITIONS=516} [2025-04-14 00:33:09,926 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 391 predicate places. [2025-04-14 00:33:09,926 INFO L485 AbstractCegarLoop]: Abstraction has has 412 places, 516 transitions, 10649 flow [2025-04-14 00:33:09,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.870967741935484) internal successors, (120), 31 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:09,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:09,926 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:09,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-14 00:33:10,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-14 00:33:10,127 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:10,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1597456257, now seen corresponding path program 31 times [2025-04-14 00:33:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:10,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991954197] [2025-04-14 00:33:10,127 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:33:10,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:10,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:33:10,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:10,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:10,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:33:10,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:10,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991954197] [2025-04-14 00:33:10,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991954197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:10,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766082634] [2025-04-14 00:33:10,684 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:33:10,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:10,686 INFO L229 MonitoredProcess]: Starting monitored process 42 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:33:10,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-14 00:33:10,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:33:10,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:10,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:10,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:10,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:33:10,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:11,006 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:33:11,006 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:33:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:11,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:11,155 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:11,156 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 226 treesize of output 222 [2025-04-14 00:33:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:11,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766082634] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:11,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:11,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-14 00:33:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126871716] [2025-04-14 00:33:11,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:11,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 00:33:11,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:11,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 00:33:11,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 00:33:11,778 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:11,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 516 transitions, 10649 flow. Second operand has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:33:11,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:11,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:11,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:13,435 INFO L116 PetriNetUnfolderBase]: 1121/2008 cut-off events. [2025-04-14 00:33:13,435 INFO L117 PetriNetUnfolderBase]: For 58342/58342 co-relation queries the response was YES. [2025-04-14 00:33:13,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17694 conditions, 2008 events. 1121/2008 cut-off events. For 58342/58342 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 11682 event pairs, 91 based on Foata normal form. 11/2015 useless extension candidates. Maximal degree in co-relation 17581. Up to 471 conditions per place. [2025-04-14 00:33:13,452 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 250 selfloop transitions, 351 changer transitions 15/616 dead transitions. [2025-04-14 00:33:13,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 616 transitions, 12717 flow [2025-04-14 00:33:13,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 00:33:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-14 00:33:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 297 transitions. [2025-04-14 00:33:13,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28285714285714286 [2025-04-14 00:33:13,453 INFO L175 Difference]: Start difference. First operand has 412 places, 516 transitions, 10649 flow. Second operand 50 states and 297 transitions. [2025-04-14 00:33:13,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 616 transitions, 12717 flow [2025-04-14 00:33:13,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 616 transitions, 12243 flow, removed 129 selfloop flow, removed 17 redundant places. [2025-04-14 00:33:13,630 INFO L231 Difference]: Finished difference. Result has 442 places, 514 transitions, 11130 flow [2025-04-14 00:33:13,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10103, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=11130, PETRI_PLACES=442, PETRI_TRANSITIONS=514} [2025-04-14 00:33:13,630 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 421 predicate places. [2025-04-14 00:33:13,630 INFO L485 AbstractCegarLoop]: Abstraction has has 442 places, 514 transitions, 11130 flow [2025-04-14 00:33:13,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:33:13,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:13,630 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:13,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-14 00:33:13,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-14 00:33:13,831 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:13,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1511388243, now seen corresponding path program 32 times [2025-04-14 00:33:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:13,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710954367] [2025-04-14 00:33:13,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:13,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:13,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:13,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:13,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:33:13,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:14,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710954367] [2025-04-14 00:33:14,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710954367] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:14,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667595320] [2025-04-14 00:33:14,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:14,224 INFO L229 MonitoredProcess]: Starting monitored process 43 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:33:14,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-14 00:33:14,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:14,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:14,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:33:14,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:14,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 00:33:14,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:14,632 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:33:14,633 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:33:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:33:14,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:15,052 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-14 00:33:15,052 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 134 treesize of output 190 [2025-04-14 00:33:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:15,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667595320] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:15,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:15,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 28 [2025-04-14 00:33:15,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162870147] [2025-04-14 00:33:15,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:15,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:33:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:15,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:33:15,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:33:15,724 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:15,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 514 transitions, 11130 flow. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:33:15,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:15,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:15,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:17,861 INFO L116 PetriNetUnfolderBase]: 1170/2097 cut-off events. [2025-04-14 00:33:17,861 INFO L117 PetriNetUnfolderBase]: For 63827/63827 co-relation queries the response was YES. [2025-04-14 00:33:17,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18927 conditions, 2097 events. 1170/2097 cut-off events. For 63827/63827 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 12387 event pairs, 76 based on Foata normal form. 7/2104 useless extension candidates. Maximal degree in co-relation 18816. Up to 449 conditions per place. [2025-04-14 00:33:17,882 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 319 selfloop transitions, 321 changer transitions 20/660 dead transitions. [2025-04-14 00:33:17,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 660 transitions, 14053 flow [2025-04-14 00:33:17,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-14 00:33:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-14 00:33:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 272 transitions. [2025-04-14 00:33:17,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30839002267573695 [2025-04-14 00:33:17,883 INFO L175 Difference]: Start difference. First operand has 442 places, 514 transitions, 11130 flow. Second operand 42 states and 272 transitions. [2025-04-14 00:33:17,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 660 transitions, 14053 flow [2025-04-14 00:33:18,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 660 transitions, 13386 flow, removed 90 selfloop flow, removed 33 redundant places. [2025-04-14 00:33:18,081 INFO L231 Difference]: Finished difference. Result has 458 places, 540 transitions, 11789 flow [2025-04-14 00:33:18,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10511, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=11789, PETRI_PLACES=458, PETRI_TRANSITIONS=540} [2025-04-14 00:33:18,081 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 437 predicate places. [2025-04-14 00:33:18,081 INFO L485 AbstractCegarLoop]: Abstraction has has 458 places, 540 transitions, 11789 flow [2025-04-14 00:33:18,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:33:18,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:18,082 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:18,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-14 00:33:18,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-14 00:33:18,282 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:18,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1299894449, now seen corresponding path program 33 times [2025-04-14 00:33:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:18,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208665697] [2025-04-14 00:33:18,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:33:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:18,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:18,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-14 00:33:18,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:33:18,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:18,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:18,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208665697] [2025-04-14 00:33:18,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208665697] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:18,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115537091] [2025-04-14 00:33:18,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:33:18,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:18,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:18,630 INFO L229 MonitoredProcess]: Starting monitored process 44 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:33:18,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-14 00:33:18,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:18,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-14 00:33:18,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:33:18,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:18,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:33:18,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:18,973 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:33:18,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:33:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:18,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:19,329 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-14 00:33:19,330 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 195 treesize of output 239 [2025-04-14 00:33:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:20,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115537091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:20,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:20,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-14 00:33:20,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169899635] [2025-04-14 00:33:20,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:20,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:33:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:20,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:33:20,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:33:20,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:20,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 540 transitions, 11789 flow. Second operand has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:33:20,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:20,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:20,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:22,827 INFO L116 PetriNetUnfolderBase]: 1261/2259 cut-off events. [2025-04-14 00:33:22,827 INFO L117 PetriNetUnfolderBase]: For 77654/77654 co-relation queries the response was YES. [2025-04-14 00:33:22,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20851 conditions, 2259 events. 1261/2259 cut-off events. For 77654/77654 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 13525 event pairs, 130 based on Foata normal form. 13/2272 useless extension candidates. Maximal degree in co-relation 20731. Up to 1059 conditions per place. [2025-04-14 00:33:22,851 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 331 selfloop transitions, 321 changer transitions 18/670 dead transitions. [2025-04-14 00:33:22,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 670 transitions, 14963 flow [2025-04-14 00:33:22,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-14 00:33:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-14 00:33:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 249 transitions. [2025-04-14 00:33:22,852 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.289198606271777 [2025-04-14 00:33:22,852 INFO L175 Difference]: Start difference. First operand has 458 places, 540 transitions, 11789 flow. Second operand 41 states and 249 transitions. [2025-04-14 00:33:22,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 670 transitions, 14963 flow [2025-04-14 00:33:23,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 670 transitions, 14282 flow, removed 102 selfloop flow, removed 17 redundant places. [2025-04-14 00:33:23,101 INFO L231 Difference]: Finished difference. Result has 485 places, 594 transitions, 13234 flow [2025-04-14 00:33:23,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=11130, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=13234, PETRI_PLACES=485, PETRI_TRANSITIONS=594} [2025-04-14 00:33:23,101 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 464 predicate places. [2025-04-14 00:33:23,101 INFO L485 AbstractCegarLoop]: Abstraction has has 485 places, 594 transitions, 13234 flow [2025-04-14 00:33:23,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:33:23,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:23,102 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:23,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-14 00:33:23,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-04-14 00:33:23,302 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:23,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -249707267, now seen corresponding path program 34 times [2025-04-14 00:33:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:23,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513217014] [2025-04-14 00:33:23,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:23,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:23,314 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:33:23,314 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:33:23,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:23,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513217014] [2025-04-14 00:33:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513217014] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:23,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912774920] [2025-04-14 00:33:23,500 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:23,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:23,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:23,502 INFO L229 MonitoredProcess]: Starting monitored process 45 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:33:23,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-14 00:33:23,656 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:23,664 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:33:23,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:33:23,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:23,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:33:23,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:23,769 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:33:23,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:33:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:23,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:23,926 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:23,926 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 215 treesize of output 213 [2025-04-14 00:33:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:24,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912774920] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:24,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:24,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-14 00:33:24,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964794009] [2025-04-14 00:33:24,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:24,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:33:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:24,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:33:24,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:33:24,422 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:24,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 594 transitions, 13234 flow. Second operand has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 21 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:33:24,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:24,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:24,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:25,645 INFO L116 PetriNetUnfolderBase]: 1341/2385 cut-off events. [2025-04-14 00:33:25,645 INFO L117 PetriNetUnfolderBase]: For 82336/82336 co-relation queries the response was YES. [2025-04-14 00:33:25,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22821 conditions, 2385 events. 1341/2385 cut-off events. For 82336/82336 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 14322 event pairs, 162 based on Foata normal form. 8/2389 useless extension candidates. Maximal degree in co-relation 22692. Up to 1167 conditions per place. [2025-04-14 00:33:25,669 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 386 selfloop transitions, 301 changer transitions 17/704 dead transitions. [2025-04-14 00:33:25,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 704 transitions, 16350 flow [2025-04-14 00:33:25,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 00:33:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-14 00:33:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 222 transitions. [2025-04-14 00:33:25,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31092436974789917 [2025-04-14 00:33:25,670 INFO L175 Difference]: Start difference. First operand has 485 places, 594 transitions, 13234 flow. Second operand 34 states and 222 transitions. [2025-04-14 00:33:25,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 704 transitions, 16350 flow [2025-04-14 00:33:25,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 704 transitions, 15705 flow, removed 205 selfloop flow, removed 18 redundant places. [2025-04-14 00:33:25,935 INFO L231 Difference]: Finished difference. Result has 507 places, 630 transitions, 14536 flow [2025-04-14 00:33:25,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12665, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=14536, PETRI_PLACES=507, PETRI_TRANSITIONS=630} [2025-04-14 00:33:25,936 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 486 predicate places. [2025-04-14 00:33:25,936 INFO L485 AbstractCegarLoop]: Abstraction has has 507 places, 630 transitions, 14536 flow [2025-04-14 00:33:25,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 21 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:33:25,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:25,936 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:25,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-14 00:33:26,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:26,136 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:26,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash -363037997, now seen corresponding path program 35 times [2025-04-14 00:33:26,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:26,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391066817] [2025-04-14 00:33:26,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:26,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:26,146 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:26,158 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:26,158 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:26,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 00:33:26,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:26,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391066817] [2025-04-14 00:33:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391066817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:26,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699076444] [2025-04-14 00:33:26,529 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:26,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:26,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:26,530 INFO L229 MonitoredProcess]: Starting monitored process 46 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:33:26,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-14 00:33:26,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:26,762 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:26,762 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:26,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:33:26,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:26,937 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:33:26,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-14 00:33:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:33:26,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:27,075 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:27,075 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 195 treesize of output 191 [2025-04-14 00:33:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699076444] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:27,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 27 [2025-04-14 00:33:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350880186] [2025-04-14 00:33:27,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:27,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:33:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:27,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:33:27,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:33:27,571 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:27,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 630 transitions, 14536 flow. Second operand has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:33:27,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:27,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:27,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:29,146 INFO L116 PetriNetUnfolderBase]: 1426/2530 cut-off events. [2025-04-14 00:33:29,146 INFO L117 PetriNetUnfolderBase]: For 100468/100468 co-relation queries the response was YES. [2025-04-14 00:33:29,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24662 conditions, 2530 events. 1426/2530 cut-off events. For 100468/100468 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 15242 event pairs, 159 based on Foata normal form. 11/2537 useless extension candidates. Maximal degree in co-relation 24523. Up to 1197 conditions per place. [2025-04-14 00:33:29,172 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 381 selfloop transitions, 359 changer transitions 17/757 dead transitions. [2025-04-14 00:33:29,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 757 transitions, 18042 flow [2025-04-14 00:33:29,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-14 00:33:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-14 00:33:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 256 transitions. [2025-04-14 00:33:29,173 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29732868757259 [2025-04-14 00:33:29,173 INFO L175 Difference]: Start difference. First operand has 507 places, 630 transitions, 14536 flow. Second operand 41 states and 256 transitions. [2025-04-14 00:33:29,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 757 transitions, 18042 flow [2025-04-14 00:33:29,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 757 transitions, 17231 flow, removed 217 selfloop flow, removed 14 redundant places. [2025-04-14 00:33:29,512 INFO L231 Difference]: Finished difference. Result has 534 places, 678 transitions, 15985 flow [2025-04-14 00:33:29,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=13724, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=15985, PETRI_PLACES=534, PETRI_TRANSITIONS=678} [2025-04-14 00:33:29,513 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 513 predicate places. [2025-04-14 00:33:29,513 INFO L485 AbstractCegarLoop]: Abstraction has has 534 places, 678 transitions, 15985 flow [2025-04-14 00:33:29,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:33:29,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:29,513 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:29,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-14 00:33:29,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-04-14 00:33:29,713 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:29,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1677201663, now seen corresponding path program 36 times [2025-04-14 00:33:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:29,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378850295] [2025-04-14 00:33:29,714 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:29,722 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:29,736 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 00:33:29,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:30,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378850295] [2025-04-14 00:33:30,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378850295] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:30,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818484936] [2025-04-14 00:33:30,151 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:30,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:30,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:30,153 INFO L229 MonitoredProcess]: Starting monitored process 47 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:33:30,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-14 00:33:30,316 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:30,335 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 00:33:30,335 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:30,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:30,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:33:30,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:30,528 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:33:30,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:33:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:30,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:30,918 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-14 00:33:30,918 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 195 treesize of output 233 [2025-04-14 00:33:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818484936] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:31,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-14 00:33:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032855392] [2025-04-14 00:33:31,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:31,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 00:33:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:31,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 00:33:31,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-04-14 00:33:31,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:31,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 678 transitions, 15985 flow. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:33:31,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:31,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:31,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:33,583 INFO L116 PetriNetUnfolderBase]: 1464/2596 cut-off events. [2025-04-14 00:33:33,584 INFO L117 PetriNetUnfolderBase]: For 97489/97489 co-relation queries the response was YES. [2025-04-14 00:33:33,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25463 conditions, 2596 events. 1464/2596 cut-off events. For 97489/97489 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 15701 event pairs, 226 based on Foata normal form. 5/2601 useless extension candidates. Maximal degree in co-relation 25317. Up to 1522 conditions per place. [2025-04-14 00:33:33,613 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 492 selfloop transitions, 248 changer transitions 13/753 dead transitions. [2025-04-14 00:33:33,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 753 transitions, 18402 flow [2025-04-14 00:33:33,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 00:33:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 00:33:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 181 transitions. [2025-04-14 00:33:33,613 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2780337941628264 [2025-04-14 00:33:33,614 INFO L175 Difference]: Start difference. First operand has 534 places, 678 transitions, 15985 flow. Second operand 31 states and 181 transitions. [2025-04-14 00:33:33,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 753 transitions, 18402 flow [2025-04-14 00:33:33,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 753 transitions, 17713 flow, removed 233 selfloop flow, removed 20 redundant places. [2025-04-14 00:33:34,001 INFO L231 Difference]: Finished difference. Result has 550 places, 703 transitions, 16437 flow [2025-04-14 00:33:34,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15341, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=16437, PETRI_PLACES=550, PETRI_TRANSITIONS=703} [2025-04-14 00:33:34,001 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 529 predicate places. [2025-04-14 00:33:34,001 INFO L485 AbstractCegarLoop]: Abstraction has has 550 places, 703 transitions, 16437 flow [2025-04-14 00:33:34,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:33:34,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:34,002 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:34,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-14 00:33:34,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:34,202 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:34,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1212372711, now seen corresponding path program 37 times [2025-04-14 00:33:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:34,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667407391] [2025-04-14 00:33:34,203 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:33:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:34,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:33:34,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:34,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:34,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:33:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:34,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667407391] [2025-04-14 00:33:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667407391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:34,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395503107] [2025-04-14 00:33:34,691 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:33:34,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:34,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:34,693 INFO L229 MonitoredProcess]: Starting monitored process 48 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:33:34,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-14 00:33:34,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:33:34,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:34,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:34,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:34,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:33:34,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:35,042 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:33:35,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:33:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:35,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:35,184 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:35,184 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 226 treesize of output 222 [2025-04-14 00:33:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:35,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395503107] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:35,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:35,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-14 00:33:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789843099] [2025-04-14 00:33:35,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:35,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 00:33:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:35,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 00:33:35,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 00:33:35,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:35,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 703 transitions, 16437 flow. Second operand has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:33:35,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:35,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:35,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:37,786 INFO L116 PetriNetUnfolderBase]: 1605/2887 cut-off events. [2025-04-14 00:33:37,786 INFO L117 PetriNetUnfolderBase]: For 114139/114139 co-relation queries the response was YES. [2025-04-14 00:33:37,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28518 conditions, 2887 events. 1605/2887 cut-off events. For 114139/114139 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 17973 event pairs, 230 based on Foata normal form. 11/2894 useless extension candidates. Maximal degree in co-relation 28366. Up to 1106 conditions per place. [2025-04-14 00:33:37,824 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 487 selfloop transitions, 354 changer transitions 19/860 dead transitions. [2025-04-14 00:33:37,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 860 transitions, 20766 flow [2025-04-14 00:33:37,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 00:33:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-14 00:33:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 292 transitions. [2025-04-14 00:33:37,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2780952380952381 [2025-04-14 00:33:37,825 INFO L175 Difference]: Start difference. First operand has 550 places, 703 transitions, 16437 flow. Second operand 50 states and 292 transitions. [2025-04-14 00:33:37,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 860 transitions, 20766 flow [2025-04-14 00:33:38,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 860 transitions, 20498 flow, removed 83 selfloop flow, removed 15 redundant places. [2025-04-14 00:33:38,292 INFO L231 Difference]: Finished difference. Result has 587 places, 770 transitions, 19136 flow [2025-04-14 00:33:38,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=16211, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=19136, PETRI_PLACES=587, PETRI_TRANSITIONS=770} [2025-04-14 00:33:38,293 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 566 predicate places. [2025-04-14 00:33:38,293 INFO L485 AbstractCegarLoop]: Abstraction has has 587 places, 770 transitions, 19136 flow [2025-04-14 00:33:38,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:33:38,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:38,293 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:38,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-14 00:33:38,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:38,494 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:38,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:38,494 INFO L85 PathProgramCache]: Analyzing trace with hash 708277091, now seen corresponding path program 38 times [2025-04-14 00:33:38,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:38,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321062728] [2025-04-14 00:33:38,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:38,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:38,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:38,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:38,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:33:38,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:38,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321062728] [2025-04-14 00:33:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321062728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:38,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120748832] [2025-04-14 00:33:38,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:38,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:38,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:38,877 INFO L229 MonitoredProcess]: Starting monitored process 49 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:33:38,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-14 00:33:39,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:39,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:39,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:33:39,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:39,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 00:33:39,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:39,312 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:33:39,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:33:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:33:39,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:39,748 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-14 00:33:39,749 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 195 treesize of output 233 [2025-04-14 00:33:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:41,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120748832] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:41,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:41,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-04-14 00:33:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089465688] [2025-04-14 00:33:41,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:41,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:33:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:41,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:33:41,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:33:41,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:41,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 770 transitions, 19136 flow. Second operand has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:33:41,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:41,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:41,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:43,710 INFO L116 PetriNetUnfolderBase]: 1741/3155 cut-off events. [2025-04-14 00:33:43,710 INFO L117 PetriNetUnfolderBase]: For 140291/140291 co-relation queries the response was YES. [2025-04-14 00:33:43,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32582 conditions, 3155 events. 1741/3155 cut-off events. For 140291/140291 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 20170 event pairs, 246 based on Foata normal form. 9/3164 useless extension candidates. Maximal degree in co-relation 32424. Up to 1750 conditions per place. [2025-04-14 00:33:43,750 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 570 selfloop transitions, 343 changer transitions 18/931 dead transitions. [2025-04-14 00:33:43,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 931 transitions, 23688 flow [2025-04-14 00:33:43,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-14 00:33:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-14 00:33:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 291 transitions. [2025-04-14 00:33:43,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30793650793650795 [2025-04-14 00:33:43,751 INFO L175 Difference]: Start difference. First operand has 587 places, 770 transitions, 19136 flow. Second operand 45 states and 291 transitions. [2025-04-14 00:33:43,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 931 transitions, 23688 flow [2025-04-14 00:33:44,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 931 transitions, 22700 flow, removed 445 selfloop flow, removed 21 redundant places. [2025-04-14 00:33:44,334 INFO L231 Difference]: Finished difference. Result has 622 places, 838 transitions, 20981 flow [2025-04-14 00:33:44,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=18196, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=20981, PETRI_PLACES=622, PETRI_TRANSITIONS=838} [2025-04-14 00:33:44,335 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 601 predicate places. [2025-04-14 00:33:44,335 INFO L485 AbstractCegarLoop]: Abstraction has has 622 places, 838 transitions, 20981 flow [2025-04-14 00:33:44,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:33:44,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:44,335 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:44,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-14 00:33:44,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-04-14 00:33:44,536 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:44,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash 438302863, now seen corresponding path program 39 times [2025-04-14 00:33:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:44,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175014723] [2025-04-14 00:33:44,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:33:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:44,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:44,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-14 00:33:44,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:33:44,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:44,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175014723] [2025-04-14 00:33:44,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175014723] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:44,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626639891] [2025-04-14 00:33:44,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:33:44,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:44,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:44,864 INFO L229 MonitoredProcess]: Starting monitored process 50 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:33:44,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-14 00:33:45,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:45,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-14 00:33:45,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:33:45,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:45,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:33:45,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:45,272 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:33:45,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:33:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:45,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:45,544 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-14 00:33:45,544 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 219 treesize of output 281 [2025-04-14 00:33:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626639891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:47,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:47,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-14 00:33:47,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148724107] [2025-04-14 00:33:47,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:47,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 00:33:47,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:47,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 00:33:47,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-04-14 00:33:47,154 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:47,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 838 transitions, 20981 flow. Second operand has 24 states, 24 states have (on average 3.875) internal successors, (93), 24 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:47,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:47,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:47,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:48,921 INFO L116 PetriNetUnfolderBase]: 1749/3142 cut-off events. [2025-04-14 00:33:48,921 INFO L117 PetriNetUnfolderBase]: For 151719/151719 co-relation queries the response was YES. [2025-04-14 00:33:48,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32372 conditions, 3142 events. 1749/3142 cut-off events. For 151719/151719 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 19890 event pairs, 253 based on Foata normal form. 6/3148 useless extension candidates. Maximal degree in co-relation 32201. Up to 1892 conditions per place. [2025-04-14 00:33:48,963 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 576 selfloop transitions, 313 changer transitions 17/906 dead transitions. [2025-04-14 00:33:48,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 906 transitions, 23572 flow [2025-04-14 00:33:48,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 00:33:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 00:33:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 189 transitions. [2025-04-14 00:33:48,964 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2903225806451613 [2025-04-14 00:33:48,964 INFO L175 Difference]: Start difference. First operand has 622 places, 838 transitions, 20981 flow. Second operand 31 states and 189 transitions. [2025-04-14 00:33:48,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 906 transitions, 23572 flow [2025-04-14 00:33:49,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 906 transitions, 22853 flow, removed 236 selfloop flow, removed 21 redundant places. [2025-04-14 00:33:49,554 INFO L231 Difference]: Finished difference. Result has 634 places, 845 transitions, 21410 flow [2025-04-14 00:33:49,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=20253, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=21410, PETRI_PLACES=634, PETRI_TRANSITIONS=845} [2025-04-14 00:33:49,555 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 613 predicate places. [2025-04-14 00:33:49,555 INFO L485 AbstractCegarLoop]: Abstraction has has 634 places, 845 transitions, 21410 flow [2025-04-14 00:33:49,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.875) internal successors, (93), 24 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:49,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:49,555 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:49,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-14 00:33:49,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-14 00:33:49,756 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:49,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:49,757 INFO L85 PathProgramCache]: Analyzing trace with hash -817732487, now seen corresponding path program 40 times [2025-04-14 00:33:49,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:49,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325114300] [2025-04-14 00:33:49,757 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:49,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:49,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:49,769 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:33:49,769 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:33:49,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:49,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325114300] [2025-04-14 00:33:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325114300] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:49,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813615045] [2025-04-14 00:33:49,953 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:49,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:49,955 INFO L229 MonitoredProcess]: Starting monitored process 51 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:33:49,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-14 00:33:50,125 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:33:50,132 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:33:50,132 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:33:50,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:50,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:33:50,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:50,253 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:33:50,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:33:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:50,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:50,422 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:50,423 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 215 treesize of output 213 [2025-04-14 00:33:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:50,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813615045] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:50,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:50,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-14 00:33:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51100417] [2025-04-14 00:33:50,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:50,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:33:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:50,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:33:50,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:33:50,825 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:50,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 845 transitions, 21410 flow. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:33:50,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:50,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:50,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:52,590 INFO L116 PetriNetUnfolderBase]: 1837/3284 cut-off events. [2025-04-14 00:33:52,591 INFO L117 PetriNetUnfolderBase]: For 168600/168600 co-relation queries the response was YES. [2025-04-14 00:33:52,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34465 conditions, 3284 events. 1837/3284 cut-off events. For 168600/168600 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 20751 event pairs, 265 based on Foata normal form. 6/3286 useless extension candidates. Maximal degree in co-relation 34290. Up to 1868 conditions per place. [2025-04-14 00:33:52,636 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 622 selfloop transitions, 344 changer transitions 12/978 dead transitions. [2025-04-14 00:33:52,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 978 transitions, 25524 flow [2025-04-14 00:33:52,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 00:33:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 00:33:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 265 transitions. [2025-04-14 00:33:52,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2025-04-14 00:33:52,638 INFO L175 Difference]: Start difference. First operand has 634 places, 845 transitions, 21410 flow. Second operand 40 states and 265 transitions. [2025-04-14 00:33:52,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 978 transitions, 25524 flow [2025-04-14 00:33:53,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 978 transitions, 25093 flow, removed 54 selfloop flow, removed 17 redundant places. [2025-04-14 00:33:53,304 INFO L231 Difference]: Finished difference. Result has 654 places, 881 transitions, 23130 flow [2025-04-14 00:33:53,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=21002, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=23130, PETRI_PLACES=654, PETRI_TRANSITIONS=881} [2025-04-14 00:33:53,305 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 633 predicate places. [2025-04-14 00:33:53,305 INFO L485 AbstractCegarLoop]: Abstraction has has 654 places, 881 transitions, 23130 flow [2025-04-14 00:33:53,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:33:53,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:53,305 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:53,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-14 00:33:53,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-14 00:33:53,506 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:53,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -931063217, now seen corresponding path program 41 times [2025-04-14 00:33:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:53,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541859276] [2025-04-14 00:33:53,506 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:53,515 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:53,528 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:53,528 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:53,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:33:54,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:54,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541859276] [2025-04-14 00:33:54,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541859276] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:54,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232701746] [2025-04-14 00:33:54,024 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:54,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:54,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:54,026 INFO L229 MonitoredProcess]: Starting monitored process 52 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:33:54,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-14 00:33:54,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:54,246 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:33:54,246 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:54,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:54,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:33:54,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:54,515 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:33:54,516 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-14 00:33:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:33:54,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:54,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:54,682 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 195 treesize of output 191 [2025-04-14 00:33:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:55,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232701746] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:55,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:55,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 9] total 34 [2025-04-14 00:33:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908822885] [2025-04-14 00:33:55,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:55,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 00:33:55,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:55,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 00:33:55,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 00:33:55,214 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:55,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 881 transitions, 23130 flow. Second operand has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 35 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:33:55,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:55,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:55,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:56,948 INFO L116 PetriNetUnfolderBase]: 1850/3274 cut-off events. [2025-04-14 00:33:56,948 INFO L117 PetriNetUnfolderBase]: For 184596/184596 co-relation queries the response was YES. [2025-04-14 00:33:56,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35409 conditions, 3274 events. 1850/3274 cut-off events. For 184596/184596 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 20439 event pairs, 274 based on Foata normal form. 6/3276 useless extension candidates. Maximal degree in co-relation 35228. Up to 1922 conditions per place. [2025-04-14 00:33:56,994 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 580 selfloop transitions, 341 changer transitions 11/932 dead transitions. [2025-04-14 00:33:56,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 932 transitions, 25676 flow [2025-04-14 00:33:56,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 00:33:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-14 00:33:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 190 transitions. [2025-04-14 00:33:56,995 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28273809523809523 [2025-04-14 00:33:56,995 INFO L175 Difference]: Start difference. First operand has 654 places, 881 transitions, 23130 flow. Second operand 32 states and 190 transitions. [2025-04-14 00:33:56,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 932 transitions, 25676 flow [2025-04-14 00:33:57,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 932 transitions, 25155 flow, removed 205 selfloop flow, removed 17 redundant places. [2025-04-14 00:33:57,718 INFO L231 Difference]: Finished difference. Result has 660 places, 884 transitions, 23724 flow [2025-04-14 00:33:57,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=22566, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=331, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=23724, PETRI_PLACES=660, PETRI_TRANSITIONS=884} [2025-04-14 00:33:57,719 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 639 predicate places. [2025-04-14 00:33:57,719 INFO L485 AbstractCegarLoop]: Abstraction has has 660 places, 884 transitions, 23724 flow [2025-04-14 00:33:57,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 35 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:33:57,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:57,719 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:57,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-14 00:33:57,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-14 00:33:57,920 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:33:57,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2058260319, now seen corresponding path program 42 times [2025-04-14 00:33:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:57,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60865972] [2025-04-14 00:33:57,920 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:57,929 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:57,939 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 00:33:57,939 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:57,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:58,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:58,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60865972] [2025-04-14 00:33:58,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60865972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:58,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243879895] [2025-04-14 00:33:58,285 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:58,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:58,287 INFO L229 MonitoredProcess]: Starting monitored process 53 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:33:58,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-14 00:33:58,464 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:33:58,483 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 00:33:58,483 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:58,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:58,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:33:58,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:58,707 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:33:58,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:33:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:58,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:58,885 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:58,885 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 215 treesize of output 213 [2025-04-14 00:33:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:33:59,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243879895] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:59,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:59,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-04-14 00:33:59,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294378179] [2025-04-14 00:33:59,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:59,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:33:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:59,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:33:59,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:33:59,664 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:33:59,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 884 transitions, 23724 flow. Second operand has 30 states, 30 states have (on average 3.9) internal successors, (117), 30 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:33:59,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:59,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:33:59,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:01,074 INFO L116 PetriNetUnfolderBase]: 1863/3296 cut-off events. [2025-04-14 00:34:01,074 INFO L117 PetriNetUnfolderBase]: For 194860/194860 co-relation queries the response was YES. [2025-04-14 00:34:01,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35855 conditions, 3296 events. 1863/3296 cut-off events. For 194860/194860 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 20668 event pairs, 96 based on Foata normal form. 6/3302 useless extension candidates. Maximal degree in co-relation 35673. Up to 704 conditions per place. [2025-04-14 00:34:01,122 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 442 selfloop transitions, 510 changer transitions 14/966 dead transitions. [2025-04-14 00:34:01,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 966 transitions, 26863 flow [2025-04-14 00:34:01,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:34:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:34:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 155 transitions. [2025-04-14 00:34:01,123 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2838827838827839 [2025-04-14 00:34:01,123 INFO L175 Difference]: Start difference. First operand has 660 places, 884 transitions, 23724 flow. Second operand 26 states and 155 transitions. [2025-04-14 00:34:01,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 966 transitions, 26863 flow [2025-04-14 00:34:01,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 966 transitions, 26537 flow, removed 75 selfloop flow, removed 25 redundant places. [2025-04-14 00:34:01,809 INFO L231 Difference]: Finished difference. Result has 664 places, 892 transitions, 24727 flow [2025-04-14 00:34:01,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=23424, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=501, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=24727, PETRI_PLACES=664, PETRI_TRANSITIONS=892} [2025-04-14 00:34:01,810 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 643 predicate places. [2025-04-14 00:34:01,810 INFO L485 AbstractCegarLoop]: Abstraction has has 664 places, 892 transitions, 24727 flow [2025-04-14 00:34:01,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.9) internal successors, (117), 30 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:34:01,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:01,810 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:01,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-14 00:34:02,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-14 00:34:02,014 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:02,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -491439521, now seen corresponding path program 43 times [2025-04-14 00:34:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:02,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107582861] [2025-04-14 00:34:02,014 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:34:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:02,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:34:02,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:02,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:34:02,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:34:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:02,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107582861] [2025-04-14 00:34:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107582861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:02,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654443237] [2025-04-14 00:34:02,598 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:34:02,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:02,599 INFO L229 MonitoredProcess]: Starting monitored process 54 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:34:02,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-14 00:34:02,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:34:02,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:02,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:34:02,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:02,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:34:02,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:02,966 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:34:02,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:34:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:02,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:03,156 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:03,156 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 230 treesize of output 228 [2025-04-14 00:34:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:03,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654443237] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:03,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:03,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-14 00:34:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192206810] [2025-04-14 00:34:03,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:03,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 00:34:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:03,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 00:34:03,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 00:34:03,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:03,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 892 transitions, 24727 flow. Second operand has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:34:03,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:03,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:03,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:06,666 INFO L116 PetriNetUnfolderBase]: 1955/3484 cut-off events. [2025-04-14 00:34:06,667 INFO L117 PetriNetUnfolderBase]: For 213806/213806 co-relation queries the response was YES. [2025-04-14 00:34:06,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39391 conditions, 3484 events. 1955/3484 cut-off events. For 213806/213806 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 22159 event pairs, 120 based on Foata normal form. 22/3502 useless extension candidates. Maximal degree in co-relation 39201. Up to 754 conditions per place. [2025-04-14 00:34:06,717 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 427 selfloop transitions, 601 changer transitions 38/1066 dead transitions. [2025-04-14 00:34:06,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 1066 transitions, 30022 flow [2025-04-14 00:34:06,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-14 00:34:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-14 00:34:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 338 transitions. [2025-04-14 00:34:06,718 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26825396825396824 [2025-04-14 00:34:06,718 INFO L175 Difference]: Start difference. First operand has 664 places, 892 transitions, 24727 flow. Second operand 60 states and 338 transitions. [2025-04-14 00:34:06,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 1066 transitions, 30022 flow [2025-04-14 00:34:07,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 1066 transitions, 29291 flow, removed 53 selfloop flow, removed 17 redundant places. [2025-04-14 00:34:07,588 INFO L231 Difference]: Finished difference. Result has 716 places, 951 transitions, 27282 flow [2025-04-14 00:34:07,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=24041, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=550, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=27282, PETRI_PLACES=716, PETRI_TRANSITIONS=951} [2025-04-14 00:34:07,589 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 695 predicate places. [2025-04-14 00:34:07,589 INFO L485 AbstractCegarLoop]: Abstraction has has 716 places, 951 transitions, 27282 flow [2025-04-14 00:34:07,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:34:07,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:07,590 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:07,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-14 00:34:07,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:07,790 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:07,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1741202179, now seen corresponding path program 44 times [2025-04-14 00:34:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:07,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774405608] [2025-04-14 00:34:07,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:34:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:07,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:34:07,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:07,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:34:07,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:08,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774405608] [2025-04-14 00:34:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774405608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:08,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006664310] [2025-04-14 00:34:08,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:34:08,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:08,300 INFO L229 MonitoredProcess]: Starting monitored process 55 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:34:08,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-14 00:34:08,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:34:08,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:08,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:34:08,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:08,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-14 00:34:08,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:08,791 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:34:08,791 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:34:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:34:08,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:09,379 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-14 00:34:09,379 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 168 treesize of output 212 [2025-04-14 00:34:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006664310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:10,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-14 00:34:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589913790] [2025-04-14 00:34:10,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:10,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 00:34:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:10,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 00:34:10,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 00:34:10,066 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:10,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 951 transitions, 27282 flow. Second operand has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 33 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:34:10,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:10,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:10,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:13,862 INFO L116 PetriNetUnfolderBase]: 2165/3820 cut-off events. [2025-04-14 00:34:13,862 INFO L117 PetriNetUnfolderBase]: For 245970/245970 co-relation queries the response was YES. [2025-04-14 00:34:13,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45468 conditions, 3820 events. 2165/3820 cut-off events. For 245970/245970 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 24579 event pairs, 75 based on Foata normal form. 12/3832 useless extension candidates. Maximal degree in co-relation 45268. Up to 830 conditions per place. [2025-04-14 00:34:13,921 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 407 selfloop transitions, 749 changer transitions 19/1175 dead transitions. [2025-04-14 00:34:13,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 762 places, 1175 transitions, 34150 flow [2025-04-14 00:34:13,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-14 00:34:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-04-14 00:34:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 322 transitions. [2025-04-14 00:34:13,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26900584795321636 [2025-04-14 00:34:13,922 INFO L175 Difference]: Start difference. First operand has 716 places, 951 transitions, 27282 flow. Second operand 57 states and 322 transitions. [2025-04-14 00:34:13,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 762 places, 1175 transitions, 34150 flow [2025-04-14 00:34:14,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 734 places, 1175 transitions, 32652 flow, removed 390 selfloop flow, removed 28 redundant places. [2025-04-14 00:34:14,873 INFO L231 Difference]: Finished difference. Result has 748 places, 1054 transitions, 31170 flow [2025-04-14 00:34:14,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=25897, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=649, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=31170, PETRI_PLACES=748, PETRI_TRANSITIONS=1054} [2025-04-14 00:34:14,873 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 727 predicate places. [2025-04-14 00:34:14,873 INFO L485 AbstractCegarLoop]: Abstraction has has 748 places, 1054 transitions, 31170 flow [2025-04-14 00:34:14,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 33 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:34:14,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:14,874 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:14,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-14 00:34:15,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:15,074 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:15,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1369342723, now seen corresponding path program 45 times [2025-04-14 00:34:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:15,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535970222] [2025-04-14 00:34:15,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:15,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:34:15,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-14 00:34:15,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:34:15,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:15,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:15,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535970222] [2025-04-14 00:34:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535970222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:15,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251759564] [2025-04-14 00:34:15,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:15,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:15,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:15,516 INFO L229 MonitoredProcess]: Starting monitored process 56 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:34:15,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-14 00:34:15,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:34:15,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-14 00:34:15,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:34:15,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:15,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:34:15,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:15,935 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:34:15,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:34:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:15,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:16,143 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:16,143 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 192 treesize of output 192 [2025-04-14 00:34:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251759564] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:16,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:16,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 28 [2025-04-14 00:34:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330472986] [2025-04-14 00:34:16,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:16,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:34:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:16,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:34:16,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:34:16,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:16,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 1054 transitions, 31170 flow. Second operand has 29 states, 29 states have (on average 3.8275862068965516) internal successors, (111), 29 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:34:16,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:16,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:16,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:18,412 INFO L116 PetriNetUnfolderBase]: 2181/3828 cut-off events. [2025-04-14 00:34:18,412 INFO L117 PetriNetUnfolderBase]: For 255337/255337 co-relation queries the response was YES. [2025-04-14 00:34:18,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46349 conditions, 3828 events. 2181/3828 cut-off events. For 255337/255337 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 24493 event pairs, 27 based on Foata normal form. 3/3831 useless extension candidates. Maximal degree in co-relation 46143. Up to 932 conditions per place. [2025-04-14 00:34:18,478 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 531 selfloop transitions, 571 changer transitions 11/1113 dead transitions. [2025-04-14 00:34:18,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 762 places, 1113 transitions, 34355 flow [2025-04-14 00:34:18,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 00:34:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 00:34:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 141 transitions. [2025-04-14 00:34:18,479 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2919254658385093 [2025-04-14 00:34:18,479 INFO L175 Difference]: Start difference. First operand has 748 places, 1054 transitions, 31170 flow. Second operand 23 states and 141 transitions. [2025-04-14 00:34:18,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 762 places, 1113 transitions, 34355 flow [2025-04-14 00:34:19,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 1113 transitions, 32234 flow, removed 493 selfloop flow, removed 30 redundant places. [2025-04-14 00:34:19,612 INFO L231 Difference]: Finished difference. Result has 735 places, 1057 transitions, 30498 flow [2025-04-14 00:34:19,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=29125, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=564, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=30498, PETRI_PLACES=735, PETRI_TRANSITIONS=1057} [2025-04-14 00:34:19,613 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 714 predicate places. [2025-04-14 00:34:19,613 INFO L485 AbstractCegarLoop]: Abstraction has has 735 places, 1057 transitions, 30498 flow [2025-04-14 00:34:19,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.8275862068965516) internal successors, (111), 29 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:34:19,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:19,613 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:19,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-04-14 00:34:19,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:19,814 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:19,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1504921397, now seen corresponding path program 46 times [2025-04-14 00:34:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:19,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714323999] [2025-04-14 00:34:19,815 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:34:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:19,828 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:34:19,833 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:34:19,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:34:19,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:20,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:20,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714323999] [2025-04-14 00:34:20,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714323999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:20,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619393814] [2025-04-14 00:34:20,085 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:34:20,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:20,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:20,086 INFO L229 MonitoredProcess]: Starting monitored process 57 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:34:20,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-14 00:34:20,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:34:20,296 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:34:20,296 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:34:20,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:20,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:34:20,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:20,453 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:34:20,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:34:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:20,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:20,644 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:20,644 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 195 treesize of output 191 [2025-04-14 00:34:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619393814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:21,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:21,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-14 00:34:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613586906] [2025-04-14 00:34:21,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:21,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:34:21,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:21,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:34:21,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:34:21,152 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:21,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 1057 transitions, 30498 flow. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:34:21,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:21,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:21,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:23,153 INFO L116 PetriNetUnfolderBase]: 2335/4119 cut-off events. [2025-04-14 00:34:23,154 INFO L117 PetriNetUnfolderBase]: For 277603/277603 co-relation queries the response was YES. [2025-04-14 00:34:23,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48545 conditions, 4119 events. 2335/4119 cut-off events. For 277603/277603 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 26856 event pairs, 330 based on Foata normal form. 6/4121 useless extension candidates. Maximal degree in co-relation 48345. Up to 2344 conditions per place. [2025-04-14 00:34:23,218 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 767 selfloop transitions, 440 changer transitions 12/1219 dead transitions. [2025-04-14 00:34:23,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 1219 transitions, 36676 flow [2025-04-14 00:34:23,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 00:34:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 00:34:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 253 transitions. [2025-04-14 00:34:23,219 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31704260651629074 [2025-04-14 00:34:23,219 INFO L175 Difference]: Start difference. First operand has 735 places, 1057 transitions, 30498 flow. Second operand 38 states and 253 transitions. [2025-04-14 00:34:23,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 1219 transitions, 36676 flow [2025-04-14 00:34:24,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 1219 transitions, 35568 flow, removed 45 selfloop flow, removed 20 redundant places. [2025-04-14 00:34:24,215 INFO L231 Difference]: Finished difference. Result has 763 places, 1132 transitions, 33431 flow [2025-04-14 00:34:24,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=29477, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=33431, PETRI_PLACES=763, PETRI_TRANSITIONS=1132} [2025-04-14 00:34:24,218 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 742 predicate places. [2025-04-14 00:34:24,218 INFO L485 AbstractCegarLoop]: Abstraction has has 763 places, 1132 transitions, 33431 flow [2025-04-14 00:34:24,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:34:24,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:24,218 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:24,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-14 00:34:24,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:24,418 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:24,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1960826407, now seen corresponding path program 47 times [2025-04-14 00:34:24,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:24,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461176] [2025-04-14 00:34:24,419 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:34:24,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:24,428 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:34:24,442 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:24,442 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:34:24,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 00:34:24,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:24,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461176] [2025-04-14 00:34:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461176] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:24,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351444189] [2025-04-14 00:34:24,967 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:34:24,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:24,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:24,969 INFO L229 MonitoredProcess]: Starting monitored process 58 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:34:24,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-14 00:34:25,157 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:34:25,236 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:25,237 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:34:25,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:25,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:34:25,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:25,442 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:34:25,442 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-14 00:34:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:34:25,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:25,613 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:25,613 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 199 treesize of output 197 [2025-04-14 00:34:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351444189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:26,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2025-04-14 00:34:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164604477] [2025-04-14 00:34:26,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:26,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 00:34:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:26,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 00:34:26,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 00:34:26,118 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:26,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 1132 transitions, 33431 flow. Second operand has 35 states, 35 states have (on average 3.8) internal successors, (133), 35 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:34:26,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:26,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:29,249 INFO L116 PetriNetUnfolderBase]: 2464/4401 cut-off events. [2025-04-14 00:34:29,249 INFO L117 PetriNetUnfolderBase]: For 313780/313780 co-relation queries the response was YES. [2025-04-14 00:34:29,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52632 conditions, 4401 events. 2464/4401 cut-off events. For 313780/313780 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 29595 event pairs, 310 based on Foata normal form. 31/4428 useless extension candidates. Maximal degree in co-relation 52421. Up to 1461 conditions per place. [2025-04-14 00:34:29,437 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 777 selfloop transitions, 483 changer transitions 34/1294 dead transitions. [2025-04-14 00:34:29,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 1294 transitions, 39109 flow [2025-04-14 00:34:29,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 00:34:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-14 00:34:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 307 transitions. [2025-04-14 00:34:29,438 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28664799253034545 [2025-04-14 00:34:29,438 INFO L175 Difference]: Start difference. First operand has 763 places, 1132 transitions, 33431 flow. Second operand 51 states and 307 transitions. [2025-04-14 00:34:29,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 1294 transitions, 39109 flow [2025-04-14 00:34:30,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 1294 transitions, 38006 flow, removed 505 selfloop flow, removed 13 redundant places. [2025-04-14 00:34:30,898 INFO L231 Difference]: Finished difference. Result has 818 places, 1188 transitions, 35599 flow [2025-04-14 00:34:30,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=32354, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=35599, PETRI_PLACES=818, PETRI_TRANSITIONS=1188} [2025-04-14 00:34:30,899 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 797 predicate places. [2025-04-14 00:34:30,899 INFO L485 AbstractCegarLoop]: Abstraction has has 818 places, 1188 transitions, 35599 flow [2025-04-14 00:34:30,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.8) internal successors, (133), 35 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:34:30,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:30,900 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:30,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-04-14 00:34:31,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2025-04-14 00:34:31,100 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:31,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash -434242161, now seen corresponding path program 48 times [2025-04-14 00:34:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:31,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893641756] [2025-04-14 00:34:31,101 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:34:31,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:31,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:34:31,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:31,137 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:34:31,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:31,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893641756] [2025-04-14 00:34:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893641756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:31,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678554194] [2025-04-14 00:34:31,567 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:34:31,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:31,569 INFO L229 MonitoredProcess]: Starting monitored process 59 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:34:31,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-14 00:34:31,764 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:34:31,793 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:31,793 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:34:31,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:31,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:34:31,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:31,992 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:34:31,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:34:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:32,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:32,551 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-14 00:34:32,551 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 138 treesize of output 188 [2025-04-14 00:34:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:33,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678554194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:33,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:33,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2025-04-14 00:34:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808674183] [2025-04-14 00:34:33,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:33,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 00:34:33,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:33,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 00:34:33,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-04-14 00:34:33,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:33,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 818 places, 1188 transitions, 35599 flow. Second operand has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:34:33,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:33,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:33,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:39,887 INFO L116 PetriNetUnfolderBase]: 2768/5023 cut-off events. [2025-04-14 00:34:39,887 INFO L117 PetriNetUnfolderBase]: For 377232/377232 co-relation queries the response was YES. [2025-04-14 00:34:39,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61776 conditions, 5023 events. 2768/5023 cut-off events. For 377232/377232 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 35585 event pairs, 118 based on Foata normal form. 18/5041 useless extension candidates. Maximal degree in co-relation 61548. Up to 1068 conditions per place. [2025-04-14 00:34:39,974 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 671 selfloop transitions, 876 changer transitions 29/1576 dead transitions. [2025-04-14 00:34:39,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 1576 transitions, 47183 flow [2025-04-14 00:34:39,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-14 00:34:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2025-04-14 00:34:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 531 transitions. [2025-04-14 00:34:39,975 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3241758241758242 [2025-04-14 00:34:39,975 INFO L175 Difference]: Start difference. First operand has 818 places, 1188 transitions, 35599 flow. Second operand 78 states and 531 transitions. [2025-04-14 00:34:39,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 1576 transitions, 47183 flow [2025-04-14 00:34:41,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 1576 transitions, 45596 flow, removed 737 selfloop flow, removed 17 redundant places. [2025-04-14 00:34:41,571 INFO L231 Difference]: Finished difference. Result has 898 places, 1354 transitions, 42368 flow [2025-04-14 00:34:41,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=34578, PETRI_DIFFERENCE_MINUEND_PLACES=793, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=718, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=42368, PETRI_PLACES=898, PETRI_TRANSITIONS=1354} [2025-04-14 00:34:41,572 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 877 predicate places. [2025-04-14 00:34:41,572 INFO L485 AbstractCegarLoop]: Abstraction has has 898 places, 1354 transitions, 42368 flow [2025-04-14 00:34:41,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:34:41,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:41,572 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:41,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-14 00:34:41,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-04-14 00:34:41,772 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:41,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash -185344353, now seen corresponding path program 49 times [2025-04-14 00:34:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:41,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964868598] [2025-04-14 00:34:41,773 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:34:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:41,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:34:41,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:41,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:34:41,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:34:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:42,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964868598] [2025-04-14 00:34:42,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964868598] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:42,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901904564] [2025-04-14 00:34:42,360 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:34:42,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:42,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:42,363 INFO L229 MonitoredProcess]: Starting monitored process 60 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:34:42,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-14 00:34:42,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:34:42,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:42,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:34:42,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:42,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:34:42,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:42,859 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:34:42,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:34:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:42,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:43,057 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:43,058 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 214 treesize of output 212 [2025-04-14 00:34:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901904564] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:43,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:43,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-14 00:34:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769138441] [2025-04-14 00:34:43,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:43,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 00:34:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:43,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 00:34:43,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 00:34:43,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:43,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 898 places, 1354 transitions, 42368 flow. Second operand has 34 states, 34 states have (on average 3.823529411764706) internal successors, (130), 34 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:34:43,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:43,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:43,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:47,137 INFO L116 PetriNetUnfolderBase]: 2757/5002 cut-off events. [2025-04-14 00:34:47,137 INFO L117 PetriNetUnfolderBase]: For 404507/404507 co-relation queries the response was YES. [2025-04-14 00:34:47,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63615 conditions, 5002 events. 2757/5002 cut-off events. For 404507/404507 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 35364 event pairs, 246 based on Foata normal form. 19/5017 useless extension candidates. Maximal degree in co-relation 63366. Up to 1582 conditions per place. [2025-04-14 00:34:47,230 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 741 selfloop transitions, 679 changer transitions 25/1445 dead transitions. [2025-04-14 00:34:47,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 1445 transitions, 46464 flow [2025-04-14 00:34:47,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-14 00:34:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-14 00:34:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 261 transitions. [2025-04-14 00:34:47,231 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2701863354037267 [2025-04-14 00:34:47,231 INFO L175 Difference]: Start difference. First operand has 898 places, 1354 transitions, 42368 flow. Second operand 46 states and 261 transitions. [2025-04-14 00:34:47,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 1445 transitions, 46464 flow [2025-04-14 00:34:49,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 1445 transitions, 44327 flow, removed 810 selfloop flow, removed 30 redundant places. [2025-04-14 00:34:49,330 INFO L231 Difference]: Finished difference. Result has 914 places, 1359 transitions, 42102 flow [2025-04-14 00:34:49,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=39890, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=664, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=42102, PETRI_PLACES=914, PETRI_TRANSITIONS=1359} [2025-04-14 00:34:49,331 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 893 predicate places. [2025-04-14 00:34:49,331 INFO L485 AbstractCegarLoop]: Abstraction has has 914 places, 1359 transitions, 42102 flow [2025-04-14 00:34:49,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.823529411764706) internal successors, (130), 34 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:34:49,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:49,331 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:49,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-14 00:34:49,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-14 00:34:49,532 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:49,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:49,533 INFO L85 PathProgramCache]: Analyzing trace with hash -268238923, now seen corresponding path program 50 times [2025-04-14 00:34:49,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:49,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956628282] [2025-04-14 00:34:49,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:34:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:49,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:34:49,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:49,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:34:49,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:49,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956628282] [2025-04-14 00:34:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956628282] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:49,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123472178] [2025-04-14 00:34:49,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:34:49,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:49,941 INFO L229 MonitoredProcess]: Starting monitored process 61 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:34:49,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-14 00:34:50,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:34:50,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:34:50,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:34:50,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:50,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 00:34:50,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:50,434 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:34:50,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:34:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:34:50,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:50,697 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:50,697 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 199 treesize of output 197 [2025-04-14 00:34:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:51,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123472178] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:51,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:51,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 31 [2025-04-14 00:34:51,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962190493] [2025-04-14 00:34:51,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:51,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 00:34:51,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:51,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 00:34:51,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2025-04-14 00:34:51,371 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:51,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 1359 transitions, 42102 flow. Second operand has 32 states, 32 states have (on average 3.875) internal successors, (124), 32 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:34:51,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:51,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:51,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:54,126 INFO L116 PetriNetUnfolderBase]: 2791/5059 cut-off events. [2025-04-14 00:34:54,127 INFO L117 PetriNetUnfolderBase]: For 427342/427342 co-relation queries the response was YES. [2025-04-14 00:34:54,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63432 conditions, 5059 events. 2791/5059 cut-off events. For 427342/427342 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 35848 event pairs, 392 based on Foata normal form. 22/5081 useless extension candidates. Maximal degree in co-relation 63182. Up to 2103 conditions per place. [2025-04-14 00:34:54,220 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 830 selfloop transitions, 578 changer transitions 23/1431 dead transitions. [2025-04-14 00:34:54,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 1431 transitions, 46106 flow [2025-04-14 00:34:54,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 00:34:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-14 00:34:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 185 transitions. [2025-04-14 00:34:54,221 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27529761904761907 [2025-04-14 00:34:54,221 INFO L175 Difference]: Start difference. First operand has 914 places, 1359 transitions, 42102 flow. Second operand 32 states and 185 transitions. [2025-04-14 00:34:54,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 1431 transitions, 46106 flow [2025-04-14 00:34:56,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 912 places, 1431 transitions, 45442 flow, removed 179 selfloop flow, removed 25 redundant places. [2025-04-14 00:34:56,125 INFO L231 Difference]: Finished difference. Result has 918 places, 1371 transitions, 43280 flow [2025-04-14 00:34:56,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=41362, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=562, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=43280, PETRI_PLACES=918, PETRI_TRANSITIONS=1371} [2025-04-14 00:34:56,126 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 897 predicate places. [2025-04-14 00:34:56,127 INFO L485 AbstractCegarLoop]: Abstraction has has 918 places, 1371 transitions, 43280 flow [2025-04-14 00:34:56,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.875) internal successors, (124), 32 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:34:56,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:56,127 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:56,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-14 00:34:56,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:56,327 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:34:56,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1829138913, now seen corresponding path program 51 times [2025-04-14 00:34:56,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:56,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746171713] [2025-04-14 00:34:56,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:56,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:56,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:34:56,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-14 00:34:56,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:34:56,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:56,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746171713] [2025-04-14 00:34:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746171713] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:56,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383874485] [2025-04-14 00:34:56,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:56,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:56,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:56,799 INFO L229 MonitoredProcess]: Starting monitored process 62 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:34:56,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-14 00:34:57,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:34:57,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-14 00:34:57,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:34:57,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:57,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:34:57,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:57,317 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:34:57,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:34:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:57,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:57,476 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:57,476 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 215 treesize of output 213 [2025-04-14 00:34:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:34:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383874485] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:58,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-14 00:34:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860511049] [2025-04-14 00:34:58,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:58,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:34:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:58,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:34:58,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:34:58,170 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:34:58,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 1371 transitions, 43280 flow. Second operand has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:34:58,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:58,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:34:58,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:01,244 INFO L116 PetriNetUnfolderBase]: 2862/5220 cut-off events. [2025-04-14 00:35:01,244 INFO L117 PetriNetUnfolderBase]: For 466626/466626 co-relation queries the response was YES. [2025-04-14 00:35:01,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66261 conditions, 5220 events. 2862/5220 cut-off events. For 466626/466626 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 37408 event pairs, 362 based on Foata normal form. 44/5264 useless extension candidates. Maximal degree in co-relation 66010. Up to 1656 conditions per place. [2025-04-14 00:35:01,355 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 903 selfloop transitions, 561 changer transitions 40/1504 dead transitions. [2025-04-14 00:35:01,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 1504 transitions, 48889 flow [2025-04-14 00:35:01,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 00:35:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-14 00:35:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 223 transitions. [2025-04-14 00:35:01,356 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.287001287001287 [2025-04-14 00:35:01,356 INFO L175 Difference]: Start difference. First operand has 918 places, 1371 transitions, 43280 flow. Second operand 37 states and 223 transitions. [2025-04-14 00:35:01,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 946 places, 1504 transitions, 48889 flow [2025-04-14 00:35:03,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 1504 transitions, 47797 flow, removed 118 selfloop flow, removed 27 redundant places. [2025-04-14 00:35:03,508 INFO L231 Difference]: Finished difference. Result has 936 places, 1410 transitions, 45205 flow [2025-04-14 00:35:03,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=42096, PETRI_DIFFERENCE_MINUEND_PLACES=883, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=518, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=45205, PETRI_PLACES=936, PETRI_TRANSITIONS=1410} [2025-04-14 00:35:03,509 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 915 predicate places. [2025-04-14 00:35:03,509 INFO L485 AbstractCegarLoop]: Abstraction has has 936 places, 1410 transitions, 45205 flow [2025-04-14 00:35:03,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:35:03,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:03,509 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:03,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-04-14 00:35:03,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:03,710 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:35:03,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash -604770251, now seen corresponding path program 52 times [2025-04-14 00:35:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:03,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218211055] [2025-04-14 00:35:03,711 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:35:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:03,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:35:03,723 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:35:03,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:35:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:03,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218211055] [2025-04-14 00:35:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218211055] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:03,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158674637] [2025-04-14 00:35:03,928 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:35:03,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:03,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:03,930 INFO L229 MonitoredProcess]: Starting monitored process 63 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:35:03,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-14 00:35:04,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:35:04,229 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:35:04,229 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:35:04,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:04,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:35:04,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:04,331 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:35:04,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:35:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:04,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:04,476 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:35:04,476 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 195 treesize of output 191 [2025-04-14 00:35:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:04,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158674637] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:04,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:04,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-14 00:35:04,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945298520] [2025-04-14 00:35:04,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:04,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:35:04,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:04,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:35:04,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:35:04,947 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:35:04,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 1410 transitions, 45205 flow. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:35:04,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:04,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:35:04,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:07,854 INFO L116 PetriNetUnfolderBase]: 2879/5187 cut-off events. [2025-04-14 00:35:07,854 INFO L117 PetriNetUnfolderBase]: For 472518/472518 co-relation queries the response was YES. [2025-04-14 00:35:07,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68294 conditions, 5187 events. 2879/5187 cut-off events. For 472518/472518 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 36622 event pairs, 207 based on Foata normal form. 11/5194 useless extension candidates. Maximal degree in co-relation 68035. Up to 2011 conditions per place. [2025-04-14 00:35:07,958 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 736 selfloop transitions, 767 changer transitions 13/1516 dead transitions. [2025-04-14 00:35:07,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 1516 transitions, 50464 flow [2025-04-14 00:35:07,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 00:35:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 00:35:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 253 transitions. [2025-04-14 00:35:07,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3011904761904762 [2025-04-14 00:35:07,960 INFO L175 Difference]: Start difference. First operand has 936 places, 1410 transitions, 45205 flow. Second operand 40 states and 253 transitions. [2025-04-14 00:35:07,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 1516 transitions, 50464 flow [2025-04-14 00:35:09,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 1516 transitions, 48708 flow, removed 298 selfloop flow, removed 23 redundant places. [2025-04-14 00:35:09,957 INFO L231 Difference]: Finished difference. Result has 944 places, 1428 transitions, 46264 flow [2025-04-14 00:35:09,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=43414, PETRI_DIFFERENCE_MINUEND_PLACES=898, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=744, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=46264, PETRI_PLACES=944, PETRI_TRANSITIONS=1428} [2025-04-14 00:35:09,957 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 923 predicate places. [2025-04-14 00:35:09,958 INFO L485 AbstractCegarLoop]: Abstraction has has 944 places, 1428 transitions, 46264 flow [2025-04-14 00:35:09,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:35:09,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:09,958 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:09,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2025-04-14 00:35:10,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-04-14 00:35:10,158 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:35:10,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -602262041, now seen corresponding path program 53 times [2025-04-14 00:35:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:10,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806573616] [2025-04-14 00:35:10,159 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:35:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:10,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:35:10,181 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:35:10,181 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:35:10,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 00:35:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:10,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806573616] [2025-04-14 00:35:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806573616] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:10,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027247821] [2025-04-14 00:35:10,717 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:35:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:10,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:10,727 INFO L229 MonitoredProcess]: Starting monitored process 64 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:35:10,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-14 00:35:10,958 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:35:11,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:35:11,002 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:35:11,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:11,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:35:11,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:11,167 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:35:11,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-14 00:35:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:35:11,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:11,297 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:35:11,298 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 211 treesize of output 207 [2025-04-14 00:35:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027247821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:11,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 26 [2025-04-14 00:35:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26905836] [2025-04-14 00:35:11,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:11,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 00:35:11,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:11,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 00:35:11,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2025-04-14 00:35:11,808 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:35:11,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 1428 transitions, 46264 flow. Second operand has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:35:11,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:11,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:35:11,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:14,959 INFO L116 PetriNetUnfolderBase]: 3001/5406 cut-off events. [2025-04-14 00:35:14,960 INFO L117 PetriNetUnfolderBase]: For 499902/499902 co-relation queries the response was YES. [2025-04-14 00:35:15,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71553 conditions, 5406 events. 3001/5406 cut-off events. For 499902/499902 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 38519 event pairs, 226 based on Foata normal form. 5/5407 useless extension candidates. Maximal degree in co-relation 71296. Up to 2136 conditions per place. [2025-04-14 00:35:15,073 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 789 selfloop transitions, 765 changer transitions 11/1565 dead transitions. [2025-04-14 00:35:15,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 1565 transitions, 52961 flow [2025-04-14 00:35:15,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 00:35:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 00:35:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 238 transitions. [2025-04-14 00:35:15,074 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2025-04-14 00:35:15,074 INFO L175 Difference]: Start difference. First operand has 944 places, 1428 transitions, 46264 flow. Second operand 36 states and 238 transitions. [2025-04-14 00:35:15,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 1565 transitions, 52961 flow [2025-04-14 00:35:17,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 1565 transitions, 51445 flow, removed 436 selfloop flow, removed 24 redundant places. [2025-04-14 00:35:17,443 INFO L231 Difference]: Finished difference. Result has 965 places, 1484 transitions, 49175 flow [2025-04-14 00:35:17,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=45084, PETRI_DIFFERENCE_MINUEND_PLACES=915, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=715, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=49175, PETRI_PLACES=965, PETRI_TRANSITIONS=1484} [2025-04-14 00:35:17,444 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 944 predicate places. [2025-04-14 00:35:17,444 INFO L485 AbstractCegarLoop]: Abstraction has has 965 places, 1484 transitions, 49175 flow [2025-04-14 00:35:17,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:35:17,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:17,444 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:17,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-04-14 00:35:17,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:17,645 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:35:17,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -133680993, now seen corresponding path program 54 times [2025-04-14 00:35:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:17,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446626428] [2025-04-14 00:35:17,646 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:35:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:17,661 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:35:17,692 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:35:17,692 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:35:17,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:18,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446626428] [2025-04-14 00:35:18,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446626428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:18,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819939076] [2025-04-14 00:35:18,212 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:35:18,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:18,214 INFO L229 MonitoredProcess]: Starting monitored process 65 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:35:18,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-14 00:35:18,452 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:35:18,478 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:35:18,478 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:35:18,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:18,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:35:18,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:18,734 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:35:18,734 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:35:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:18,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:18,913 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:35:18,913 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 211 treesize of output 207 [2025-04-14 00:35:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:19,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819939076] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:19,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:19,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-14 00:35:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604775374] [2025-04-14 00:35:19,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:19,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:35:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:19,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:35:19,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:35:19,756 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:35:19,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 965 places, 1484 transitions, 49175 flow. Second operand has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:35:19,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:19,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:35:19,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:22,904 INFO L116 PetriNetUnfolderBase]: 2994/5405 cut-off events. [2025-04-14 00:35:22,904 INFO L117 PetriNetUnfolderBase]: For 526781/526781 co-relation queries the response was YES. [2025-04-14 00:35:22,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73055 conditions, 5405 events. 2994/5405 cut-off events. For 526781/526781 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 38452 event pairs, 267 based on Foata normal form. 27/5432 useless extension candidates. Maximal degree in co-relation 72790. Up to 1295 conditions per place. [2025-04-14 00:35:23,010 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 711 selfloop transitions, 842 changer transitions 30/1583 dead transitions. [2025-04-14 00:35:23,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 1583 transitions, 53354 flow [2025-04-14 00:35:23,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-14 00:35:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-14 00:35:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 256 transitions. [2025-04-14 00:35:23,011 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28349944629014395 [2025-04-14 00:35:23,011 INFO L175 Difference]: Start difference. First operand has 965 places, 1484 transitions, 49175 flow. Second operand 43 states and 256 transitions. [2025-04-14 00:35:23,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 1583 transitions, 53354 flow [2025-04-14 00:35:25,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 1583 transitions, 52076 flow, removed 356 selfloop flow, removed 17 redundant places. [2025-04-14 00:35:25,377 INFO L231 Difference]: Finished difference. Result has 996 places, 1484 transitions, 49925 flow [2025-04-14 00:35:25,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=47501, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=819, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=49925, PETRI_PLACES=996, PETRI_TRANSITIONS=1484} [2025-04-14 00:35:25,378 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 975 predicate places. [2025-04-14 00:35:25,378 INFO L485 AbstractCegarLoop]: Abstraction has has 996 places, 1484 transitions, 49925 flow [2025-04-14 00:35:25,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:35:25,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:25,378 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:25,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-14 00:35:25,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:25,579 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:35:25,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1507429607, now seen corresponding path program 55 times [2025-04-14 00:35:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:25,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449088238] [2025-04-14 00:35:25,580 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:35:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:25,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:35:25,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:35:25,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:35:25,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:35:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:26,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449088238] [2025-04-14 00:35:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449088238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:26,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145380296] [2025-04-14 00:35:26,174 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:35:26,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:26,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:26,176 INFO L229 MonitoredProcess]: Starting monitored process 66 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:35:26,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-14 00:35:26,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:35:26,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:35:26,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:35:26,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:26,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:35:26,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:26,568 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:35:26,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:35:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:26,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:26,721 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:35:26,722 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 226 treesize of output 222 [2025-04-14 00:35:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:27,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145380296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:27,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:27,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-14 00:35:27,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750215185] [2025-04-14 00:35:27,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:27,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 00:35:27,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:27,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 00:35:27,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 00:35:27,445 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:35:27,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 996 places, 1484 transitions, 49925 flow. Second operand has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:35:27,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:27,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:35:27,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:30,884 INFO L116 PetriNetUnfolderBase]: 3043/5451 cut-off events. [2025-04-14 00:35:30,884 INFO L117 PetriNetUnfolderBase]: For 571545/571545 co-relation queries the response was YES. [2025-04-14 00:35:30,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75847 conditions, 5451 events. 3043/5451 cut-off events. For 571545/571545 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 38454 event pairs, 435 based on Foata normal form. 5/5452 useless extension candidates. Maximal degree in co-relation 75576. Up to 2200 conditions per place. [2025-04-14 00:35:30,992 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 931 selfloop transitions, 631 changer transitions 11/1573 dead transitions. [2025-04-14 00:35:30,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1573 transitions, 54947 flow [2025-04-14 00:35:30,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 00:35:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 00:35:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 234 transitions. [2025-04-14 00:35:30,993 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2785714285714286 [2025-04-14 00:35:30,993 INFO L175 Difference]: Start difference. First operand has 996 places, 1484 transitions, 49925 flow. Second operand 40 states and 234 transitions. [2025-04-14 00:35:30,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1573 transitions, 54947 flow [2025-04-14 00:35:33,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1573 transitions, 53906 flow, removed 256 selfloop flow, removed 26 redundant places. [2025-04-14 00:35:33,602 INFO L231 Difference]: Finished difference. Result has 999 places, 1498 transitions, 51813 flow [2025-04-14 00:35:33,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48852, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=610, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=51813, PETRI_PLACES=999, PETRI_TRANSITIONS=1498} [2025-04-14 00:35:33,603 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 978 predicate places. [2025-04-14 00:35:33,603 INFO L485 AbstractCegarLoop]: Abstraction has has 999 places, 1498 transitions, 51813 flow [2025-04-14 00:35:33,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:35:33,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:33,604 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:33,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-04-14 00:35:33,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2025-04-14 00:35:33,804 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:35:33,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2111419367, now seen corresponding path program 56 times [2025-04-14 00:35:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:33,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976003784] [2025-04-14 00:35:33,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:35:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:33,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:35:33,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:35:33,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:35:33,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:34,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976003784] [2025-04-14 00:35:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976003784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:34,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658740535] [2025-04-14 00:35:34,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:35:34,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:34,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:34,185 INFO L229 MonitoredProcess]: Starting monitored process 67 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:35:34,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-14 00:35:34,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:35:34,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:35:34,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:35:34,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:34,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-14 00:35:34,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:34,717 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-14 00:35:34,718 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-14 00:35:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:35:34,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:35,141 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-14 00:35:35,142 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 209 treesize of output 247 [2025-04-14 00:35:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658740535] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:36,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:36,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-14 00:35:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670689450] [2025-04-14 00:35:36,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:36,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 00:35:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:36,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 00:35:36,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 00:35:36,876 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:35:36,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1498 transitions, 51813 flow. Second operand has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 33 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:35:36,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:36,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:35:36,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:40,569 INFO L116 PetriNetUnfolderBase]: 3106/5580 cut-off events. [2025-04-14 00:35:40,570 INFO L117 PetriNetUnfolderBase]: For 598643/598643 co-relation queries the response was YES. [2025-04-14 00:35:40,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78564 conditions, 5580 events. 3106/5580 cut-off events. For 598643/598643 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 39681 event pairs, 421 based on Foata normal form. 10/5590 useless extension candidates. Maximal degree in co-relation 78299. Up to 1872 conditions per place. [2025-04-14 00:35:40,688 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 1002 selfloop transitions, 573 changer transitions 19/1594 dead transitions. [2025-04-14 00:35:40,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 1594 transitions, 56766 flow [2025-04-14 00:35:40,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 00:35:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 00:35:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 219 transitions. [2025-04-14 00:35:40,689 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2673992673992674 [2025-04-14 00:35:40,689 INFO L175 Difference]: Start difference. First operand has 999 places, 1498 transitions, 51813 flow. Second operand 39 states and 219 transitions. [2025-04-14 00:35:40,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1032 places, 1594 transitions, 56766 flow [2025-04-14 00:35:43,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1594 transitions, 56299 flow, removed 133 selfloop flow, removed 28 redundant places. [2025-04-14 00:35:43,619 INFO L231 Difference]: Finished difference. Result has 1015 places, 1517 transitions, 53484 flow [2025-04-14 00:35:43,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=51354, PETRI_DIFFERENCE_MINUEND_PLACES=966, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=552, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=53484, PETRI_PLACES=1015, PETRI_TRANSITIONS=1517} [2025-04-14 00:35:43,620 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 994 predicate places. [2025-04-14 00:35:43,620 INFO L485 AbstractCegarLoop]: Abstraction has has 1015 places, 1517 transitions, 53484 flow [2025-04-14 00:35:43,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 33 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:35:43,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:43,620 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:43,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-14 00:35:43,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:43,821 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:35:43,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1434901273, now seen corresponding path program 57 times [2025-04-14 00:35:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:43,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810740059] [2025-04-14 00:35:43,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:35:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:43,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:35:43,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-14 00:35:43,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:35:43,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:44,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:44,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810740059] [2025-04-14 00:35:44,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810740059] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:44,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103920524] [2025-04-14 00:35:44,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:35:44,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:44,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:44,353 INFO L229 MonitoredProcess]: Starting monitored process 68 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:35:44,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-14 00:35:44,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:35:44,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-14 00:35:44,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:35:44,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:44,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:35:44,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:44,859 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:35:44,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:35:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:44,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:44,984 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:35:44,984 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 211 treesize of output 207 [2025-04-14 00:35:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103920524] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:45,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:45,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-14 00:35:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976564230] [2025-04-14 00:35:45,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:45,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:35:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:45,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:35:45,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:35:45,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:35:45,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1517 transitions, 53484 flow. Second operand has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:35:45,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:45,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:35:45,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:49,032 INFO L116 PetriNetUnfolderBase]: 3200/5783 cut-off events. [2025-04-14 00:35:49,033 INFO L117 PetriNetUnfolderBase]: For 654575/654575 co-relation queries the response was YES. [2025-04-14 00:35:49,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82874 conditions, 5783 events. 3200/5783 cut-off events. For 654575/654575 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 41645 event pairs, 421 based on Foata normal form. 20/5803 useless extension candidates. Maximal degree in co-relation 82600. Up to 1938 conditions per place. [2025-04-14 00:35:49,151 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 1017 selfloop transitions, 613 changer transitions 25/1655 dead transitions. [2025-04-14 00:35:49,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 1655 transitions, 59960 flow [2025-04-14 00:35:49,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 00:35:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 00:35:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 237 transitions. [2025-04-14 00:35:49,152 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29699248120300753 [2025-04-14 00:35:49,152 INFO L175 Difference]: Start difference. First operand has 1015 places, 1517 transitions, 53484 flow. Second operand 38 states and 237 transitions. [2025-04-14 00:35:49,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 1655 transitions, 59960 flow [2025-04-14 00:35:52,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1655 transitions, 59279 flow, removed 115 selfloop flow, removed 24 redundant places. [2025-04-14 00:35:52,242 INFO L231 Difference]: Finished difference. Result has 1038 places, 1569 transitions, 56583 flow [2025-04-14 00:35:52,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52840, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=572, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=56583, PETRI_PLACES=1038, PETRI_TRANSITIONS=1569} [2025-04-14 00:35:52,243 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1017 predicate places. [2025-04-14 00:35:52,243 INFO L485 AbstractCegarLoop]: Abstraction has has 1038 places, 1569 transitions, 56583 flow [2025-04-14 00:35:52,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:35:52,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:52,243 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:52,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-14 00:35:52,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2025-04-14 00:35:52,444 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:35:52,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1324078753, now seen corresponding path program 58 times [2025-04-14 00:35:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:52,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736427178] [2025-04-14 00:35:52,445 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:35:52,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:52,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:35:52,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:35:52,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:35:52,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:52,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:52,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736427178] [2025-04-14 00:35:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736427178] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:52,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179256290] [2025-04-14 00:35:52,643 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:35:52,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:52,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:52,645 INFO L229 MonitoredProcess]: Starting monitored process 69 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:35:52,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-14 00:35:52,864 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:35:52,871 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-14 00:35:52,871 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:35:52,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:52,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:35:52,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:52,984 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:35:52,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-14 00:35:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:53,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:53,154 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:35:53,154 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 215 treesize of output 213 [2025-04-14 00:35:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:35:53,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179256290] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:53,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:53,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-14 00:35:53,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141144376] [2025-04-14 00:35:53,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:53,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:35:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:53,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:35:53,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:35:53,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:35:53,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1038 places, 1569 transitions, 56583 flow. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:35:53,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:53,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:35:53,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:57,126 INFO L116 PetriNetUnfolderBase]: 3252/5835 cut-off events. [2025-04-14 00:35:57,126 INFO L117 PetriNetUnfolderBase]: For 697652/697652 co-relation queries the response was YES. [2025-04-14 00:35:57,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86328 conditions, 5835 events. 3252/5835 cut-off events. For 697652/697652 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 41746 event pairs, 482 based on Foata normal form. 5/5836 useless extension candidates. Maximal degree in co-relation 86044. Up to 3677 conditions per place. [2025-04-14 00:35:57,249 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 1091 selfloop transitions, 549 changer transitions 11/1651 dead transitions. [2025-04-14 00:35:57,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1057 places, 1651 transitions, 62022 flow [2025-04-14 00:35:57,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:35:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:35:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 168 transitions. [2025-04-14 00:35:57,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2025-04-14 00:35:57,250 INFO L175 Difference]: Start difference. First operand has 1038 places, 1569 transitions, 56583 flow. Second operand 26 states and 168 transitions. [2025-04-14 00:35:57,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1057 places, 1651 transitions, 62022 flow [2025-04-14 00:36:00,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1039 places, 1651 transitions, 60537 flow, removed 461 selfloop flow, removed 18 redundant places. [2025-04-14 00:36:00,327 INFO L231 Difference]: Finished difference. Result has 1044 places, 1589 transitions, 57692 flow [2025-04-14 00:36:00,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=55197, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=530, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1036, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=57692, PETRI_PLACES=1044, PETRI_TRANSITIONS=1589} [2025-04-14 00:36:00,328 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1023 predicate places. [2025-04-14 00:36:00,328 INFO L485 AbstractCegarLoop]: Abstraction has has 1044 places, 1589 transitions, 57692 flow [2025-04-14 00:36:00,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:36:00,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:00,328 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:00,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-14 00:36:00,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2025-04-14 00:36:00,529 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:36:00,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash 713895263, now seen corresponding path program 59 times [2025-04-14 00:36:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:00,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015817851] [2025-04-14 00:36:00,530 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:36:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:00,539 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:36:00,551 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:36:00,551 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:36:00,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 00:36:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:01,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015817851] [2025-04-14 00:36:01,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015817851] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:01,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524561296] [2025-04-14 00:36:01,120 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:36:01,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:01,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:01,123 INFO L229 MonitoredProcess]: Starting monitored process 70 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:36:01,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-14 00:36:01,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:36:01,393 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:36:01,393 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:36:01,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:01,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 00:36:01,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:01,605 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-14 00:36:01,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-14 00:36:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-14 00:36:01,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:01,798 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:36:01,799 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 211 treesize of output 207 [2025-04-14 00:36:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:02,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524561296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:36:02,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:36:02,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 28 [2025-04-14 00:36:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706985700] [2025-04-14 00:36:02,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:36:02,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:36:02,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:36:02,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:36:02,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:36:02,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:36:02,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 1589 transitions, 57692 flow. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:36:02,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:36:02,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:36:02,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:36:06,197 INFO L116 PetriNetUnfolderBase]: 3354/6013 cut-off events. [2025-04-14 00:36:06,197 INFO L117 PetriNetUnfolderBase]: For 735443/735443 co-relation queries the response was YES. [2025-04-14 00:36:06,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89857 conditions, 6013 events. 3354/6013 cut-off events. For 735443/735443 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 43307 event pairs, 402 based on Foata normal form. 7/6016 useless extension candidates. Maximal degree in co-relation 89574. Up to 3512 conditions per place. [2025-04-14 00:36:06,336 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 1012 selfloop transitions, 691 changer transitions 12/1715 dead transitions. [2025-04-14 00:36:06,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1077 places, 1715 transitions, 64421 flow [2025-04-14 00:36:06,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 00:36:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 00:36:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 253 transitions. [2025-04-14 00:36:06,337 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3011904761904762 [2025-04-14 00:36:06,337 INFO L175 Difference]: Start difference. First operand has 1044 places, 1589 transitions, 57692 flow. Second operand 40 states and 253 transitions. [2025-04-14 00:36:06,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1077 places, 1715 transitions, 64421 flow [2025-04-14 00:36:09,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1058 places, 1715 transitions, 63993 flow, removed 138 selfloop flow, removed 19 redundant places. [2025-04-14 00:36:09,650 INFO L231 Difference]: Finished difference. Result has 1070 places, 1632 transitions, 61253 flow [2025-04-14 00:36:09,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=57203, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=651, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=61253, PETRI_PLACES=1070, PETRI_TRANSITIONS=1632} [2025-04-14 00:36:09,651 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1049 predicate places. [2025-04-14 00:36:09,651 INFO L485 AbstractCegarLoop]: Abstraction has has 1070 places, 1632 transitions, 61253 flow [2025-04-14 00:36:09,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:36:09,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:09,652 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:09,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-14 00:36:09,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:09,852 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:36:09,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash -34751393, now seen corresponding path program 60 times [2025-04-14 00:36:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:09,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909875240] [2025-04-14 00:36:09,853 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:36:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:09,862 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:36:09,871 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 00:36:09,871 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:36:09,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:10,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:10,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909875240] [2025-04-14 00:36:10,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909875240] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:10,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096242199] [2025-04-14 00:36:10,203 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:36:10,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:10,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:10,204 INFO L229 MonitoredProcess]: Starting monitored process 71 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:36:10,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-14 00:36:10,423 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-14 00:36:10,442 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 00:36:10,442 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:36:10,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:10,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:36:10,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:10,690 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 00:36:10,690 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-14 00:36:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:10,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:10,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:36:10,867 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 215 treesize of output 213 [2025-04-14 00:36:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096242199] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:36:11,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:36:11,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-14 00:36:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413173674] [2025-04-14 00:36:11,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:36:11,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:36:11,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:36:11,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:36:11,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:36:11,758 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:36:11,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1070 places, 1632 transitions, 61253 flow. Second operand has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:36:11,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:36:11,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:36:11,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:36:15,412 INFO L116 PetriNetUnfolderBase]: 3358/6028 cut-off events. [2025-04-14 00:36:15,412 INFO L117 PetriNetUnfolderBase]: For 783817/783817 co-relation queries the response was YES. [2025-04-14 00:36:15,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91995 conditions, 6028 events. 3358/6028 cut-off events. For 783817/783817 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 43389 event pairs, 360 based on Foata normal form. 13/6041 useless extension candidates. Maximal degree in co-relation 91704. Up to 2106 conditions per place. [2025-04-14 00:36:15,546 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 963 selfloop transitions, 717 changer transitions 20/1700 dead transitions. [2025-04-14 00:36:15,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1098 places, 1700 transitions, 65540 flow [2025-04-14 00:36:15,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 00:36:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-14 00:36:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 186 transitions. [2025-04-14 00:36:15,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2683982683982684 [2025-04-14 00:36:15,547 INFO L175 Difference]: Start difference. First operand has 1070 places, 1632 transitions, 61253 flow. Second operand 33 states and 186 transitions. [2025-04-14 00:36:15,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1098 places, 1700 transitions, 65540 flow [2025-04-14 00:36:19,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1065 places, 1700 transitions, 63439 flow, removed 478 selfloop flow, removed 33 redundant places. [2025-04-14 00:36:19,144 INFO L231 Difference]: Finished difference. Result has 1074 places, 1637 transitions, 60885 flow [2025-04-14 00:36:19,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=58807, PETRI_DIFFERENCE_MINUEND_PLACES=1033, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=701, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=60885, PETRI_PLACES=1074, PETRI_TRANSITIONS=1637} [2025-04-14 00:36:19,145 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1053 predicate places. [2025-04-14 00:36:19,145 INFO L485 AbstractCegarLoop]: Abstraction has has 1074 places, 1637 transitions, 60885 flow [2025-04-14 00:36:19,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:36:19,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:19,145 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:19,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-14 00:36:19,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:19,346 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:36:19,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash 205064040, now seen corresponding path program 61 times [2025-04-14 00:36:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:19,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552072619] [2025-04-14 00:36:19,347 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:36:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:19,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:36:19,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:36:19,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:36:19,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:36:19,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:19,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552072619] [2025-04-14 00:36:19,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552072619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:19,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714736953] [2025-04-14 00:36:19,807 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:36:19,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:19,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:19,808 INFO L229 MonitoredProcess]: Starting monitored process 72 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:36:19,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-14 00:36:20,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:36:20,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:36:20,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:36:20,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:20,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:36:20,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:20,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:20,245 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:36:20,245 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 50 treesize of output 87 [2025-04-14 00:36:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:20,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714736953] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:36:20,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:36:20,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2025-04-14 00:36:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444240077] [2025-04-14 00:36:20,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:36:20,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:36:20,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:36:20,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:36:20,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:36:20,348 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:36:20,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1074 places, 1637 transitions, 60885 flow. Second operand has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:36:20,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:36:20,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:36:20,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:36:23,933 INFO L116 PetriNetUnfolderBase]: 3384/6055 cut-off events. [2025-04-14 00:36:23,933 INFO L117 PetriNetUnfolderBase]: For 808421/808421 co-relation queries the response was YES. [2025-04-14 00:36:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92871 conditions, 6055 events. 3384/6055 cut-off events. For 808421/808421 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 43450 event pairs, 519 based on Foata normal form. 40/6091 useless extension candidates. Maximal degree in co-relation 92584. Up to 2712 conditions per place. [2025-04-14 00:36:24,084 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1058 selfloop transitions, 661 changer transitions 0/1719 dead transitions. [2025-04-14 00:36:24,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1094 places, 1719 transitions, 66046 flow [2025-04-14 00:36:24,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 00:36:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-14 00:36:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 219 transitions. [2025-04-14 00:36:24,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31601731601731603 [2025-04-14 00:36:24,085 INFO L175 Difference]: Start difference. First operand has 1074 places, 1637 transitions, 60885 flow. Second operand 33 states and 219 transitions. [2025-04-14 00:36:24,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1094 places, 1719 transitions, 66046 flow [2025-04-14 00:36:27,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1073 places, 1719 transitions, 65186 flow, removed 98 selfloop flow, removed 21 redundant places. [2025-04-14 00:36:27,866 INFO L231 Difference]: Finished difference. Result has 1076 places, 1650 transitions, 61885 flow [2025-04-14 00:36:27,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=59818, PETRI_DIFFERENCE_MINUEND_PLACES=1041, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=648, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=981, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=61885, PETRI_PLACES=1076, PETRI_TRANSITIONS=1650} [2025-04-14 00:36:27,867 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1055 predicate places. [2025-04-14 00:36:27,867 INFO L485 AbstractCegarLoop]: Abstraction has has 1076 places, 1650 transitions, 61885 flow [2025-04-14 00:36:27,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:36:27,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:27,868 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:27,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2025-04-14 00:36:28,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2025-04-14 00:36:28,068 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:36:28,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1372379360, now seen corresponding path program 62 times [2025-04-14 00:36:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:28,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013376980] [2025-04-14 00:36:28,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:36:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:28,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:36:28,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:36:28,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:36:28,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:28,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:28,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013376980] [2025-04-14 00:36:28,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013376980] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:28,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271135834] [2025-04-14 00:36:28,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:36:28,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:28,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:28,378 INFO L229 MonitoredProcess]: Starting monitored process 73 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:36:28,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-14 00:36:28,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:36:28,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:36:28,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:36:28,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:28,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 00:36:28,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:36:28,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:28,818 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:36:28,818 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 48 treesize of output 81 [2025-04-14 00:36:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271135834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:36:28,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:36:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 24 [2025-04-14 00:36:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797682583] [2025-04-14 00:36:28,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:36:28,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 00:36:28,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:36:28,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 00:36:28,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-04-14 00:36:28,897 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:36:28,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1076 places, 1650 transitions, 61885 flow. Second operand has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:36:28,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:36:28,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:36:28,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:36:32,190 INFO L116 PetriNetUnfolderBase]: 3411/6122 cut-off events. [2025-04-14 00:36:32,191 INFO L117 PetriNetUnfolderBase]: For 842898/842898 co-relation queries the response was YES. [2025-04-14 00:36:32,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94885 conditions, 6122 events. 3411/6122 cut-off events. For 842898/842898 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 44210 event pairs, 737 based on Foata normal form. 35/6157 useless extension candidates. Maximal degree in co-relation 94598. Up to 3981 conditions per place. [2025-04-14 00:36:32,325 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1302 selfloop transitions, 422 changer transitions 0/1724 dead transitions. [2025-04-14 00:36:32,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1100 places, 1724 transitions, 66868 flow [2025-04-14 00:36:32,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 00:36:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 00:36:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 185 transitions. [2025-04-14 00:36:32,326 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3262786596119929 [2025-04-14 00:36:32,326 INFO L175 Difference]: Start difference. First operand has 1076 places, 1650 transitions, 61885 flow. Second operand 27 states and 185 transitions. [2025-04-14 00:36:32,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1100 places, 1724 transitions, 66868 flow [2025-04-14 00:36:36,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1075 places, 1724 transitions, 65456 flow, removed 187 selfloop flow, removed 25 redundant places. [2025-04-14 00:36:36,382 INFO L231 Difference]: Finished difference. Result has 1081 places, 1657 transitions, 61698 flow [2025-04-14 00:36:36,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=59939, PETRI_DIFFERENCE_MINUEND_PLACES=1049, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=61698, PETRI_PLACES=1081, PETRI_TRANSITIONS=1657} [2025-04-14 00:36:36,383 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1060 predicate places. [2025-04-14 00:36:36,384 INFO L485 AbstractCegarLoop]: Abstraction has has 1081 places, 1657 transitions, 61698 flow [2025-04-14 00:36:36,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:36:36,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:36,384 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:36,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-14 00:36:36,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-14 00:36:36,584 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:36:36,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1982947670, now seen corresponding path program 63 times [2025-04-14 00:36:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:36,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054545933] [2025-04-14 00:36:36,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:36:36,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:36,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:36:36,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-14 00:36:36,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:36:36,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:36,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:36,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054545933] [2025-04-14 00:36:36,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054545933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:36,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893113751] [2025-04-14 00:36:36,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:36:36,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:36,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:36,844 INFO L229 MonitoredProcess]: Starting monitored process 74 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:36:36,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-14 00:36:37,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:36:37,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-14 00:36:37,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:36:37,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:37,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-14 00:36:37,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:37,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:37,472 INFO L325 Elim1Store]: treesize reduction 22, result has 87.8 percent of original size [2025-04-14 00:36:37,472 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 72 treesize of output 177 [2025-04-14 00:36:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:37,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893113751] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:36:37,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:36:37,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-04-14 00:36:37,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386104225] [2025-04-14 00:36:37,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:36:37,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:36:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:36:37,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:36:37,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:36:37,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:36:37,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1081 places, 1657 transitions, 61698 flow. Second operand has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 29 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:36:37,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:36:37,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:36:37,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:36:41,033 INFO L116 PetriNetUnfolderBase]: 3433/6166 cut-off events. [2025-04-14 00:36:41,033 INFO L117 PetriNetUnfolderBase]: For 850401/850401 co-relation queries the response was YES. [2025-04-14 00:36:41,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95962 conditions, 6166 events. 3433/6166 cut-off events. For 850401/850401 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 44593 event pairs, 549 based on Foata normal form. 15/6181 useless extension candidates. Maximal degree in co-relation 95672. Up to 2856 conditions per place. [2025-04-14 00:36:41,170 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 1085 selfloop transitions, 632 changer transitions 0/1717 dead transitions. [2025-04-14 00:36:41,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1102 places, 1717 transitions, 66089 flow [2025-04-14 00:36:41,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:36:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:36:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 163 transitions. [2025-04-14 00:36:41,171 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32341269841269843 [2025-04-14 00:36:41,171 INFO L175 Difference]: Start difference. First operand has 1081 places, 1657 transitions, 61698 flow. Second operand 24 states and 163 transitions. [2025-04-14 00:36:41,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1102 places, 1717 transitions, 66089 flow [2025-04-14 00:36:45,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1081 places, 1717 transitions, 65230 flow, removed 184 selfloop flow, removed 21 redundant places. [2025-04-14 00:36:45,355 INFO L231 Difference]: Finished difference. Result has 1084 places, 1661 transitions, 62163 flow [2025-04-14 00:36:45,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=60607, PETRI_DIFFERENCE_MINUEND_PLACES=1058, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=623, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1020, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=62163, PETRI_PLACES=1084, PETRI_TRANSITIONS=1661} [2025-04-14 00:36:45,356 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1063 predicate places. [2025-04-14 00:36:45,356 INFO L485 AbstractCegarLoop]: Abstraction has has 1084 places, 1661 transitions, 62163 flow [2025-04-14 00:36:45,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 29 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:36:45,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:45,356 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:45,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-14 00:36:45,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:45,557 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:36:45,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash 943466724, now seen corresponding path program 64 times [2025-04-14 00:36:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:45,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309299640] [2025-04-14 00:36:45,558 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:36:45,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:45,567 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:36:45,571 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-14 00:36:45,571 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:36:45,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:45,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:45,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309299640] [2025-04-14 00:36:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309299640] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:45,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193872682] [2025-04-14 00:36:45,677 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:36:45,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:45,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:45,679 INFO L229 MonitoredProcess]: Starting monitored process 75 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:36:45,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-14 00:36:45,915 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:36:45,924 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-14 00:36:45,924 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:36:45,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:45,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:36:45,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:45,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:46,066 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:36:46,066 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 48 treesize of output 81 [2025-04-14 00:36:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:36:46,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193872682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:36:46,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:36:46,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-14 00:36:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484034791] [2025-04-14 00:36:46,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:36:46,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:36:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:36:46,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:36:46,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-04-14 00:36:46,130 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:36:46,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1084 places, 1661 transitions, 62163 flow. Second operand has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:36:46,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:36:46,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:36:46,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:36:49,546 INFO L116 PetriNetUnfolderBase]: 3405/6166 cut-off events. [2025-04-14 00:36:49,547 INFO L117 PetriNetUnfolderBase]: For 863051/863051 co-relation queries the response was YES. [2025-04-14 00:36:49,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96181 conditions, 6166 events. 3405/6166 cut-off events. For 863051/863051 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 45108 event pairs, 994 based on Foata normal form. 30/6192 useless extension candidates. Maximal degree in co-relation 95891. Up to 5241 conditions per place. [2025-04-14 00:36:49,684 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 1473 selfloop transitions, 227 changer transitions 0/1700 dead transitions. [2025-04-14 00:36:49,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1099 places, 1700 transitions, 65616 flow [2025-04-14 00:36:49,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:36:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:36:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 150 transitions. [2025-04-14 00:36:49,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37593984962406013 [2025-04-14 00:36:49,685 INFO L175 Difference]: Start difference. First operand has 1084 places, 1661 transitions, 62163 flow. Second operand 19 states and 150 transitions. [2025-04-14 00:36:49,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1099 places, 1700 transitions, 65616 flow [2025-04-14 00:36:53,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1083 places, 1700 transitions, 64575 flow, removed 42 selfloop flow, removed 16 redundant places. [2025-04-14 00:36:53,439 INFO L231 Difference]: Finished difference. Result has 1086 places, 1651 transitions, 61126 flow [2025-04-14 00:36:53,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=60408, PETRI_DIFFERENCE_MINUEND_PLACES=1065, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=61126, PETRI_PLACES=1086, PETRI_TRANSITIONS=1651} [2025-04-14 00:36:53,440 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1065 predicate places. [2025-04-14 00:36:53,440 INFO L485 AbstractCegarLoop]: Abstraction has has 1086 places, 1651 transitions, 61126 flow [2025-04-14 00:36:53,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:36:53,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:53,440 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:53,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-04-14 00:36:53,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:53,641 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:36:53,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1682353613, now seen corresponding path program 65 times [2025-04-14 00:36:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:53,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268231381] [2025-04-14 00:36:53,642 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:36:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:53,652 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:36:53,781 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:36:53,781 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:36:53,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 00:36:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:54,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268231381] [2025-04-14 00:36:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268231381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:54,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654006110] [2025-04-14 00:36:54,180 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:36:54,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:54,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:54,181 INFO L229 MonitoredProcess]: Starting monitored process 76 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:36:54,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-14 00:36:54,430 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:36:54,558 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:36:54,558 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:36:54,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:54,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-14 00:36:54,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:36:54,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:55,918 INFO L325 Elim1Store]: treesize reduction 22, result has 96.3 percent of original size [2025-04-14 00:36:55,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 177 treesize of output 632 [2025-04-14 00:38:32,435 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,451 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,481 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,495 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,505 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:32,636 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,644 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,848 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,874 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,908 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,922 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:32,930 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:33,061 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:33,071 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:33,547 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:34,093 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:34,103 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:34,165 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:34,256 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:34,309 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:34,381 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:34,512 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:41,901 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:41,959 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,139 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:42,147 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,171 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,183 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:42,228 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:42,236 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,259 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,272 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:42,313 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:42,320 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:42,363 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,368 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:42,528 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,533 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,539 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,579 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:42,925 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:43,009 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:43,160 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:43,207 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:43,211 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:43,269 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:43,278 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:43,294 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:43,302 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:43,340 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:43,348 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:43,384 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:43,418 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:43,430 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:43,450 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:43,459 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:45,530 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:45,556 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:45,569 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:45,580 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:45,610 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:45,700 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:45,727 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:45,746 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:38:46,023 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:46,105 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:46,369 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:46,388 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:46,528 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:46,597 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:46,613 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:46,706 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:46,772 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:46,809 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:46,861 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:46,904 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:46,940 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:47,041 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:47,078 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:47,115 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:47,158 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:47,176 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:47,192 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:47,276 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:47,495 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:47,607 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:47,635 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:47,801 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:47,838 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:47,878 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:48,014 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:48,051 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:48,090 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:48,210 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:48,231 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:48,247 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:48,278 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:48,298 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:48,384 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:48,808 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:48,836 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:48,951 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:49,023 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,046 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:49,084 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,127 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,141 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:49,293 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,307 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:49,407 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:49,466 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,529 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:49,557 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:49,630 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,655 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,704 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,758 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:49,817 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:49,837 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:38:49,899 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:50,009 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:50,100 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:50,164 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:50,255 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:50,287 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:50,675 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:50,692 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:50,760 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:50,803 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:50,911 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:51,004 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:51,098 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:51,168 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:51,186 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:51,248 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:51,357 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:51,461 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:51,696 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:38:51,979 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:52,109 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:38:52,339 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:38:52,525 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:52,648 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:38:52,860 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:53,048 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:53,141 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:53,158 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:53,237 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:53,282 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:53,384 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:53,557 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:53,572 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:53,605 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:53,631 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:53,653 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:53,670 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:54,136 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:54,174 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:54,210 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:54,247 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:54,389 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:54,407 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:54,453 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:54,546 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:54,635 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:54,798 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:54,887 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:54,970 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:55,009 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:55,079 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:55,215 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:55,253 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:55,300 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:55,338 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:55,518 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:55,623 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:55,693 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:55,781 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:55,969 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,008 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,043 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,081 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,226 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,349 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:56,439 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,606 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:56,694 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,796 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,849 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:56,882 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:56,985 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:57,018 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:57,120 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:57,160 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:57,193 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:57,237 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:38:57,276 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:57,346 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:57,720 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:38:57,931 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:58,042 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:38:58,254 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:58,514 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:58,556 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:38:58,599 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:58,791 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:58,931 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:38:59,118 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:59,253 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:59,380 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:38:59,568 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:38:59,895 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:00,001 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:00,035 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:00,125 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:00,215 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:00,454 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:00,501 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:00,726 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:00,822 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:00,909 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:00,938 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:01,038 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:01,098 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:01,135 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:01,219 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:01,246 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:01,348 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:01,407 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:01,432 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:01,475 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:01,566 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:02,290 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:02,332 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:02,338 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:02,373 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:02,390 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:02,397 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:02,415 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:02,631 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:02,660 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:02,698 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:02,740 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:02,800 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:02,811 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:03,128 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,146 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:03,164 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,181 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:03,192 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:03,228 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,398 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:03,469 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:03,525 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,542 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:03,630 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,672 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:03,681 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,780 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,822 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:03,831 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,973 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:03,989 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,009 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,024 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,199 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,218 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:04,250 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:04,329 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,348 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:04,380 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:04,483 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:04,495 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,510 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,548 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,563 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:04,682 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:04,697 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:04,703 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:04,949 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:04,987 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:05,026 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,206 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,347 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:05,364 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,371 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:05,383 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:05,399 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,405 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:05,658 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,740 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,761 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,868 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,903 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:05,993 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:06,000 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:06,055 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:06,073 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:06,150 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:06,394 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:06,491 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:06,621 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:06,644 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:07,464 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:07,473 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:07,494 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:07,537 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:07,653 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:07,658 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:07,669 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:07,676 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:07,691 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:07,702 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:07,748 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:07,753 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:07,764 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:07,770 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:07,784 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:07,794 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:07,827 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:07,841 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:07,854 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:07,867 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:07,893 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:07,932 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:08,044 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,049 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,067 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:08,117 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,122 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,133 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,139 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:08,154 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,164 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:08,197 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:08,212 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,226 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,236 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:08,260 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:08,298 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:08,420 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,427 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,441 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,458 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,479 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,547 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:08,605 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,620 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:08,679 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:08,694 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:08,816 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,835 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,841 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,890 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:08,902 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,933 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,943 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:08,969 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:08,983 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:09,034 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:09,152 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:09,180 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:09,219 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:09,232 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:09,289 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:09,304 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:09,337 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:09,352 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:09,632 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:09,700 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:09,734 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:09,798 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:09,810 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:09,815 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:09,851 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:09,955 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:09,984 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:09,999 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,042 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,137 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:10,167 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,182 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,271 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,287 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,323 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:10,369 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:10,411 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,443 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,496 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,523 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:10,568 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:10,624 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,641 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,764 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:10,784 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,825 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:10,873 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:10,894 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:10,981 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:11,020 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:11,131 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:11,147 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:11,196 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:11,212 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:11,492 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:11,509 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:11,547 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:11,572 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:11,605 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:11,622 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:11,682 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:11,729 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:11,756 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:11,963 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:11,977 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:12,013 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:12,034 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:12,067 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:12,082 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:12,393 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:12,445 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:12,453 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:12,469 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:12,483 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:12,517 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:12,606 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:12,625 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:12,705 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:12,740 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:12,776 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:13,128 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:13,177 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:13,226 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:13,283 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:13,302 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:13,311 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:13,511 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:13,542 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:13,597 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:13,628 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:13,722 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:13,766 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:13,798 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:13,819 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:13,900 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:13,943 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:13,958 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,227 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,300 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:14,316 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:14,414 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,438 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,457 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,470 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,555 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,568 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,587 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,610 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,661 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,780 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,855 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,880 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,899 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,913 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:14,965 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:14,986 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,096 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,119 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,162 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,200 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,232 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,324 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,405 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:15,414 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:15,420 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:15,453 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,510 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:15,627 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:15,941 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:16,246 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:16,308 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:16,400 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:16,454 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:17,161 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:17,880 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:17,903 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:18,264 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:18,811 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:18,829 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:18,866 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:18,960 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:18,978 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:19,015 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:19,097 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:19,115 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:19,152 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:19,220 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:19,244 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:19,461 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:19,852 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:19,871 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:19,977 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:19,995 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:20,054 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:20,178 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:20,294 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:20,393 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:20,523 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:20,660 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:20,686 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:20,703 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:20,740 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:20,775 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:20,856 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:21,044 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:21,382 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:21,507 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:21,627 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:21,834 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:21,966 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:22,000 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:22,050 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:22,205 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:22,240 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:22,290 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:22,436 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:22,467 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:22,488 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:22,516 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:22,555 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:22,670 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:22,705 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:22,758 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:22,793 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:22,842 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:22,958 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:23,192 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:23,410 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:23,460 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:23,527 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:23,619 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:23,636 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:23,769 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:23,787 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:23,826 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:23,852 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:23,929 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:23,955 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:24,177 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:24,273 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:24,337 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:24,380 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:24,397 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:24,512 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:24,538 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:24,668 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:24,744 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:24,823 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:25,022 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:25,114 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:25,197 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:25,262 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:25,386 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:25,420 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:25,574 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:25,620 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:25,650 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:25,736 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:25,765 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:25,866 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:25,925 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:25,950 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:25,970 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:26,020 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:26,041 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:26,059 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:26,840 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:26,930 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:27,042 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:27,131 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:27,408 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:27,476 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:27,564 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:27,574 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:27,607 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:27,647 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:27,721 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:27,756 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:27,790 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:27,882 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:27,916 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:27,987 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:28,022 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:28,039 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:28,073 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:28,091 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:28,134 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:28,168 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:28,202 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:28,453 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:28,471 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:28,562 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:28,737 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:28,828 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:28,861 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,191 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:29,281 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,315 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,387 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,426 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,459 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,497 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,536 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,569 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,840 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:29,950 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:30,067 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:30,077 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:30,114 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:30,331 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:30,351 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:30,368 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:30,420 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:30,497 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:30,708 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:30,799 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:30,833 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,169 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:31,272 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,306 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,399 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,438 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,471 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,511 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,552 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,587 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,719 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:31,737 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,790 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:31,871 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:31,903 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:31,920 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:31,972 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:32,265 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:32,427 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:32,464 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:32,552 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:32,611 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:32,710 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:32,802 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:33,070 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:33,105 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:33,187 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:33,222 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:33,682 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:33,738 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:33,778 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:33,830 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:34,204 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:34,386 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:34,621 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:34,817 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:35,022 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:35,114 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:35,264 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:35,462 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:35,850 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:35,871 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:36,072 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:36,107 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:36,219 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:36,443 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:36,626 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:36,847 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:37,096 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:37,129 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:37,173 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:37,223 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:37,466 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:37,562 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:37,580 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:37,686 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:37,794 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:37,913 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:37,963 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:38,123 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:38,231 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:38,248 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:38,299 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:38,334 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:38,486 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:38,651 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:38,745 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:38,846 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:39,033 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:39,375 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-14 00:39:40,082 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:40,104 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:40,112 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:40,132 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:40,257 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:40,290 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:40,298 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:40,371 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:40,434 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:40,442 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:41,140 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,158 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,185 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:41,227 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,246 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,281 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:41,430 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:41,467 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:41,518 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,744 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:41,780 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:41,827 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,920 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,938 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,956 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:41,992 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:42,010 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:42,027 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:42,311 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:42,320 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:42,330 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:42,409 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:42,536 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:42,628 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:42,655 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:42,674 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:42,690 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:42,763 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:42,984 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:42,994 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:43,003 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:43,081 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:43,246 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:43,285 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:43,305 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:43,323 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:43,342 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:43,360 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:43,383 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:43,402 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:43,415 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:43,453 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:43,601 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:43,612 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:43,719 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:43,751 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:43,777 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:43,844 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:43,901 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:43,918 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:44,554 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:44,581 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:44,606 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:44,625 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:44,632 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:44,644 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:44,663 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:44,679 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:44,742 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:44,760 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:44,767 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:44,779 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:44,807 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:44,888 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:44,908 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:44,928 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:45,041 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:45,075 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:45,242 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:45,262 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:45,529 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:45,549 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:45,584 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:45,597 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:45,604 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:45,712 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:45,746 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:45,756 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:45,768 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:45,775 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:45,816 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:45,863 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:45,924 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:45,936 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:46,156 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:46,242 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:46,255 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:46,353 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:46,397 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:46,463 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:46,482 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:46,499 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:46,523 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:46,567 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:46,669 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:46,682 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:46,707 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:46,726 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:46,743 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:46,860 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:47,043 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:47,123 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:47,157 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:47,242 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:47,261 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:47,299 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:47,384 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:47,398 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:47,443 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:47,508 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:47,527 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:47,563 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:47,631 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:47,646 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:47,667 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:47,677 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:47,706 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:47,727 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:47,735 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:47,757 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:47,841 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:47,875 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:47,974 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:48,019 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:48,075 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:48,118 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:48,208 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:48,368 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:48,634 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:48,655 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:48,672 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:48,797 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:48,818 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:48,827 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:48,871 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:48,890 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:48,907 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:48,952 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:48,994 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:49,177 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:49,197 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:49,432 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:49,474 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:49,810 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:50,046 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:50,076 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:50,106 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:50,185 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:50,399 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:50,547 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:50,599 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:50,654 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:50,680 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:50,841 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:50,857 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:50,885 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:50,923 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:50,932 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:50,965 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:50,988 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:51,077 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:51,118 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:51,200 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:51,225 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:51,284 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:51,372 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:51,536 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:51,555 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:51,650 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:51,668 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:51,868 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:51,886 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:51,927 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:51,946 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:52,019 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:52,038 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:52,073 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:52,106 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:52,157 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:52,184 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:52,255 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:52,418 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:52,461 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:52,638 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:52,671 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:52,696 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:52,717 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:52,760 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:52,837 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:52,897 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:52,952 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:52,986 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:53,013 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:53,033 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:53,049 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:53,183 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:53,359 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:53,403 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:53,685 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:53,703 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:53,786 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:53,820 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:53,849 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:53,998 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,017 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,081 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,098 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,138 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,157 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,277 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,297 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,516 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,547 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,711 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,738 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,760 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,780 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,789 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:54,818 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,838 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,848 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:54,861 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:54,871 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,888 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,921 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:54,948 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:55,098 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:55,109 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:55,126 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:55,258 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:55,529 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:55,565 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:55,598 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:55,642 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:55,828 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:55,847 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:55,875 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:55,888 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:55,898 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:56,014 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:56,028 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:56,038 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:56,050 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:56,066 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:56,203 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:56,222 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:56,490 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:56,589 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:56,600 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:56,677 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:56,718 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:56,785 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:56,827 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:56,890 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:56,906 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:57,032 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:57,049 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:57,089 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:57,121 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:57,147 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:57,228 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:57,477 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:57,585 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:57,635 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:57,729 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:57,760 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:57,796 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:57,814 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:57,855 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:57,936 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:57,971 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:58,061 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:58,075 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:58,083 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:58,141 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:58,159 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:58,195 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:58,212 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:58,283 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:58,365 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:58,400 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:58,502 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:58,556 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:58,640 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:58,653 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:58,661 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:58,699 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:39:58,740 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:58,827 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:39:59,017 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:59,060 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:59,207 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:59,224 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:59,697 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:59,736 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:59,856 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:59,877 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:59,887 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:39:59,901 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:39:59,912 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:39:59,934 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:00,049 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:00,061 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:00,079 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:00,578 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:00,677 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:00,714 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:00,740 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:00,841 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:00,886 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:00,984 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:00,994 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:01,143 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:01,156 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:01,448 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:01,571 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:01,601 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:01,752 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:02,015 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:02,042 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:02,063 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:02,080 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:02,122 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:02,140 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:02,178 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:02,232 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:02,242 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:02,265 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:02,277 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:02,308 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:02,339 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:02,369 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:02,380 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:02,457 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:02,497 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:03,006 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:03,020 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:03,112 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:03,127 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:03,149 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:03,189 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:03,198 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:03,701 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:03,713 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:03,730 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:03,893 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:03,916 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:03,928 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:03,942 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:03,953 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:03,971 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:03,996 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,050 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:04,096 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,134 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:04,227 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,258 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:04,300 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,315 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:04,350 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:04,438 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,468 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,491 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:04,530 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,542 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:04,559 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:04,771 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:04,787 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:04,846 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,879 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:04,902 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:04,941 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:05,182 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,275 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,306 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:05,468 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,496 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,519 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:05,540 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:05,550 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:05,580 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:05,601 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:05,612 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:05,626 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:05,636 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,654 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,687 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,716 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,867 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:05,879 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:05,898 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:06,118 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:06,171 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:06,334 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:06,354 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:06,494 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:06,513 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:06,577 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:06,612 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:06,637 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:06,672 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:06,691 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:06,920 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:07,042 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:07,083 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:07,170 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:07,299 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:07,345 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:07,436 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:07,467 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:07,502 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:07,519 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:07,561 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:07,640 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:07,675 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:07,766 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:07,780 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:07,787 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:07,847 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:07,865 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:07,901 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:07,918 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:07,990 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:08,070 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:08,106 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:08,204 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:08,251 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:08,305 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:08,319 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:08,327 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:08,542 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:08,641 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:08,653 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:08,735 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:08,785 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:08,853 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:08,926 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:08,983 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:09,001 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:09,018 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:09,062 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:09,092 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:09,134 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:09,181 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:09,212 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:09,239 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:11,122 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:11,145 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:11,882 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:11,929 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:11,981 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:12,001 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:12,009 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:12,056 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:12,127 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:12,159 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:12,233 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:12,310 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:12,388 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:12,418 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:12,549 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:12,568 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:12,619 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:12,761 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:12,797 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:12,996 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:13,152 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:13,297 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:13,342 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:13,361 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:13,369 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:13,415 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:13,487 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:13,608 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:14,127 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:14,186 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:14,204 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:14,234 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:14,311 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:14,329 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:14,340 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:14,671 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:14,724 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:14,814 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:14,843 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:14,895 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:14,943 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:14,990 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:15,081 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:15,130 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:15,211 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:15,230 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:15,256 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:15,293 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:15,479 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:15,498 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:15,524 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:15,561 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:15,750 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:15,800 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:15,937 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:15,963 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:16,052 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:16,127 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:16,172 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:16,202 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:16,225 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:16,270 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:16,301 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:16,352 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:16,432 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:16,480 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:16,520 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:16,530 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:16,598 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:16,616 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:16,634 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:16,644 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:16,680 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:16,733 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:17,203 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:17,253 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:17,475 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:17,495 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:17,521 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:17,694 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:17,713 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:17,741 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:18,013 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:18,099 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:18,192 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:18,257 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:18,403 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:18,458 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:18,543 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:18,583 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:18,592 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:18,661 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:18,678 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:18,695 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:18,706 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:18,741 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:18,795 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:18,830 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:18,920 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:18,939 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:18,957 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:19,093 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:19,144 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:19,180 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:19,199 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:19,234 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:19,257 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:19,308 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:19,327 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:19,345 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:19,439 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:19,450 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:19,485 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:19,599 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:19,620 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:19,634 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:19,653 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:19,666 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:19,760 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:19,863 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:19,959 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:20,032 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:20,457 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:20,490 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:20,521 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:20,539 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:20,591 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:20,610 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:20,683 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:20,708 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:20,773 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:20,784 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:20,893 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:20,985 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:21,097 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:21,139 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:21,485 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:21,580 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:21,705 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:22,126 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:22,251 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:22,401 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:22,435 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:22,676 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:22,711 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:22,793 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:22,827 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:23,163 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:23,295 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:23,313 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:23,369 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:23,529 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:23,547 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:23,601 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:23,613 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:23,626 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:23,723 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:23,743 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:23,761 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:23,855 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:23,865 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:23,875 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:23,961 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:24,025 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:24,122 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:24,141 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:24,204 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:24,366 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:24,501 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:24,524 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:24,552 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:24,589 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:24,687 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:25,341 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:25,375 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:25,426 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:25,454 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:25,561 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:25,605 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:25,641 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:25,686 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:25,747 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:25,781 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:25,826 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:25,877 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:25,965 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:25,999 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:26,047 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:26,099 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:26,132 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:26,198 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:26,227 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:26,275 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:26,455 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:26,476 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:26,555 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:26,596 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:26,690 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:26,730 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-14 00:40:26,859 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:26,878 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:27,305 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:27,446 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:27,465 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:27,504 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:27,660 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:27,678 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:27,804 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:27,830 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:27,981 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:28,009 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:28,060 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:28,189 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:28,217 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:28,249 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:28,348 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:28,382 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:28,415 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:28,532 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:28,917 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:28,941 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:28,949 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:28,970 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:29,271 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:29,403 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:29,428 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:29,511 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:29,587 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:29,605 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:29,703 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,054 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:30,124 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,134 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,141 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:30,251 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:30,260 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,301 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:30,312 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,465 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:30,539 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,546 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,564 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:30,590 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:30,611 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:30,628 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:30,662 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,670 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,723 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:30,734 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:30,751 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,776 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:30,839 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,896 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:30,967 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,976 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:30,983 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:31,088 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:31,099 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:31,140 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:31,152 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:31,416 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:31,490 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:31,641 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:31,655 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:31,726 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:31,965 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:32,212 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:32,218 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:32,252 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:32,259 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:32,296 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:32,497 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:32,536 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:32,556 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:32,581 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:32,599 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:32,618 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:32,712 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:32,783 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:32,867 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,193 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,222 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,251 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,258 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:33,297 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,305 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:33,319 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,343 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,387 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,419 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,454 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,463 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:33,646 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:33,765 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,002 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,110 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,361 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,414 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,426 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:34,439 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,528 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,598 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:34,614 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,733 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,756 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,778 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:34,828 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:34,839 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,893 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,935 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:34,946 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:34,988 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,052 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,174 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,183 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,190 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:35,203 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:35,213 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,220 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,229 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:35,239 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,246 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,376 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,385 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,392 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:35,405 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:35,415 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,422 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,431 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:35,441 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,447 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,837 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:35,882 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:36,102 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:36,193 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:36,224 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:36,265 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,281 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:36,291 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,337 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:36,461 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,488 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:36,498 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,569 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:36,629 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,656 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:36,666 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,751 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,771 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,833 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,854 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,935 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:36,957 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:37,322 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:37,338 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,348 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,362 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:37,376 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,386 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,409 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,480 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,491 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,521 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,532 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,547 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:37,567 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:37,623 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,883 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:37,946 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:38,118 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:38,134 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:38,168 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:38,259 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:38,514 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:38,529 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:38,587 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:38,602 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:38,741 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:38,781 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:38,964 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:38,988 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:39,555 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:39,577 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:39,774 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:39,810 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:39,882 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:39,920 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:40,103 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:40,221 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:40,571 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:40,681 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:40,709 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:40,793 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:40,824 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:40,878 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:40,901 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:40,973 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,010 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,034 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,102 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,130 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,154 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,228 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,257 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,281 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:41,516 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:41,537 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:41,563 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:41,599 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:41,620 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:41,748 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:41,786 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:41,814 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:41,835 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,034 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,048 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,070 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,100 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,129 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,146 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,192 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,220 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,237 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,353 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,370 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,393 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,472 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,489 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,510 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,538 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,571 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,587 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:42,645 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:42,671 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:42,701 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:42,759 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:42,791 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:42,862 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:42,887 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:42,917 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:42,949 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:42,974 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:43,019 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:43,029 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:43,137 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:43,229 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:43,240 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:43,247 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:43,285 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:43,350 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:43,534 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:43,561 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:43,612 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:43,874 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:43,951 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:44,057 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:44,093 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:44,116 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:44,147 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:44,176 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:44,365 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:44,955 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:44,980 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:45,027 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,069 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,101 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,162 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,182 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,202 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,226 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,270 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,303 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,331 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,431 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,480 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,608 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,618 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:45,690 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:45,708 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:45,799 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:46,441 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:46,648 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:46,658 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:46,678 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:46,708 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:46,731 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:46,774 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:46,909 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:47,110 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:47,186 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:47,347 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:47,366 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:47,451 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:47,478 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:47,490 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:47,708 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:47,826 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,091 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,121 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,290 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,320 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,485 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,600 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,638 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,741 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:48,767 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:49,007 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:49,054 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:49,325 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:49,352 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:49,520 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:49,590 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:49,695 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:49,731 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:50,076 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:50,111 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:50,168 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:50,198 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:50,237 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:50,379 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:50,405 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:50,449 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:50,826 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:50,919 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:50,960 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:50,981 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:51,071 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:51,274 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:51,432 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:51,486 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:51,509 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:51,547 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:51,565 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:51,665 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:51,707 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:51,727 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-14 00:40:52,097 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:52,145 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:52,181 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:52,213 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:52,239 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:52,684 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:52,696 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:52,766 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:52,896 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:53,138 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:53,156 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:53,182 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:53,276 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:53,302 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:53,632 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:53,671 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:54,999 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:55,072 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:55,218 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:55,240 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:55,271 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:55,355 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:55,377 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:55,405 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 00:40:55,482 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:40:55,490 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:55,528 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:40:55,729 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:42:18,448 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 00:42:18,532 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:42:18,626 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 00:42:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:42:20,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654006110] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:42:20,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:42:20,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 31 [2025-04-14 00:42:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256508142] [2025-04-14 00:42:20,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:42:20,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:42:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:20,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:42:20,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:42:20,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:42:20,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1086 places, 1651 transitions, 61126 flow. Second operand has 31 states, 31 states have (on average 3.774193548387097) internal successors, (117), 31 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:20,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:20,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:42:20,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:25,752 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:42:32,231 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:42:37,989 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:42:40,616 INFO L116 PetriNetUnfolderBase]: 3540/6421 cut-off events. [2025-04-14 00:42:40,616 INFO L117 PetriNetUnfolderBase]: For 902798/902798 co-relation queries the response was YES. [2025-04-14 00:42:40,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101062 conditions, 6421 events. 3540/6421 cut-off events. For 902798/902798 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 47310 event pairs, 478 based on Foata normal form. 23/6440 useless extension candidates. Maximal degree in co-relation 100769. Up to 3711 conditions per place. [2025-04-14 00:42:40,793 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 1082 selfloop transitions, 724 changer transitions 14/1820 dead transitions. [2025-04-14 00:42:40,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1147 places, 1820 transitions, 69243 flow [2025-04-14 00:42:40,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-14 00:42:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-04-14 00:42:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 374 transitions. [2025-04-14 00:42:40,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2872503840245776 [2025-04-14 00:42:40,795 INFO L175 Difference]: Start difference. First operand has 1086 places, 1651 transitions, 61126 flow. Second operand 62 states and 374 transitions. [2025-04-14 00:42:40,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1147 places, 1820 transitions, 69243 flow [2025-04-14 00:42:45,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1131 places, 1820 transitions, 68044 flow, removed 69 selfloop flow, removed 16 redundant places. [2025-04-14 00:42:45,554 INFO L231 Difference]: Finished difference. Result has 1144 places, 1715 transitions, 65148 flow [2025-04-14 00:42:45,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=59768, PETRI_DIFFERENCE_MINUEND_PLACES=1070, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=666, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=65148, PETRI_PLACES=1144, PETRI_TRANSITIONS=1715} [2025-04-14 00:42:45,555 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1123 predicate places. [2025-04-14 00:42:45,555 INFO L485 AbstractCegarLoop]: Abstraction has has 1144 places, 1715 transitions, 65148 flow [2025-04-14 00:42:45,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.774193548387097) internal successors, (117), 31 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:45,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:45,556 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:42:45,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2025-04-14 00:42:45,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2025-04-14 00:42:45,757 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:42:45,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash 74832427, now seen corresponding path program 66 times [2025-04-14 00:42:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:45,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528448336] [2025-04-14 00:42:45,758 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:42:45,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:45,770 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:42:45,787 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:42:45,787 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:42:45,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:42:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:46,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528448336] [2025-04-14 00:42:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528448336] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:42:46,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596604500] [2025-04-14 00:42:46,080 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:42:46,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:42:46,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:42:46,082 INFO L229 MonitoredProcess]: Starting monitored process 77 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:42:46,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-04-14 00:42:46,342 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:42:46,368 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:42:46,369 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:42:46,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:46,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:42:46,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:42:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:42:46,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:42:46,972 INFO L325 Elim1Store]: treesize reduction 77, result has 73.9 percent of original size [2025-04-14 00:42:46,973 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 78 treesize of output 237 [2025-04-14 00:42:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:42:47,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596604500] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:42:47,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:42:47,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-14 00:42:47,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008528285] [2025-04-14 00:42:47,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:42:47,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:42:47,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:47,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:42:47,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:42:47,257 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:42:47,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1144 places, 1715 transitions, 65148 flow. Second operand has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:42:47,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:47,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:42:47,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:51,397 INFO L116 PetriNetUnfolderBase]: 3495/6333 cut-off events. [2025-04-14 00:42:51,397 INFO L117 PetriNetUnfolderBase]: For 925551/925551 co-relation queries the response was YES. [2025-04-14 00:42:51,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100014 conditions, 6333 events. 3495/6333 cut-off events. For 925551/925551 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 46567 event pairs, 1086 based on Foata normal form. 20/6353 useless extension candidates. Maximal degree in co-relation 99709. Up to 5584 conditions per place. [2025-04-14 00:42:51,550 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 1545 selfloop transitions, 203 changer transitions 0/1748 dead transitions. [2025-04-14 00:42:51,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1160 places, 1748 transitions, 68771 flow [2025-04-14 00:42:51,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:42:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:42:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 142 transitions. [2025-04-14 00:42:51,551 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3219954648526077 [2025-04-14 00:42:51,551 INFO L175 Difference]: Start difference. First operand has 1144 places, 1715 transitions, 65148 flow. Second operand 21 states and 142 transitions. [2025-04-14 00:42:51,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1160 places, 1748 transitions, 68771 flow [2025-04-14 00:42:56,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1117 places, 1748 transitions, 66223 flow, removed 732 selfloop flow, removed 43 redundant places. [2025-04-14 00:42:56,263 INFO L231 Difference]: Finished difference. Result has 1119 places, 1705 transitions, 62663 flow [2025-04-14 00:42:56,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=62046, PETRI_DIFFERENCE_MINUEND_PLACES=1097, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=62663, PETRI_PLACES=1119, PETRI_TRANSITIONS=1705} [2025-04-14 00:42:56,265 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1098 predicate places. [2025-04-14 00:42:56,265 INFO L485 AbstractCegarLoop]: Abstraction has has 1119 places, 1705 transitions, 62663 flow [2025-04-14 00:42:56,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:42:56,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:56,265 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:42:56,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-04-14 00:42:56,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:42:56,466 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:42:56,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 252739538, now seen corresponding path program 67 times [2025-04-14 00:42:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:56,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81956083] [2025-04-14 00:42:56,467 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:42:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:56,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:42:56,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:42:56,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:42:56,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:42:56,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:56,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81956083] [2025-04-14 00:42:56,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81956083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:42:56,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16325062] [2025-04-14 00:42:56,927 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:42:56,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:42:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:42:56,929 INFO L229 MonitoredProcess]: Starting monitored process 78 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:42:56,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-04-14 00:42:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:42:57,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:42:57,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:42:57,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:57,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 00:42:57,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:42:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:42:57,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:42:57,625 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-14 00:42:57,626 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 63 treesize of output 150 [2025-04-14 00:42:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:42:57,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16325062] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:42:57,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:42:57,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-14 00:42:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042955199] [2025-04-14 00:42:57,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:42:57,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:42:57,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:57,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:42:57,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:42:57,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:42:57,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1119 places, 1705 transitions, 62663 flow. Second operand has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:57,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:57,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:42:57,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:02,905 INFO L116 PetriNetUnfolderBase]: 3502/6344 cut-off events. [2025-04-14 00:43:02,905 INFO L117 PetriNetUnfolderBase]: For 870468/870468 co-relation queries the response was YES. [2025-04-14 00:43:03,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97705 conditions, 6344 events. 3502/6344 cut-off events. For 870468/870468 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 46638 event pairs, 490 based on Foata normal form. 12/6352 useless extension candidates. Maximal degree in co-relation 97405. Up to 2438 conditions per place. [2025-04-14 00:43:03,059 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1256 selfloop transitions, 593 changer transitions 5/1854 dead transitions. [2025-04-14 00:43:03,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1153 places, 1854 transitions, 68968 flow [2025-04-14 00:43:03,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 00:43:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 00:43:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 263 transitions. [2025-04-14 00:43:03,061 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32957393483709274 [2025-04-14 00:43:03,061 INFO L175 Difference]: Start difference. First operand has 1119 places, 1705 transitions, 62663 flow. Second operand 38 states and 263 transitions. [2025-04-14 00:43:03,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1153 places, 1854 transitions, 68968 flow [2025-04-14 00:43:07,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1138 places, 1854 transitions, 68728 flow, removed 50 selfloop flow, removed 15 redundant places. [2025-04-14 00:43:07,790 INFO L231 Difference]: Finished difference. Result has 1141 places, 1704 transitions, 63524 flow [2025-04-14 00:43:07,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=62212, PETRI_DIFFERENCE_MINUEND_PLACES=1101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=581, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=63524, PETRI_PLACES=1141, PETRI_TRANSITIONS=1704} [2025-04-14 00:43:07,792 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1120 predicate places. [2025-04-14 00:43:07,792 INFO L485 AbstractCegarLoop]: Abstraction has has 1141 places, 1704 transitions, 63524 flow [2025-04-14 00:43:07,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:07,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:07,792 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:07,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-04-14 00:43:07,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:43:07,993 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:43:07,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 746381694, now seen corresponding path program 68 times [2025-04-14 00:43:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:07,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791782265] [2025-04-14 00:43:07,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:43:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:08,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:43:08,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:43:08,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:43:08,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:08,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791782265] [2025-04-14 00:43:08,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791782265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:43:08,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473488589] [2025-04-14 00:43:08,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:43:08,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:43:08,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:43:08,321 INFO L229 MonitoredProcess]: Starting monitored process 79 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:08,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-04-14 00:43:08,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:43:08,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:43:08,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:43:08,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:08,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-14 00:43:08,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:43:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:43:08,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:43:08,947 INFO L325 Elim1Store]: treesize reduction 32, result has 82.2 percent of original size [2025-04-14 00:43:08,947 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 72 treesize of output 167 [2025-04-14 00:43:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:09,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473488589] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:43:09,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:43:09,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 25 [2025-04-14 00:43:09,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552928578] [2025-04-14 00:43:09,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:43:09,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:43:09,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:09,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:43:09,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:43:09,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:43:09,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1141 places, 1704 transitions, 63524 flow. Second operand has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:09,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:09,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:43:09,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:13,145 INFO L116 PetriNetUnfolderBase]: 3502/6340 cut-off events. [2025-04-14 00:43:13,145 INFO L117 PetriNetUnfolderBase]: For 881034/881034 co-relation queries the response was YES. [2025-04-14 00:43:13,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98866 conditions, 6340 events. 3502/6340 cut-off events. For 881034/881034 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 46582 event pairs, 1059 based on Foata normal form. 20/6360 useless extension candidates. Maximal degree in co-relation 98565. Up to 5536 conditions per place. [2025-04-14 00:43:13,314 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1522 selfloop transitions, 219 changer transitions 0/1741 dead transitions. [2025-04-14 00:43:13,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1156 places, 1741 transitions, 67367 flow [2025-04-14 00:43:13,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:43:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:43:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 140 transitions. [2025-04-14 00:43:13,315 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2025-04-14 00:43:13,315 INFO L175 Difference]: Start difference. First operand has 1141 places, 1704 transitions, 63524 flow. Second operand 22 states and 140 transitions. [2025-04-14 00:43:13,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1156 places, 1741 transitions, 67367 flow [2025-04-14 00:43:18,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1125 places, 1741 transitions, 66621 flow, removed 65 selfloop flow, removed 31 redundant places. [2025-04-14 00:43:18,381 INFO L231 Difference]: Finished difference. Result has 1127 places, 1704 transitions, 63216 flow [2025-04-14 00:43:18,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=62533, PETRI_DIFFERENCE_MINUEND_PLACES=1104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=63216, PETRI_PLACES=1127, PETRI_TRANSITIONS=1704} [2025-04-14 00:43:18,383 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1106 predicate places. [2025-04-14 00:43:18,383 INFO L485 AbstractCegarLoop]: Abstraction has has 1127 places, 1704 transitions, 63216 flow [2025-04-14 00:43:18,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:18,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:18,383 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:18,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2025-04-14 00:43:18,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:43:18,584 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:43:18,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2024954642, now seen corresponding path program 69 times [2025-04-14 00:43:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:18,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430221535] [2025-04-14 00:43:18,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:43:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:18,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:43:18,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-14 00:43:18,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:43:18,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:18,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430221535] [2025-04-14 00:43:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430221535] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:43:18,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869845581] [2025-04-14 00:43:18,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:43:18,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:43:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:43:18,926 INFO L229 MonitoredProcess]: Starting monitored process 80 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:18,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-04-14 00:43:19,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:43:19,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-14 00:43:19,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:43:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:19,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:43:19,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:43:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:19,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:43:19,430 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:43:19,430 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 50 treesize of output 87 [2025-04-14 00:43:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:19,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869845581] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:43:19,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:43:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-14 00:43:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524790780] [2025-04-14 00:43:19,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:43:19,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:43:19,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:19,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:43:19,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:43:19,516 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:43:19,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1127 places, 1704 transitions, 63216 flow. Second operand has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:19,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:19,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:43:19,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:23,952 INFO L116 PetriNetUnfolderBase]: 3619/6578 cut-off events. [2025-04-14 00:43:23,952 INFO L117 PetriNetUnfolderBase]: For 915757/915757 co-relation queries the response was YES. [2025-04-14 00:43:24,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102702 conditions, 6578 events. 3619/6578 cut-off events. For 915757/915757 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 48788 event pairs, 1157 based on Foata normal form. 30/6608 useless extension candidates. Maximal degree in co-relation 102405. Up to 5898 conditions per place. [2025-04-14 00:43:24,108 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 1661 selfloop transitions, 166 changer transitions 0/1827 dead transitions. [2025-04-14 00:43:24,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1148 places, 1827 transitions, 70333 flow [2025-04-14 00:43:24,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:43:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:43:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 165 transitions. [2025-04-14 00:43:24,110 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-14 00:43:24,110 INFO L175 Difference]: Start difference. First operand has 1127 places, 1704 transitions, 63216 flow. Second operand 22 states and 165 transitions. [2025-04-14 00:43:24,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1148 places, 1827 transitions, 70333 flow [2025-04-14 00:43:29,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1127 places, 1827 transitions, 69517 flow, removed 178 selfloop flow, removed 21 redundant places. [2025-04-14 00:43:29,084 INFO L231 Difference]: Finished difference. Result has 1133 places, 1743 transitions, 64133 flow [2025-04-14 00:43:29,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=62211, PETRI_DIFFERENCE_MINUEND_PLACES=1106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=64133, PETRI_PLACES=1133, PETRI_TRANSITIONS=1743} [2025-04-14 00:43:29,085 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1112 predicate places. [2025-04-14 00:43:29,085 INFO L485 AbstractCegarLoop]: Abstraction has has 1133 places, 1743 transitions, 64133 flow [2025-04-14 00:43:29,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:29,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:29,085 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:29,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2025-04-14 00:43:29,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2025-04-14 00:43:29,286 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:43:29,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash -539839944, now seen corresponding path program 70 times [2025-04-14 00:43:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:29,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840040602] [2025-04-14 00:43:29,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:43:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:29,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:43:29,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-14 00:43:29,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:43:29,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:29,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:29,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840040602] [2025-04-14 00:43:29,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840040602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:43:29,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209044856] [2025-04-14 00:43:29,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:43:29,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:43:29,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:43:29,456 INFO L229 MonitoredProcess]: Starting monitored process 81 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:29,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-04-14 00:43:29,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:43:29,720 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-14 00:43:29,720 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:43:29,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:29,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-14 00:43:29,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:43:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:29,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:43:29,971 INFO L325 Elim1Store]: treesize reduction 30, result has 82.8 percent of original size [2025-04-14 00:43:29,972 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 70 treesize of output 163 [2025-04-14 00:43:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209044856] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:43:30,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:43:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-14 00:43:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719075407] [2025-04-14 00:43:30,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:43:30,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:43:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:30,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:43:30,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:43:30,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:43:30,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1133 places, 1743 transitions, 64133 flow. Second operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:30,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:30,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:43:30,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:34,547 INFO L116 PetriNetUnfolderBase]: 3647/6616 cut-off events. [2025-04-14 00:43:34,547 INFO L117 PetriNetUnfolderBase]: For 937041/937041 co-relation queries the response was YES. [2025-04-14 00:43:34,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103253 conditions, 6616 events. 3647/6616 cut-off events. For 937041/937041 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 49060 event pairs, 1217 based on Foata normal form. 56/6668 useless extension candidates. Maximal degree in co-relation 102953. Up to 6178 conditions per place. [2025-04-14 00:43:34,728 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 1681 selfloop transitions, 124 changer transitions 0/1805 dead transitions. [2025-04-14 00:43:34,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1151 places, 1805 transitions, 69053 flow [2025-04-14 00:43:34,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:43:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:43:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 161 transitions. [2025-04-14 00:43:34,730 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2025-04-14 00:43:34,730 INFO L175 Difference]: Start difference. First operand has 1133 places, 1743 transitions, 64133 flow. Second operand 22 states and 161 transitions. [2025-04-14 00:43:34,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1151 places, 1805 transitions, 69053 flow [2025-04-14 00:43:40,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1138 places, 1805 transitions, 68466 flow, removed 226 selfloop flow, removed 13 redundant places. [2025-04-14 00:43:40,222 INFO L231 Difference]: Finished difference. Result has 1146 places, 1751 transitions, 64205 flow [2025-04-14 00:43:40,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=63067, PETRI_DIFFERENCE_MINUEND_PLACES=1117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=64205, PETRI_PLACES=1146, PETRI_TRANSITIONS=1751} [2025-04-14 00:43:40,224 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1125 predicate places. [2025-04-14 00:43:40,224 INFO L485 AbstractCegarLoop]: Abstraction has has 1146 places, 1751 transitions, 64205 flow [2025-04-14 00:43:40,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:40,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:40,224 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:40,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2025-04-14 00:43:40,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2025-04-14 00:43:40,425 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:43:40,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251039, now seen corresponding path program 71 times [2025-04-14 00:43:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:40,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369682770] [2025-04-14 00:43:40,426 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:43:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:40,438 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:43:40,452 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:43:40,452 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:43:40,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 00:43:40,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:40,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369682770] [2025-04-14 00:43:40,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369682770] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:43:40,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830505642] [2025-04-14 00:43:40,809 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:43:40,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:43:40,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:43:40,811 INFO L229 MonitoredProcess]: Starting monitored process 82 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:40,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-04-14 00:43:41,070 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:43:41,154 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:43:41,154 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:43:41,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:41,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 00:43:41,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:43:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-14 00:43:41,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:43:41,398 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:43:41,399 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 125 treesize of output 130 [2025-04-14 00:43:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830505642] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:43:41,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:43:41,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 31 [2025-04-14 00:43:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300957643] [2025-04-14 00:43:41,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:43:41,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:43:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:43:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:43:41,527 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:43:41,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1146 places, 1751 transitions, 64205 flow. Second operand has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:41,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:41,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:43:41,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:46,184 INFO L116 PetriNetUnfolderBase]: 3626/6608 cut-off events. [2025-04-14 00:43:46,184 INFO L117 PetriNetUnfolderBase]: For 916537/916537 co-relation queries the response was YES. [2025-04-14 00:43:46,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103141 conditions, 6608 events. 3626/6608 cut-off events. For 916537/916537 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 49219 event pairs, 834 based on Foata normal form. 21/6625 useless extension candidates. Maximal degree in co-relation 102836. Up to 3307 conditions per place. [2025-04-14 00:43:46,359 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1404 selfloop transitions, 376 changer transitions 12/1792 dead transitions. [2025-04-14 00:43:46,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1168 places, 1792 transitions, 68359 flow [2025-04-14 00:43:46,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:43:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:43:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 153 transitions. [2025-04-14 00:43:46,360 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2914285714285714 [2025-04-14 00:43:46,360 INFO L175 Difference]: Start difference. First operand has 1146 places, 1751 transitions, 64205 flow. Second operand 25 states and 153 transitions. [2025-04-14 00:43:46,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1168 places, 1792 transitions, 68359 flow [2025-04-14 00:43:51,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1156 places, 1792 transitions, 67818 flow, removed 193 selfloop flow, removed 12 redundant places. [2025-04-14 00:43:51,751 INFO L231 Difference]: Finished difference. Result has 1158 places, 1746 transitions, 64355 flow [2025-04-14 00:43:51,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=63519, PETRI_DIFFERENCE_MINUEND_PLACES=1132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=64355, PETRI_PLACES=1158, PETRI_TRANSITIONS=1746} [2025-04-14 00:43:51,752 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1137 predicate places. [2025-04-14 00:43:51,752 INFO L485 AbstractCegarLoop]: Abstraction has has 1158 places, 1746 transitions, 64355 flow [2025-04-14 00:43:51,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:51,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:51,753 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:51,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2025-04-14 00:43:51,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2025-04-14 00:43:51,953 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:43:51,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash 745699627, now seen corresponding path program 72 times [2025-04-14 00:43:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:51,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206521669] [2025-04-14 00:43:51,955 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:43:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:51,966 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:43:51,984 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:43:51,984 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:43:51,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:52,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206521669] [2025-04-14 00:43:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206521669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:43:52,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874690038] [2025-04-14 00:43:52,301 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:43:52,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:43:52,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:43:52,303 INFO L229 MonitoredProcess]: Starting monitored process 83 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:52,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-04-14 00:43:52,567 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:43:52,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:43:52,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:43:52,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:52,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:43:52,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:43:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:43:52,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:43:52,816 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:43:52,817 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 48 treesize of output 81 [2025-04-14 00:43:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:43:52,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874690038] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:43:52,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:43:52,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 25 [2025-04-14 00:43:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033558291] [2025-04-14 00:43:52,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:43:52,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:43:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:52,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:43:52,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:43:52,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:43:52,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1158 places, 1746 transitions, 64355 flow. Second operand has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:52,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:52,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:43:52,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:57,110 INFO L116 PetriNetUnfolderBase]: 3681/6705 cut-off events. [2025-04-14 00:43:57,111 INFO L117 PetriNetUnfolderBase]: For 964846/964846 co-relation queries the response was YES. [2025-04-14 00:43:57,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105339 conditions, 6705 events. 3681/6705 cut-off events. For 964846/964846 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 49997 event pairs, 1226 based on Foata normal form. 22/6727 useless extension candidates. Maximal degree in co-relation 105034. Up to 6211 conditions per place. [2025-04-14 00:43:57,288 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1693 selfloop transitions, 139 changer transitions 0/1832 dead transitions. [2025-04-14 00:43:57,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1172 places, 1832 transitions, 70807 flow [2025-04-14 00:43:57,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 00:43:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 00:43:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 149 transitions. [2025-04-14 00:43:57,289 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3084886128364389 [2025-04-14 00:43:57,289 INFO L175 Difference]: Start difference. First operand has 1158 places, 1746 transitions, 64355 flow. Second operand 23 states and 149 transitions. [2025-04-14 00:43:57,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1172 places, 1832 transitions, 70807 flow [2025-04-14 00:44:03,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1156 places, 1832 transitions, 70619 flow, removed 37 selfloop flow, removed 16 redundant places. [2025-04-14 00:44:03,199 INFO L231 Difference]: Finished difference. Result has 1159 places, 1762 transitions, 65003 flow [2025-04-14 00:44:03,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=63888, PETRI_DIFFERENCE_MINUEND_PLACES=1134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=65003, PETRI_PLACES=1159, PETRI_TRANSITIONS=1762} [2025-04-14 00:44:03,201 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1138 predicate places. [2025-04-14 00:44:03,201 INFO L485 AbstractCegarLoop]: Abstraction has has 1159 places, 1762 transitions, 65003 flow [2025-04-14 00:44:03,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:03,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:03,202 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:03,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-04-14 00:44:03,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2025-04-14 00:44:03,402 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:44:03,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2095229769, now seen corresponding path program 73 times [2025-04-14 00:44:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:03,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347286421] [2025-04-14 00:44:03,403 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:44:03,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:03,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:44:03,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:44:03,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:03,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:44:03,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:03,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347286421] [2025-04-14 00:44:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347286421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:44:03,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829585847] [2025-04-14 00:44:03,854 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:44:03,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:03,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:44:03,856 INFO L229 MonitoredProcess]: Starting monitored process 84 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:03,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-04-14 00:44:04,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:44:04,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:44:04,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:04,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:04,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:44:04,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:44:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:04,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:44:04,400 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:44:04,401 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 50 treesize of output 87 [2025-04-14 00:44:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829585847] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:44:04,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:44:04,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-14 00:44:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48101908] [2025-04-14 00:44:04,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:44:04,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:44:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:04,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:44:04,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:44:04,477 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:44:04,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1159 places, 1762 transitions, 65003 flow. Second operand has 30 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:04,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:04,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:44:04,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:09,031 INFO L116 PetriNetUnfolderBase]: 3648/6655 cut-off events. [2025-04-14 00:44:09,031 INFO L117 PetriNetUnfolderBase]: For 966236/966236 co-relation queries the response was YES. [2025-04-14 00:44:09,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105350 conditions, 6655 events. 3648/6655 cut-off events. For 966236/966236 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 49610 event pairs, 1277 based on Foata normal form. 30/6685 useless extension candidates. Maximal degree in co-relation 105043. Up to 6347 conditions per place. [2025-04-14 00:44:09,216 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1676 selfloop transitions, 104 changer transitions 0/1780 dead transitions. [2025-04-14 00:44:09,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1176 places, 1780 transitions, 68666 flow [2025-04-14 00:44:09,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:44:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:44:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2025-04-14 00:44:09,217 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27056277056277056 [2025-04-14 00:44:09,217 INFO L175 Difference]: Start difference. First operand has 1159 places, 1762 transitions, 65003 flow. Second operand 22 states and 125 transitions. [2025-04-14 00:44:09,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1176 places, 1780 transitions, 68666 flow [2025-04-14 00:44:15,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1158 places, 1780 transitions, 68266 flow, removed 131 selfloop flow, removed 18 redundant places. [2025-04-14 00:44:15,755 INFO L231 Difference]: Finished difference. Result has 1161 places, 1755 transitions, 64529 flow [2025-04-14 00:44:15,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=63912, PETRI_DIFFERENCE_MINUEND_PLACES=1137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=64529, PETRI_PLACES=1161, PETRI_TRANSITIONS=1755} [2025-04-14 00:44:15,757 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1140 predicate places. [2025-04-14 00:44:15,757 INFO L485 AbstractCegarLoop]: Abstraction has has 1161 places, 1755 transitions, 64529 flow [2025-04-14 00:44:15,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:15,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:15,757 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:15,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2025-04-14 00:44:15,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:15,958 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:44:15,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:15,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1121220704, now seen corresponding path program 74 times [2025-04-14 00:44:15,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:15,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052015861] [2025-04-14 00:44:15,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:44:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:15,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:44:15,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:44:15,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:44:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:16,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:16,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052015861] [2025-04-14 00:44:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052015861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:44:16,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553455404] [2025-04-14 00:44:16,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:44:16,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:16,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:44:16,293 INFO L229 MonitoredProcess]: Starting monitored process 85 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:16,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-04-14 00:44:16,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:44:16,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:44:16,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:44:16,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:16,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 00:44:16,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:44:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:44:16,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:44:16,815 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:44:16,816 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 50 treesize of output 87 [2025-04-14 00:44:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553455404] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:44:16,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:44:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 23 [2025-04-14 00:44:16,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220976448] [2025-04-14 00:44:16,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:44:16,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:44:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:16,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:44:16,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:44:16,915 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:44:16,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1161 places, 1755 transitions, 64529 flow. Second operand has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:16,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:16,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:44:16,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:21,217 INFO L116 PetriNetUnfolderBase]: 3649/6663 cut-off events. [2025-04-14 00:44:21,217 INFO L117 PetriNetUnfolderBase]: For 956703/956703 co-relation queries the response was YES. [2025-04-14 00:44:21,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105229 conditions, 6663 events. 3649/6663 cut-off events. For 956703/956703 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 49758 event pairs, 1249 based on Foata normal form. 15/6678 useless extension candidates. Maximal degree in co-relation 104920. Up to 6225 conditions per place. [2025-04-14 00:44:21,380 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1673 selfloop transitions, 117 changer transitions 0/1790 dead transitions. [2025-04-14 00:44:21,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1178 places, 1790 transitions, 68713 flow [2025-04-14 00:44:21,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:44:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:44:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 119 transitions. [2025-04-14 00:44:21,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2982456140350877 [2025-04-14 00:44:21,381 INFO L175 Difference]: Start difference. First operand has 1161 places, 1755 transitions, 64529 flow. Second operand 19 states and 119 transitions. [2025-04-14 00:44:21,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1178 places, 1790 transitions, 68713 flow [2025-04-14 00:44:27,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1163 places, 1790 transitions, 68480 flow, removed 68 selfloop flow, removed 15 redundant places. [2025-04-14 00:44:27,066 INFO L231 Difference]: Finished difference. Result has 1165 places, 1754 transitions, 64502 flow [2025-04-14 00:44:27,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=64067, PETRI_DIFFERENCE_MINUEND_PLACES=1145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=64502, PETRI_PLACES=1165, PETRI_TRANSITIONS=1754} [2025-04-14 00:44:27,067 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1144 predicate places. [2025-04-14 00:44:27,067 INFO L485 AbstractCegarLoop]: Abstraction has has 1165 places, 1754 transitions, 64502 flow [2025-04-14 00:44:27,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:27,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:27,068 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:27,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2025-04-14 00:44:27,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:27,268 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:44:27,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:27,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1020308180, now seen corresponding path program 75 times [2025-04-14 00:44:27,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:27,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54105687] [2025-04-14 00:44:27,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:44:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:27,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:44:27,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-14 00:44:27,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:44:27,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:27,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:27,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54105687] [2025-04-14 00:44:27,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54105687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:44:27,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997965864] [2025-04-14 00:44:27,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:44:27,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:27,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:44:27,602 INFO L229 MonitoredProcess]: Starting monitored process 86 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:27,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-04-14 00:44:27,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:44:27,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-14 00:44:27,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:44:27,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:27,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 00:44:27,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:44:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:28,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:44:28,060 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:44:28,061 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 123 treesize of output 124 [2025-04-14 00:44:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997965864] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:44:28,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:44:28,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-14 00:44:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535908965] [2025-04-14 00:44:28,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:44:28,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:44:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:28,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:44:28,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:44:28,163 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:44:28,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1165 places, 1754 transitions, 64502 flow. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:28,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:28,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:44:28,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:32,247 INFO L116 PetriNetUnfolderBase]: 3633/6619 cut-off events. [2025-04-14 00:44:32,248 INFO L117 PetriNetUnfolderBase]: For 959947/959947 co-relation queries the response was YES. [2025-04-14 00:44:32,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104955 conditions, 6619 events. 3633/6619 cut-off events. For 959947/959947 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 49288 event pairs, 1259 based on Foata normal form. 8/6627 useless extension candidates. Maximal degree in co-relation 104644. Up to 6298 conditions per place. [2025-04-14 00:44:32,440 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 1682 selfloop transitions, 101 changer transitions 2/1785 dead transitions. [2025-04-14 00:44:32,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1183 places, 1785 transitions, 68831 flow [2025-04-14 00:44:32,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:44:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:44:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 119 transitions. [2025-04-14 00:44:32,442 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2982456140350877 [2025-04-14 00:44:32,442 INFO L175 Difference]: Start difference. First operand has 1165 places, 1754 transitions, 64502 flow. Second operand 19 states and 119 transitions. [2025-04-14 00:44:32,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1183 places, 1785 transitions, 68831 flow [2025-04-14 00:44:38,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1169 places, 1785 transitions, 68581 flow, removed 41 selfloop flow, removed 14 redundant places. [2025-04-14 00:44:38,321 INFO L231 Difference]: Finished difference. Result has 1171 places, 1751 transitions, 64735 flow [2025-04-14 00:44:38,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=64048, PETRI_DIFFERENCE_MINUEND_PLACES=1151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=64735, PETRI_PLACES=1171, PETRI_TRANSITIONS=1751} [2025-04-14 00:44:38,322 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1150 predicate places. [2025-04-14 00:44:38,322 INFO L485 AbstractCegarLoop]: Abstraction has has 1171 places, 1751 transitions, 64735 flow [2025-04-14 00:44:38,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:38,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:38,322 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:38,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2025-04-14 00:44:38,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:38,523 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:44:38,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1398681824, now seen corresponding path program 76 times [2025-04-14 00:44:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:38,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700166046] [2025-04-14 00:44:38,524 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:44:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:38,540 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:44:38,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-14 00:44:38,545 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:44:38,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:38,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:38,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700166046] [2025-04-14 00:44:38,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700166046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:44:38,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399708812] [2025-04-14 00:44:38,703 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:44:38,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:38,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:44:38,705 INFO L229 MonitoredProcess]: Starting monitored process 87 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:38,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-04-14 00:44:38,989 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:44:38,998 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-14 00:44:38,999 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:44:38,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:38,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:44:39,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:44:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:39,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:44:39,204 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:44:39,204 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 48 treesize of output 81 [2025-04-14 00:44:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399708812] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:44:39,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:44:39,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-14 00:44:39,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469975639] [2025-04-14 00:44:39,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:44:39,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:44:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:39,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:44:39,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:44:39,310 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:44:39,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1171 places, 1751 transitions, 64735 flow. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:39,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:39,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:44:39,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:43,844 INFO L116 PetriNetUnfolderBase]: 3618/6616 cut-off events. [2025-04-14 00:44:43,844 INFO L117 PetriNetUnfolderBase]: For 960314/960314 co-relation queries the response was YES. [2025-04-14 00:44:43,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104568 conditions, 6616 events. 3618/6616 cut-off events. For 960314/960314 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 49437 event pairs, 1246 based on Foata normal form. 20/6632 useless extension candidates. Maximal degree in co-relation 104255. Up to 6240 conditions per place. [2025-04-14 00:44:44,025 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 1667 selfloop transitions, 112 changer transitions 0/1779 dead transitions. [2025-04-14 00:44:44,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1183 places, 1779 transitions, 68358 flow [2025-04-14 00:44:44,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:44:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:44:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2025-04-14 00:44:44,026 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2025-04-14 00:44:44,026 INFO L175 Difference]: Start difference. First operand has 1171 places, 1751 transitions, 64735 flow. Second operand 16 states and 118 transitions. [2025-04-14 00:44:44,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1183 places, 1779 transitions, 68358 flow [2025-04-14 00:44:49,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1167 places, 1779 transitions, 68035 flow, removed 63 selfloop flow, removed 16 redundant places. [2025-04-14 00:44:49,651 INFO L231 Difference]: Finished difference. Result has 1169 places, 1746 transitions, 64349 flow [2025-04-14 00:44:49,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=63927, PETRI_DIFFERENCE_MINUEND_PLACES=1152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=64349, PETRI_PLACES=1169, PETRI_TRANSITIONS=1746} [2025-04-14 00:44:49,653 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1148 predicate places. [2025-04-14 00:44:49,653 INFO L485 AbstractCegarLoop]: Abstraction has has 1169 places, 1746 transitions, 64349 flow [2025-04-14 00:44:49,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:49,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:49,653 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:49,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2025-04-14 00:44:49,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:49,854 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:44:49,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1757187888, now seen corresponding path program 77 times [2025-04-14 00:44:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:49,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979780971] [2025-04-14 00:44:49,855 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:44:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:49,866 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:44:49,886 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:44:49,886 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:44:49,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 00:44:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:50,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979780971] [2025-04-14 00:44:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979780971] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:44:50,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068675455] [2025-04-14 00:44:50,245 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:44:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:50,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:44:50,247 INFO L229 MonitoredProcess]: Starting monitored process 88 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:50,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-04-14 00:44:50,527 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:44:50,593 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:44:50,593 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:44:50,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:50,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 00:44:50,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:44:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-14 00:44:50,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:44:50,853 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:44:50,853 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 50 treesize of output 87 [2025-04-14 00:44:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:44:50,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068675455] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:44:50,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:44:50,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 27 [2025-04-14 00:44:50,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735202582] [2025-04-14 00:44:50,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:44:50,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 00:44:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:50,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 00:44:50,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2025-04-14 00:44:50,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:44:50,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1169 places, 1746 transitions, 64349 flow. Second operand has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:50,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:50,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:44:50,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:55,254 INFO L116 PetriNetUnfolderBase]: 3595/6560 cut-off events. [2025-04-14 00:44:55,255 INFO L117 PetriNetUnfolderBase]: For 948966/948966 co-relation queries the response was YES. [2025-04-14 00:44:55,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103514 conditions, 6560 events. 3595/6560 cut-off events. For 948966/948966 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 48799 event pairs, 1062 based on Foata normal form. 26/6582 useless extension candidates. Maximal degree in co-relation 103200. Up to 5581 conditions per place. [2025-04-14 00:44:55,442 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1516 selfloop transitions, 261 changer transitions 0/1777 dead transitions. [2025-04-14 00:44:55,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1189 places, 1777 transitions, 67872 flow [2025-04-14 00:44:55,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 00:44:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 00:44:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 148 transitions. [2025-04-14 00:44:55,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3064182194616977 [2025-04-14 00:44:55,443 INFO L175 Difference]: Start difference. First operand has 1169 places, 1746 transitions, 64349 flow. Second operand 23 states and 148 transitions. [2025-04-14 00:44:55,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1189 places, 1777 transitions, 67872 flow [2025-04-14 00:45:00,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1172 places, 1777 transitions, 66829 flow, removed 64 selfloop flow, removed 17 redundant places. [2025-04-14 00:45:00,985 INFO L231 Difference]: Finished difference. Result has 1175 places, 1734 transitions, 63258 flow [2025-04-14 00:45:00,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=62475, PETRI_DIFFERENCE_MINUEND_PLACES=1150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=63258, PETRI_PLACES=1175, PETRI_TRANSITIONS=1734} [2025-04-14 00:45:00,986 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1154 predicate places. [2025-04-14 00:45:00,986 INFO L485 AbstractCegarLoop]: Abstraction has has 1175 places, 1734 transitions, 63258 flow [2025-04-14 00:45:00,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:00,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:00,986 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:00,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2025-04-14 00:45:01,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:45:01,187 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:45:01,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash 629791795, now seen corresponding path program 78 times [2025-04-14 00:45:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:01,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231287974] [2025-04-14 00:45:01,188 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:01,200 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:45:01,216 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:45:01,216 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:45:01,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:45:01,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:01,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231287974] [2025-04-14 00:45:01,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231287974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:45:01,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134926701] [2025-04-14 00:45:01,511 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:01,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:45:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:45:01,513 INFO L229 MonitoredProcess]: Starting monitored process 89 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:01,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2025-04-14 00:45:01,798 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:45:01,827 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:45:01,827 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:45:01,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:01,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:45:01,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:45:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:45:01,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:45:02,002 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:45:02,002 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 48 treesize of output 81 [2025-04-14 00:45:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:45:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134926701] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:45:02,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:45:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 22 [2025-04-14 00:45:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106208888] [2025-04-14 00:45:02,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:45:02,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:45:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:02,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:45:02,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:45:02,083 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:45:02,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1175 places, 1734 transitions, 63258 flow. Second operand has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:02,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:02,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:45:02,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:06,607 INFO L116 PetriNetUnfolderBase]: 3608/6599 cut-off events. [2025-04-14 00:45:06,607 INFO L117 PetriNetUnfolderBase]: For 949793/949793 co-relation queries the response was YES. [2025-04-14 00:45:06,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103879 conditions, 6599 events. 3608/6599 cut-off events. For 949793/949793 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 49246 event pairs, 1005 based on Foata normal form. 24/6623 useless extension candidates. Maximal degree in co-relation 103565. Up to 5375 conditions per place. [2025-04-14 00:45:06,772 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 1479 selfloop transitions, 315 changer transitions 0/1794 dead transitions. [2025-04-14 00:45:06,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1194 places, 1794 transitions, 68478 flow [2025-04-14 00:45:06,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:45:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:45:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 157 transitions. [2025-04-14 00:45:06,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3115079365079365 [2025-04-14 00:45:06,773 INFO L175 Difference]: Start difference. First operand has 1175 places, 1734 transitions, 63258 flow. Second operand 24 states and 157 transitions. [2025-04-14 00:45:06,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1194 places, 1794 transitions, 68478 flow [2025-04-14 00:45:12,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1174 places, 1794 transitions, 67600 flow, removed 80 selfloop flow, removed 20 redundant places. [2025-04-14 00:45:12,084 INFO L231 Difference]: Finished difference. Result has 1180 places, 1738 transitions, 63507 flow [2025-04-14 00:45:12,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=61826, PETRI_DIFFERENCE_MINUEND_PLACES=1151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=63507, PETRI_PLACES=1180, PETRI_TRANSITIONS=1738} [2025-04-14 00:45:12,086 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1159 predicate places. [2025-04-14 00:45:12,086 INFO L485 AbstractCegarLoop]: Abstraction has has 1180 places, 1738 transitions, 63507 flow [2025-04-14 00:45:12,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:12,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:12,086 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:12,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2025-04-14 00:45:12,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2025-04-14 00:45:12,286 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:45:12,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:12,287 INFO L85 PathProgramCache]: Analyzing trace with hash 541396132, now seen corresponding path program 79 times [2025-04-14 00:45:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:12,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178522692] [2025-04-14 00:45:12,287 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:45:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:12,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:45:12,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:45:12,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:12,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 00:45:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:12,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178522692] [2025-04-14 00:45:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178522692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:45:12,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437662206] [2025-04-14 00:45:12,930 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:45:12,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:45:12,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:45:12,932 INFO L229 MonitoredProcess]: Starting monitored process 90 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:12,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2025-04-14 00:45:13,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:45:13,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:45:13,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:13,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:13,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:45:13,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:45:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:45:13,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:45:13,500 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:45:13,501 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 48 treesize of output 81 [2025-04-14 00:45:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:45:13,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437662206] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:45:13,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:45:13,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-14 00:45:13,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733649740] [2025-04-14 00:45:13,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:45:13,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:45:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:13,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:45:13,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:45:13,590 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:45:13,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1180 places, 1738 transitions, 63507 flow. Second operand has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:13,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:13,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:45:13,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:18,314 INFO L116 PetriNetUnfolderBase]: 3626/6637 cut-off events. [2025-04-14 00:45:18,314 INFO L117 PetriNetUnfolderBase]: For 999884/999884 co-relation queries the response was YES. [2025-04-14 00:45:18,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105040 conditions, 6637 events. 3626/6637 cut-off events. For 999884/999884 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 49765 event pairs, 1021 based on Foata normal form. 30/6663 useless extension candidates. Maximal degree in co-relation 104722. Up to 5443 conditions per place. [2025-04-14 00:45:18,505 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1483 selfloop transitions, 319 changer transitions 0/1802 dead transitions. [2025-04-14 00:45:18,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1203 places, 1802 transitions, 68969 flow [2025-04-14 00:45:18,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:45:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:45:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 159 transitions. [2025-04-14 00:45:18,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3028571428571429 [2025-04-14 00:45:18,506 INFO L175 Difference]: Start difference. First operand has 1180 places, 1738 transitions, 63507 flow. Second operand 25 states and 159 transitions. [2025-04-14 00:45:18,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1203 places, 1802 transitions, 68969 flow Received shutdown request... [2025-04-14 00:45:22,826 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:45:22,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2025-04-14 00:45:22,872 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:45:22,873 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:45:23,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2025-04-14 00:45:23,028 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-14 00:45:23,030 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:45:23,030 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:45:23,030 INFO L422 BasicCegarLoop]: Path program histogram: [79, 8, 5, 4, 1] [2025-04-14 00:45:23,041 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:45:23,041 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:45:23,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:45:23 BasicIcfg [2025-04-14 00:45:23,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:45:23,046 INFO L158 Benchmark]: Toolchain (without parser) took 820496.37ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 99.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-14 00:45:23,046 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:45:23,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.58ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 84.0MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:45:23,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.98ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:45:23,046 INFO L158 Benchmark]: Boogie Preprocessor took 22.93ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:45:23,046 INFO L158 Benchmark]: IcfgBuilder took 563.41ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 94.3MB in the end (delta: -14.4MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. [2025-04-14 00:45:23,046 INFO L158 Benchmark]: TraceAbstraction took 819624.18ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 93.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-14 00:45:23,047 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.18ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.58ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 84.0MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.98ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.93ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 563.41ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 94.3MB in the end (delta: -14.4MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. * TraceAbstraction took 819624.18ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 93.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 26 locations, 31 edges, 3 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: 819.5s, OverallIterations: 97, TraceHistogramMax: 5, PathProgramHistogramMax: 79, EmptinessCheckTime: 0.0s, AutomataDifference: 350.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 11678 SdHoareTripleChecker+Valid, 43.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11678 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 38.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1797 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77256 IncrementalHoareTripleChecker+Invalid, 79056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1797 mSolverCounterUnsat, 0 mSDtfsCounter, 77256 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8924 GetRequests, 4945 SyntacticMatches, 5 SemanticMatches, 3974 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54490 ImplicationChecksByTransitivity, 63.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65148occurred in iteration=83, InterpolantAutomatonStates: 2556, 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: 1.2s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 431.4s InterpolantComputationTime, 5026 NumberOfCodeBlocks, 4375 NumberOfCodeBlocksAsserted, 400 NumberOfCheckSat, 7128 ConstructedInterpolants, 3 QuantifiedInterpolants, 75448 SizeOfPredicates, 2041 NumberOfNonLiveVariables, 19912 ConjunctsInSsa, 2158 ConjunctsInUnsatCore, 273 InterpolantComputations, 10 PerfectInterpolantSequences, 7337/9499 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