/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:27:00,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:27:00,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:27:00,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:27:00,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:27:00,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:27:00,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:27:00,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:27:00,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:27:00,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:27:00,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:27:00,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:27:00,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:27:00,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:27:00,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:27:00,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:27:00,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:27:00,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:27:00,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:27:00,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:27:00,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:27:00,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:27:00,941 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:27:01,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:27:01,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:27:01,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:27:01,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:27:01,156 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:27:01,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2025-04-13 20:27:02,377 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35dacf46/8c5d7591f4f5468db4d7cb05ff829740/FLAG52bd40634 [2025-04-13 20:27:02,575 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:27:02,575 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2025-04-13 20:27:02,583 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35dacf46/8c5d7591f4f5468db4d7cb05ff829740/FLAG52bd40634 [2025-04-13 20:27:03,377 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35dacf46/8c5d7591f4f5468db4d7cb05ff829740 [2025-04-13 20:27:03,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:27:03,380 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:27:03,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:27:03,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:27:03,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:27:03,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b0135d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03, skipping insertion in model container [2025-04-13 20:27:03,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:27:03,556 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/popl20-figure1-alt.wvr.c[1921,1934] [2025-04-13 20:27:03,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:27:03,567 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:27:03,596 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/popl20-figure1-alt.wvr.c[1921,1934] [2025-04-13 20:27:03,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:27:03,609 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:27:03,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03 WrapperNode [2025-04-13 20:27:03,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:27:03,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:27:03,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:27:03,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:27:03,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,639 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 63 [2025-04-13 20:27:03,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:27:03,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:27:03,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:27:03,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:27:03,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:27:03,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:27:03,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:27:03,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:27:03,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:27:03,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (1/1) ... [2025-04-13 20:27:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:27:03,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:03,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:27:03,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:27:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:27:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:27:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:27:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:27:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:27:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:27:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:27:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:27:03,714 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:27:03,770 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:27:03,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:27:03,879 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:27:03,879 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:27:03,879 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:27:03,986 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:27:03,988 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:27:03,996 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:27:03,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:27:03 BoogieIcfgContainer [2025-04-13 20:27:03,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:27:03,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:27:03,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:27:04,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:27:04,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:27:03" (1/3) ... [2025-04-13 20:27:04,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb57ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:27:04, skipping insertion in model container [2025-04-13 20:27:04,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:27:03" (2/3) ... [2025-04-13 20:27:04,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb57ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:27:04, skipping insertion in model container [2025-04-13 20:27:04,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:27:03" (3/3) ... [2025-04-13 20:27:04,005 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2025-04-13 20:27:04,014 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:27:04,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-figure1-alt.wvr.c that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 20:27:04,016 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:27:04,051 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:27:04,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 56 flow [2025-04-13 20:27:04,096 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-13 20:27:04,099 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:27:04,104 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 4. Compared 22 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-13 20:27:04,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 56 flow [2025-04-13 20:27:04,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 48 flow [2025-04-13 20:27:04,114 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:27:04,125 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;@58309e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:27:04,126 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:27:04,137 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:27:04,137 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-13 20:27:04,137 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:27:04,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:04,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:04,138 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-13 20:27:04,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1149152707, now seen corresponding path program 1 times [2025-04-13 20:27:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:04,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967963126] [2025-04-13 20:27:04,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:04,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 20:27:04,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 20:27:04,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:04,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:04,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967963126] [2025-04-13 20:27:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967963126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:04,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:04,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:27:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473982338] [2025-04-13 20:27:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:04,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:27:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:04,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:27:04,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:27:04,480 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:04,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-13 20:27:04,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:04,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:04,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:04,603 INFO L116 PetriNetUnfolderBase]: 72/135 cut-off events. [2025-04-13 20:27:04,603 INFO L117 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-04-13 20:27:04,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 135 events. 72/135 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 399 event pairs, 17 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 242. Up to 96 conditions per place. [2025-04-13 20:27:04,605 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 24 selfloop transitions, 3 changer transitions 6/33 dead transitions. [2025-04-13 20:27:04,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 162 flow [2025-04-13 20:27:04,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:27:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:27:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-04-13 20:27:04,613 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2025-04-13 20:27:04,614 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 48 flow. Second operand 5 states and 46 transitions. [2025-04-13 20:27:04,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 162 flow [2025-04-13 20:27:04,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:27:04,619 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 62 flow [2025-04-13 20:27:04,620 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=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2025-04-13 20:27:04,622 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2025-04-13 20:27:04,622 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 62 flow [2025-04-13 20:27:04,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-13 20:27:04,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:04,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:04,623 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:27:04,623 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-13 20:27:04,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash -480902137, now seen corresponding path program 2 times [2025-04-13 20:27:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:04,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451210101] [2025-04-13 20:27:04,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:04,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 20:27:04,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 20:27:04,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:27:04,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:04,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451210101] [2025-04-13 20:27:04,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451210101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:04,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:04,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:27:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050011233] [2025-04-13 20:27:04,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:04,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:27:04,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:04,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:27:04,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:27:04,801 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:04,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-13 20:27:04,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:04,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:04,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:04,882 INFO L116 PetriNetUnfolderBase]: 70/128 cut-off events. [2025-04-13 20:27:04,883 INFO L117 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-04-13 20:27:04,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 128 events. 70/128 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 345 event pairs, 21 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 321. Up to 96 conditions per place. [2025-04-13 20:27:04,884 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 21 selfloop transitions, 4 changer transitions 6/31 dead transitions. [2025-04-13 20:27:04,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 161 flow [2025-04-13 20:27:04,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:27:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:27:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-04-13 20:27:04,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-13 20:27:04,887 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 62 flow. Second operand 5 states and 42 transitions. [2025-04-13 20:27:04,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 161 flow [2025-04-13 20:27:04,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 31 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 20:27:04,889 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 75 flow [2025-04-13 20:27:04,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2025-04-13 20:27:04,889 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2025-04-13 20:27:04,889 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 75 flow [2025-04-13 20:27:04,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-13 20:27:04,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:04,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:04,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:27:04,890 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-13 20:27:04,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 513327632, now seen corresponding path program 1 times [2025-04-13 20:27:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:04,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810074015] [2025-04-13 20:27:04,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:04,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:27:04,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:27:04,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:04,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:05,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810074015] [2025-04-13 20:27:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810074015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:27:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020773536] [2025-04-13 20:27:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:05,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:27:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:05,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:27:05,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:27:05,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:05,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 75 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:05,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:05,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:05,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:05,192 INFO L116 PetriNetUnfolderBase]: 90/164 cut-off events. [2025-04-13 20:27:05,192 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-13 20:27:05,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 164 events. 90/164 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 1 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 420. Up to 103 conditions per place. [2025-04-13 20:27:05,194 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 35 selfloop transitions, 8 changer transitions 4/47 dead transitions. [2025-04-13 20:27:05,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 254 flow [2025-04-13 20:27:05,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:27:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:27:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2025-04-13 20:27:05,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2025-04-13 20:27:05,195 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 75 flow. Second operand 7 states and 61 transitions. [2025-04-13 20:27:05,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 254 flow [2025-04-13 20:27:05,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 47 transitions, 228 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-13 20:27:05,196 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 102 flow [2025-04-13 20:27:05,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=102, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-04-13 20:27:05,197 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2025-04-13 20:27:05,197 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 102 flow [2025-04-13 20:27:05,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:05,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:05,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:05,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:27:05,197 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-13 20:27:05,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1760505294, now seen corresponding path program 2 times [2025-04-13 20:27:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:05,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106319015] [2025-04-13 20:27:05,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:05,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:27:05,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:27:05,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:27:05,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:05,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106319015] [2025-04-13 20:27:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106319015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:05,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:05,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:27:05,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001609834] [2025-04-13 20:27:05,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:05,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:27:05,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:05,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:27:05,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:27:05,360 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:05,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:05,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:05,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:05,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:05,472 INFO L116 PetriNetUnfolderBase]: 90/166 cut-off events. [2025-04-13 20:27:05,472 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-13 20:27:05,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 166 events. 90/166 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 7 based on Foata normal form. 1/150 useless extension candidates. Maximal degree in co-relation 485. Up to 126 conditions per place. [2025-04-13 20:27:05,473 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 29 selfloop transitions, 9 changer transitions 4/42 dead transitions. [2025-04-13 20:27:05,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 243 flow [2025-04-13 20:27:05,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:27:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:27:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2025-04-13 20:27:05,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2025-04-13 20:27:05,476 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 102 flow. Second operand 7 states and 55 transitions. [2025-04-13 20:27:05,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 243 flow [2025-04-13 20:27:05,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 239 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 20:27:05,477 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 137 flow [2025-04-13 20:27:05,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2025-04-13 20:27:05,478 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2025-04-13 20:27:05,478 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 137 flow [2025-04-13 20:27:05,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:05,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:05,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:05,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:27:05,478 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:27:05,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:05,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1677983050, now seen corresponding path program 3 times [2025-04-13 20:27:05,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:05,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579120936] [2025-04-13 20:27:05,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:05,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:05,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:27:05,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:27:05,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:27:05,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:05,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579120936] [2025-04-13 20:27:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579120936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:05,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:05,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:27:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214487125] [2025-04-13 20:27:05,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:05,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:27:05,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:05,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:27:05,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:27:05,604 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:05,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 137 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:05,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:05,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:05,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:05,706 INFO L116 PetriNetUnfolderBase]: 92/172 cut-off events. [2025-04-13 20:27:05,706 INFO L117 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-04-13 20:27:05,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 172 events. 92/172 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 15 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 576. Up to 144 conditions per place. [2025-04-13 20:27:05,707 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 28 selfloop transitions, 7 changer transitions 4/39 dead transitions. [2025-04-13 20:27:05,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 268 flow [2025-04-13 20:27:05,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:27:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:27:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2025-04-13 20:27:05,710 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32653061224489793 [2025-04-13 20:27:05,710 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 137 flow. Second operand 7 states and 48 transitions. [2025-04-13 20:27:05,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 268 flow [2025-04-13 20:27:05,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 238 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-13 20:27:05,712 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 159 flow [2025-04-13 20:27:05,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2025-04-13 20:27:05,712 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-04-13 20:27:05,712 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 159 flow [2025-04-13 20:27:05,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:05,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:05,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:05,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:27:05,713 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-13 20:27:05,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash 597338252, now seen corresponding path program 4 times [2025-04-13 20:27:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:05,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103926307] [2025-04-13 20:27:05,713 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:05,718 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-04-13 20:27:05,721 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:27:05,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:05,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:05,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:05,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103926307] [2025-04-13 20:27:05,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103926307] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:05,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:05,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:27:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844862796] [2025-04-13 20:27:05,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:05,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:27:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:05,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:27:05,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:27:05,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:05,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 159 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:05,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:05,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:05,931 INFO L116 PetriNetUnfolderBase]: 91/166 cut-off events. [2025-04-13 20:27:05,931 INFO L117 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-04-13 20:27:05,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 166 events. 91/166 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 488 event pairs, 13 based on Foata normal form. 1/150 useless extension candidates. Maximal degree in co-relation 560. Up to 138 conditions per place. [2025-04-13 20:27:05,932 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 31 selfloop transitions, 8 changer transitions 4/43 dead transitions. [2025-04-13 20:27:05,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 296 flow [2025-04-13 20:27:05,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:27:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:27:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2025-04-13 20:27:05,936 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:27:05,936 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 159 flow. Second operand 7 states and 49 transitions. [2025-04-13 20:27:05,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 296 flow [2025-04-13 20:27:05,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 282 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-13 20:27:05,938 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 192 flow [2025-04-13 20:27:05,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-04-13 20:27:05,941 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2025-04-13 20:27:05,941 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 192 flow [2025-04-13 20:27:05,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:05,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:05,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:05,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:27:05,941 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-13 20:27:05,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash -458930128, now seen corresponding path program 1 times [2025-04-13 20:27:05,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:05,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672250240] [2025-04-13 20:27:05,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:05,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:05,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:27:05,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:05,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:05,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:06,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672250240] [2025-04-13 20:27:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672250240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:06,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:06,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:27:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067137784] [2025-04-13 20:27:06,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:06,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:27:06,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:06,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:27:06,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:27:06,086 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:06,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 192 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:06,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:06,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:06,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:06,294 INFO L116 PetriNetUnfolderBase]: 114/212 cut-off events. [2025-04-13 20:27:06,295 INFO L117 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-04-13 20:27:06,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 212 events. 114/212 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 694 event pairs, 14 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 695. Up to 108 conditions per place. [2025-04-13 20:27:06,296 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 40 selfloop transitions, 13 changer transitions 12/65 dead transitions. [2025-04-13 20:27:06,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 417 flow [2025-04-13 20:27:06,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:27:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:27:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2025-04-13 20:27:06,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-04-13 20:27:06,297 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 192 flow. Second operand 9 states and 75 transitions. [2025-04-13 20:27:06,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 417 flow [2025-04-13 20:27:06,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 399 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 20:27:06,300 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 236 flow [2025-04-13 20:27:06,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2025-04-13 20:27:06,301 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2025-04-13 20:27:06,301 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 236 flow [2025-04-13 20:27:06,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:06,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:06,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:06,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:27:06,301 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-13 20:27:06,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1258818932, now seen corresponding path program 2 times [2025-04-13 20:27:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:06,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756526140] [2025-04-13 20:27:06,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:06,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:27:06,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:06,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:27:06,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:06,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756526140] [2025-04-13 20:27:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756526140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:27:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676066425] [2025-04-13 20:27:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:06,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:27:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:06,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:27:06,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:27:06,439 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:06,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 236 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:06,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:06,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:06,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:06,567 INFO L116 PetriNetUnfolderBase]: 112/207 cut-off events. [2025-04-13 20:27:06,567 INFO L117 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES. [2025-04-13 20:27:06,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 207 events. 112/207 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 657 event pairs, 16 based on Foata normal form. 1/183 useless extension candidates. Maximal degree in co-relation 796. Up to 142 conditions per place. [2025-04-13 20:27:06,569 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 35 selfloop transitions, 18 changer transitions 5/58 dead transitions. [2025-04-13 20:27:06,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 447 flow [2025-04-13 20:27:06,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:27:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:27:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2025-04-13 20:27:06,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2025-04-13 20:27:06,571 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 236 flow. Second operand 9 states and 69 transitions. [2025-04-13 20:27:06,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 447 flow [2025-04-13 20:27:06,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 412 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-13 20:27:06,574 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 287 flow [2025-04-13 20:27:06,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=287, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2025-04-13 20:27:06,574 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2025-04-13 20:27:06,574 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 287 flow [2025-04-13 20:27:06,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:06,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:06,576 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:06,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:27:06,576 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-13 20:27:06,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1470239439, now seen corresponding path program 1 times [2025-04-13 20:27:06,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:06,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850503316] [2025-04-13 20:27:06,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:27:06,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:06,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:06,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:06,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:06,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850503316] [2025-04-13 20:27:06,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850503316] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:06,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670415277] [2025-04-13 20:27:06,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:06,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:06,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:06,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:27:06,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:27:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:06,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:06,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:06,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:27:06,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:06,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:07,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670415277] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:07,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:07,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-04-13 20:27:07,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934634602] [2025-04-13 20:27:07,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:07,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:27:07,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:07,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:27:07,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:27:07,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:07,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 287 flow. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:07,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:07,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:07,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:08,452 INFO L116 PetriNetUnfolderBase]: 504/896 cut-off events. [2025-04-13 20:27:08,452 INFO L117 PetriNetUnfolderBase]: For 727/727 co-relation queries the response was YES. [2025-04-13 20:27:08,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 896 events. 504/896 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3733 event pairs, 3 based on Foata normal form. 2/731 useless extension candidates. Maximal degree in co-relation 2744. Up to 211 conditions per place. [2025-04-13 20:27:08,458 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 162 selfloop transitions, 94 changer transitions 9/265 dead transitions. [2025-04-13 20:27:08,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 265 transitions, 1666 flow [2025-04-13 20:27:08,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 20:27:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-13 20:27:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 343 transitions. [2025-04-13 20:27:08,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2025-04-13 20:27:08,461 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 287 flow. Second operand 40 states and 343 transitions. [2025-04-13 20:27:08,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 265 transitions, 1666 flow [2025-04-13 20:27:08,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 265 transitions, 1556 flow, removed 38 selfloop flow, removed 8 redundant places. [2025-04-13 20:27:08,469 INFO L231 Difference]: Finished difference. Result has 91 places, 117 transitions, 823 flow [2025-04-13 20:27:08,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=823, PETRI_PLACES=91, PETRI_TRANSITIONS=117} [2025-04-13 20:27:08,469 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2025-04-13 20:27:08,469 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 117 transitions, 823 flow [2025-04-13 20:27:08,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:08,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:08,470 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:08,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:27:08,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:08,670 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-13 20:27:08,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1386228819, now seen corresponding path program 2 times [2025-04-13 20:27:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:08,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159153456] [2025-04-13 20:27:08,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:08,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:08,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:08,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:08,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:08,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:08,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159153456] [2025-04-13 20:27:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159153456] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:08,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882271998] [2025-04-13 20:27:08,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:08,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:08,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:08,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:08,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:27:08,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:08,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:08,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:08,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:08,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:27:08,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:09,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:09,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882271998] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:09,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:09,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-04-13 20:27:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854417310] [2025-04-13 20:27:09,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:09,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:27:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:09,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:27:09,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:27:09,140 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:09,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 117 transitions, 823 flow. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:09,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:09,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:09,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:09,835 INFO L116 PetriNetUnfolderBase]: 709/1275 cut-off events. [2025-04-13 20:27:09,836 INFO L117 PetriNetUnfolderBase]: For 2616/2616 co-relation queries the response was YES. [2025-04-13 20:27:09,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4996 conditions, 1275 events. 709/1275 cut-off events. For 2616/2616 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6181 event pairs, 29 based on Foata normal form. 2/1171 useless extension candidates. Maximal degree in co-relation 4867. Up to 757 conditions per place. [2025-04-13 20:27:09,844 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 142 selfloop transitions, 94 changer transitions 9/245 dead transitions. [2025-04-13 20:27:09,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 245 transitions, 1943 flow [2025-04-13 20:27:09,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 20:27:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 20:27:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 199 transitions. [2025-04-13 20:27:09,846 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31587301587301586 [2025-04-13 20:27:09,846 INFO L175 Difference]: Start difference. First operand has 91 places, 117 transitions, 823 flow. Second operand 30 states and 199 transitions. [2025-04-13 20:27:09,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 245 transitions, 1943 flow [2025-04-13 20:27:09,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 245 transitions, 1568 flow, removed 158 selfloop flow, removed 10 redundant places. [2025-04-13 20:27:09,861 INFO L231 Difference]: Finished difference. Result has 118 places, 169 transitions, 1164 flow [2025-04-13 20:27:09,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1164, PETRI_PLACES=118, PETRI_TRANSITIONS=169} [2025-04-13 20:27:09,861 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 97 predicate places. [2025-04-13 20:27:09,861 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 169 transitions, 1164 flow [2025-04-13 20:27:09,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:09,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:09,862 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:09,869 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-13 20:27:10,068 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,SelfDestructingSolverStorable9 [2025-04-13 20:27:10,068 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-13 20:27:10,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1469345709, now seen corresponding path program 3 times [2025-04-13 20:27:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:10,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524219532] [2025-04-13 20:27:10,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:10,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:10,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:10,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:27:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:10,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524219532] [2025-04-13 20:27:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524219532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:10,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384510618] [2025-04-13 20:27:10,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:10,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:10,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:27:10,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:10,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:10,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:27:10,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:10,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:27:10,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:10,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384510618] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:10,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:10,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-04-13 20:27:10,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788460965] [2025-04-13 20:27:10,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:10,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:27:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:10,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:27:10,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:27:10,493 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:10,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 169 transitions, 1164 flow. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:10,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:10,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:10,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:11,610 INFO L116 PetriNetUnfolderBase]: 990/1776 cut-off events. [2025-04-13 20:27:11,611 INFO L117 PetriNetUnfolderBase]: For 3537/3537 co-relation queries the response was YES. [2025-04-13 20:27:11,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6735 conditions, 1776 events. 990/1776 cut-off events. For 3537/3537 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9517 event pairs, 39 based on Foata normal form. 3/1645 useless extension candidates. Maximal degree in co-relation 6701. Up to 637 conditions per place. [2025-04-13 20:27:11,620 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 222 selfloop transitions, 145 changer transitions 9/376 dead transitions. [2025-04-13 20:27:11,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 376 transitions, 2920 flow [2025-04-13 20:27:11,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 20:27:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 20:27:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 340 transitions. [2025-04-13 20:27:11,623 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37652270210409744 [2025-04-13 20:27:11,623 INFO L175 Difference]: Start difference. First operand has 118 places, 169 transitions, 1164 flow. Second operand 43 states and 340 transitions. [2025-04-13 20:27:11,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 376 transitions, 2920 flow [2025-04-13 20:27:11,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 376 transitions, 2836 flow, removed 20 selfloop flow, removed 12 redundant places. [2025-04-13 20:27:11,642 INFO L231 Difference]: Finished difference. Result has 153 places, 226 transitions, 1887 flow [2025-04-13 20:27:11,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1887, PETRI_PLACES=153, PETRI_TRANSITIONS=226} [2025-04-13 20:27:11,643 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2025-04-13 20:27:11,643 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 226 transitions, 1887 flow [2025-04-13 20:27:11,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:11,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:11,643 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:11,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:11,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:11,848 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-13 20:27:11,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash 331520241, now seen corresponding path program 4 times [2025-04-13 20:27:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:11,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288654457] [2025-04-13 20:27:11,848 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:11,851 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:11,853 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:11,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:11,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:11,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288654457] [2025-04-13 20:27:11,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288654457] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:11,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369939443] [2025-04-13 20:27:11,934 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:11,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:11,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:27:11,961 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:11,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:11,970 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:11,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:11,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:27:11,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:12,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369939443] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:12,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-04-13 20:27:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955348854] [2025-04-13 20:27:12,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:12,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:27:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:12,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:27:12,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:27:12,216 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:12,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 226 transitions, 1887 flow. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:12,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:12,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:12,693 INFO L116 PetriNetUnfolderBase]: 1011/1816 cut-off events. [2025-04-13 20:27:12,694 INFO L117 PetriNetUnfolderBase]: For 4442/4442 co-relation queries the response was YES. [2025-04-13 20:27:12,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7705 conditions, 1816 events. 1011/1816 cut-off events. For 4442/4442 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9774 event pairs, 110 based on Foata normal form. 2/1756 useless extension candidates. Maximal degree in co-relation 7665. Up to 1436 conditions per place. [2025-04-13 20:27:12,703 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 203 selfloop transitions, 85 changer transitions 9/297 dead transitions. [2025-04-13 20:27:12,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 297 transitions, 2821 flow [2025-04-13 20:27:12,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 20:27:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 20:27:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 160 transitions. [2025-04-13 20:27:12,705 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33126293995859213 [2025-04-13 20:27:12,705 INFO L175 Difference]: Start difference. First operand has 153 places, 226 transitions, 1887 flow. Second operand 23 states and 160 transitions. [2025-04-13 20:27:12,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 297 transitions, 2821 flow [2025-04-13 20:27:12,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 297 transitions, 2615 flow, removed 60 selfloop flow, removed 14 redundant places. [2025-04-13 20:27:12,731 INFO L231 Difference]: Finished difference. Result has 166 places, 239 transitions, 2041 flow [2025-04-13 20:27:12,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2041, PETRI_PLACES=166, PETRI_TRANSITIONS=239} [2025-04-13 20:27:12,732 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 145 predicate places. [2025-04-13 20:27:12,732 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 239 transitions, 2041 flow [2025-04-13 20:27:12,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:12,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:12,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:12,738 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-13 20:27:12,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:12,933 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-13 20:27:12,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1873411026, now seen corresponding path program 3 times [2025-04-13 20:27:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:12,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340872361] [2025-04-13 20:27:12,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:12,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:27:12,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:12,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:27:12,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:13,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340872361] [2025-04-13 20:27:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340872361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:13,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:27:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049444378] [2025-04-13 20:27:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:13,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:27:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:13,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:27:13,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:27:13,048 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:13,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 239 transitions, 2041 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:13,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:13,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:13,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:13,278 INFO L116 PetriNetUnfolderBase]: 1006/1807 cut-off events. [2025-04-13 20:27:13,278 INFO L117 PetriNetUnfolderBase]: For 4328/4328 co-relation queries the response was YES. [2025-04-13 20:27:13,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7761 conditions, 1807 events. 1006/1807 cut-off events. For 4328/4328 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9685 event pairs, 150 based on Foata normal form. 1/1746 useless extension candidates. Maximal degree in co-relation 7717. Up to 1757 conditions per place. [2025-04-13 20:27:13,290 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 235 selfloop transitions, 18 changer transitions 4/257 dead transitions. [2025-04-13 20:27:13,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 257 transitions, 2617 flow [2025-04-13 20:27:13,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:27:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:27:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2025-04-13 20:27:13,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3439153439153439 [2025-04-13 20:27:13,291 INFO L175 Difference]: Start difference. First operand has 166 places, 239 transitions, 2041 flow. Second operand 9 states and 65 transitions. [2025-04-13 20:27:13,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 257 transitions, 2617 flow [2025-04-13 20:27:13,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 257 transitions, 2570 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-04-13 20:27:13,315 INFO L231 Difference]: Finished difference. Result has 164 places, 241 transitions, 2054 flow [2025-04-13 20:27:13,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2054, PETRI_PLACES=164, PETRI_TRANSITIONS=241} [2025-04-13 20:27:13,317 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 143 predicate places. [2025-04-13 20:27:13,317 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 241 transitions, 2054 flow [2025-04-13 20:27:13,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:13,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:13,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:13,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:27:13,318 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-13 20:27:13,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1335679712, now seen corresponding path program 4 times [2025-04-13 20:27:13,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:13,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358995795] [2025-04-13 20:27:13,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:13,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:13,325 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:13,325 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:13,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:13,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:13,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358995795] [2025-04-13 20:27:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358995795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:27:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619306455] [2025-04-13 20:27:13,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:13,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:27:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:13,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:27:13,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:27:13,445 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:13,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 241 transitions, 2054 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:13,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:13,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:13,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:13,652 INFO L116 PetriNetUnfolderBase]: 1005/1801 cut-off events. [2025-04-13 20:27:13,652 INFO L117 PetriNetUnfolderBase]: For 4682/4682 co-relation queries the response was YES. [2025-04-13 20:27:13,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7939 conditions, 1801 events. 1005/1801 cut-off events. For 4682/4682 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9620 event pairs, 161 based on Foata normal form. 1/1740 useless extension candidates. Maximal degree in co-relation 7769. Up to 1746 conditions per place. [2025-04-13 20:27:13,663 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 235 selfloop transitions, 16 changer transitions 7/258 dead transitions. [2025-04-13 20:27:13,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 258 transitions, 2614 flow [2025-04-13 20:27:13,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:27:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:27:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2025-04-13 20:27:13,664 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3439153439153439 [2025-04-13 20:27:13,664 INFO L175 Difference]: Start difference. First operand has 164 places, 241 transitions, 2054 flow. Second operand 9 states and 65 transitions. [2025-04-13 20:27:13,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 258 transitions, 2614 flow [2025-04-13 20:27:13,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 258 transitions, 2576 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-04-13 20:27:13,689 INFO L231 Difference]: Finished difference. Result has 166 places, 240 transitions, 2040 flow [2025-04-13 20:27:13,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2040, PETRI_PLACES=166, PETRI_TRANSITIONS=240} [2025-04-13 20:27:13,690 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 145 predicate places. [2025-04-13 20:27:13,690 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 240 transitions, 2040 flow [2025-04-13 20:27:13,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:13,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:13,690 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:13,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:27:13,691 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-13 20:27:13,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1397527093, now seen corresponding path program 5 times [2025-04-13 20:27:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:13,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200706822] [2025-04-13 20:27:13,691 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:13,694 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:13,697 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:13,697 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:13,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:13,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:13,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200706822] [2025-04-13 20:27:13,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200706822] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:13,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352254574] [2025-04-13 20:27:13,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:13,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:13,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:13,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:13,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:27:13,806 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:13,815 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:13,815 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:13,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:13,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:27:13,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:13,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352254574] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:14,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-04-13 20:27:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274819634] [2025-04-13 20:27:14,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:14,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:27:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:14,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:27:14,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:27:14,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:14,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 240 transitions, 2040 flow. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:14,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:14,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:14,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:14,366 INFO L116 PetriNetUnfolderBase]: 1011/1824 cut-off events. [2025-04-13 20:27:14,367 INFO L117 PetriNetUnfolderBase]: For 5169/5169 co-relation queries the response was YES. [2025-04-13 20:27:14,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8215 conditions, 1824 events. 1011/1824 cut-off events. For 5169/5169 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9891 event pairs, 144 based on Foata normal form. 3/1765 useless extension candidates. Maximal degree in co-relation 8044. Up to 1698 conditions per place. [2025-04-13 20:27:14,377 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 210 selfloop transitions, 54 changer transitions 9/273 dead transitions. [2025-04-13 20:27:14,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 273 transitions, 2730 flow [2025-04-13 20:27:14,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:27:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:27:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2025-04-13 20:27:14,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28273809523809523 [2025-04-13 20:27:14,378 INFO L175 Difference]: Start difference. First operand has 166 places, 240 transitions, 2040 flow. Second operand 16 states and 95 transitions. [2025-04-13 20:27:14,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 273 transitions, 2730 flow [2025-04-13 20:27:14,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 273 transitions, 2692 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-04-13 20:27:14,401 INFO L231 Difference]: Finished difference. Result has 175 places, 246 transitions, 2202 flow [2025-04-13 20:27:14,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2202, PETRI_PLACES=175, PETRI_TRANSITIONS=246} [2025-04-13 20:27:14,402 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 154 predicate places. [2025-04-13 20:27:14,402 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 246 transitions, 2202 flow [2025-04-13 20:27:14,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:14,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:14,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:14,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:27:14,606 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,SelfDestructingSolverStorable14 [2025-04-13 20:27:14,606 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-13 20:27:14,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1961104571, now seen corresponding path program 6 times [2025-04-13 20:27:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:14,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914523148] [2025-04-13 20:27:14,606 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:14,610 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:14,611 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:14,612 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:14,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:14,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914523148] [2025-04-13 20:27:14,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914523148] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:14,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063250409] [2025-04-13 20:27:14,690 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:14,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:14,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:14,692 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:14,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:27:14,715 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:27:14,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:27:14,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:14,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:14,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:27:14,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:14,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:14,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063250409] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:14,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:14,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-04-13 20:27:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601991441] [2025-04-13 20:27:14,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:14,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:27:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:14,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:27:14,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:27:14,939 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:14,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 246 transitions, 2202 flow. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:14,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:14,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:14,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:15,298 INFO L116 PetriNetUnfolderBase]: 1011/1818 cut-off events. [2025-04-13 20:27:15,298 INFO L117 PetriNetUnfolderBase]: For 4194/4194 co-relation queries the response was YES. [2025-04-13 20:27:15,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7997 conditions, 1818 events. 1011/1818 cut-off events. For 4194/4194 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9787 event pairs, 137 based on Foata normal form. 3/1759 useless extension candidates. Maximal degree in co-relation 7953. Up to 1692 conditions per place. [2025-04-13 20:27:15,308 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 218 selfloop transitions, 46 changer transitions 9/273 dead transitions. [2025-04-13 20:27:15,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 273 transitions, 2882 flow [2025-04-13 20:27:15,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:27:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:27:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 88 transitions. [2025-04-13 20:27:15,310 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27936507936507937 [2025-04-13 20:27:15,310 INFO L175 Difference]: Start difference. First operand has 175 places, 246 transitions, 2202 flow. Second operand 15 states and 88 transitions. [2025-04-13 20:27:15,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 273 transitions, 2882 flow [2025-04-13 20:27:15,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 273 transitions, 2812 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-04-13 20:27:15,334 INFO L231 Difference]: Finished difference. Result has 187 places, 250 transitions, 2306 flow [2025-04-13 20:27:15,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2306, PETRI_PLACES=187, PETRI_TRANSITIONS=250} [2025-04-13 20:27:15,334 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2025-04-13 20:27:15,334 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 250 transitions, 2306 flow [2025-04-13 20:27:15,334 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 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-13 20:27:15,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:15,335 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:15,340 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-13 20:27:15,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:27:15,539 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-13 20:27:15,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash -690154223, now seen corresponding path program 1 times [2025-04-13 20:27:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:15,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810560022] [2025-04-13 20:27:15,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:15,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:15,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:15,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:15,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:15,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:15,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810560022] [2025-04-13 20:27:15,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810560022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:15,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003210541] [2025-04-13 20:27:15,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:15,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:15,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:15,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:15,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:27:15,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:15,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:15,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:15,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:15,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:27:15,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:15,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003210541] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:15,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:15,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 20:27:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468479871] [2025-04-13 20:27:15,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:15,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:27:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:15,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:27:15,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:27:15,856 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:15,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 250 transitions, 2306 flow. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:15,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:15,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:15,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:16,391 INFO L116 PetriNetUnfolderBase]: 1144/2051 cut-off events. [2025-04-13 20:27:16,391 INFO L117 PetriNetUnfolderBase]: For 5236/5236 co-relation queries the response was YES. [2025-04-13 20:27:16,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9080 conditions, 2051 events. 1144/2051 cut-off events. For 5236/5236 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11406 event pairs, 117 based on Foata normal form. 3/1982 useless extension candidates. Maximal degree in co-relation 9029. Up to 1216 conditions per place. [2025-04-13 20:27:16,401 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 180 selfloop transitions, 177 changer transitions 12/369 dead transitions. [2025-04-13 20:27:16,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 369 transitions, 3724 flow [2025-04-13 20:27:16,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 20:27:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 20:27:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 174 transitions. [2025-04-13 20:27:16,403 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2025-04-13 20:27:16,403 INFO L175 Difference]: Start difference. First operand has 187 places, 250 transitions, 2306 flow. Second operand 21 states and 174 transitions. [2025-04-13 20:27:16,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 369 transitions, 3724 flow [2025-04-13 20:27:16,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 369 transitions, 3638 flow, removed 19 selfloop flow, removed 6 redundant places. [2025-04-13 20:27:16,434 INFO L231 Difference]: Finished difference. Result has 208 places, 299 transitions, 3265 flow [2025-04-13 20:27:16,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3265, PETRI_PLACES=208, PETRI_TRANSITIONS=299} [2025-04-13 20:27:16,434 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 187 predicate places. [2025-04-13 20:27:16,434 INFO L485 AbstractCegarLoop]: Abstraction has has 208 places, 299 transitions, 3265 flow [2025-04-13 20:27:16,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:16,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:16,435 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:16,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:27:16,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:16,635 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-13 20:27:16,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1970568597, now seen corresponding path program 2 times [2025-04-13 20:27:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:16,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033246890] [2025-04-13 20:27:16,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:16,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:16,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:16,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:16,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:16,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033246890] [2025-04-13 20:27:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033246890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:16,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118733394] [2025-04-13 20:27:16,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:16,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:16,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:16,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:27:16,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:16,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:16,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:16,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:16,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:27:16,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:16,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118733394] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:17,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:17,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 20:27:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386949198] [2025-04-13 20:27:17,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:17,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:27:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:17,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:27:17,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:27:17,005 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:17,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 299 transitions, 3265 flow. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:17,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:17,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:17,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:17,835 INFO L116 PetriNetUnfolderBase]: 1212/2206 cut-off events. [2025-04-13 20:27:17,835 INFO L117 PetriNetUnfolderBase]: For 12790/12790 co-relation queries the response was YES. [2025-04-13 20:27:17,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12018 conditions, 2206 events. 1212/2206 cut-off events. For 12790/12790 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12580 event pairs, 104 based on Foata normal form. 8/2138 useless extension candidates. Maximal degree in co-relation 11958. Up to 1237 conditions per place. [2025-04-13 20:27:17,848 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 182 selfloop transitions, 250 changer transitions 29/461 dead transitions. [2025-04-13 20:27:17,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 461 transitions, 5314 flow [2025-04-13 20:27:17,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 20:27:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 20:27:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 251 transitions. [2025-04-13 20:27:17,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3064713064713065 [2025-04-13 20:27:17,849 INFO L175 Difference]: Start difference. First operand has 208 places, 299 transitions, 3265 flow. Second operand 39 states and 251 transitions. [2025-04-13 20:27:17,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 461 transitions, 5314 flow [2025-04-13 20:27:17,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 461 transitions, 5128 flow, removed 48 selfloop flow, removed 10 redundant places. [2025-04-13 20:27:17,924 INFO L231 Difference]: Finished difference. Result has 235 places, 363 transitions, 4338 flow [2025-04-13 20:27:17,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3125, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=4338, PETRI_PLACES=235, PETRI_TRANSITIONS=363} [2025-04-13 20:27:17,925 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 214 predicate places. [2025-04-13 20:27:17,925 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 363 transitions, 4338 flow [2025-04-13 20:27:17,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:17,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:17,925 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:17,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 20:27:18,125 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,SelfDestructingSolverStorable17 [2025-04-13 20:27:18,126 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-13 20:27:18,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1890305877, now seen corresponding path program 3 times [2025-04-13 20:27:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:18,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800981246] [2025-04-13 20:27:18,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:18,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:18,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:18,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:27:18,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:18,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:18,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800981246] [2025-04-13 20:27:18,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800981246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:18,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342753074] [2025-04-13 20:27:18,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:18,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:18,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:18,246 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:18,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:27:18,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:18,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:18,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:27:18,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:18,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:27:18,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:18,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342753074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:18,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 20:27:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84706362] [2025-04-13 20:27:18,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:18,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:27:18,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:18,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:27:18,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:27:18,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:18,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 363 transitions, 4338 flow. Second operand has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:18,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:18,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:18,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:19,120 INFO L116 PetriNetUnfolderBase]: 1196/2174 cut-off events. [2025-04-13 20:27:19,120 INFO L117 PetriNetUnfolderBase]: For 14152/14152 co-relation queries the response was YES. [2025-04-13 20:27:19,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12771 conditions, 2174 events. 1196/2174 cut-off events. For 14152/14152 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12381 event pairs, 122 based on Foata normal form. 3/2139 useless extension candidates. Maximal degree in co-relation 12713. Up to 1347 conditions per place. [2025-04-13 20:27:19,134 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 201 selfloop transitions, 217 changer transitions 12/430 dead transitions. [2025-04-13 20:27:19,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 430 transitions, 5474 flow [2025-04-13 20:27:19,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 20:27:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 20:27:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 192 transitions. [2025-04-13 20:27:19,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3657142857142857 [2025-04-13 20:27:19,135 INFO L175 Difference]: Start difference. First operand has 235 places, 363 transitions, 4338 flow. Second operand 25 states and 192 transitions. [2025-04-13 20:27:19,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 430 transitions, 5474 flow [2025-04-13 20:27:19,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 430 transitions, 4956 flow, removed 110 selfloop flow, removed 15 redundant places. [2025-04-13 20:27:19,217 INFO L231 Difference]: Finished difference. Result has 246 places, 368 transitions, 4372 flow [2025-04-13 20:27:19,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3864, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4372, PETRI_PLACES=246, PETRI_TRANSITIONS=368} [2025-04-13 20:27:19,218 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 225 predicate places. [2025-04-13 20:27:19,218 INFO L485 AbstractCegarLoop]: Abstraction has has 246 places, 368 transitions, 4372 flow [2025-04-13 20:27:19,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:19,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:19,218 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:19,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:19,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:19,422 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-13 20:27:19,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1966993677, now seen corresponding path program 4 times [2025-04-13 20:27:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:19,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309353007] [2025-04-13 20:27:19,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:19,425 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:19,426 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:19,427 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:19,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:19,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:19,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309353007] [2025-04-13 20:27:19,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309353007] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:19,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041811674] [2025-04-13 20:27:19,532 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:19,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:19,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:19,535 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:19,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:27:19,559 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:19,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:19,569 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:19,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:19,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:27:19,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:19,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:19,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041811674] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:19,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:19,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 20:27:19,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386295636] [2025-04-13 20:27:19,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:19,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:27:19,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:19,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:27:19,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:27:19,797 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:19,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 368 transitions, 4372 flow. Second operand has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:19,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:19,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:19,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:20,463 INFO L116 PetriNetUnfolderBase]: 1230/2257 cut-off events. [2025-04-13 20:27:20,463 INFO L117 PetriNetUnfolderBase]: For 5973/5973 co-relation queries the response was YES. [2025-04-13 20:27:20,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11427 conditions, 2257 events. 1230/2257 cut-off events. For 5973/5973 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13193 event pairs, 121 based on Foata normal form. 3/2046 useless extension candidates. Maximal degree in co-relation 11367. Up to 1359 conditions per place. [2025-04-13 20:27:20,477 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 206 selfloop transitions, 241 changer transitions 16/463 dead transitions. [2025-04-13 20:27:20,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 463 transitions, 5686 flow [2025-04-13 20:27:20,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 20:27:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-13 20:27:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 252 transitions. [2025-04-13 20:27:20,480 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2025-04-13 20:27:20,480 INFO L175 Difference]: Start difference. First operand has 246 places, 368 transitions, 4372 flow. Second operand 35 states and 252 transitions. [2025-04-13 20:27:20,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 463 transitions, 5686 flow [2025-04-13 20:27:20,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 463 transitions, 5361 flow, removed 19 selfloop flow, removed 12 redundant places. [2025-04-13 20:27:20,526 INFO L231 Difference]: Finished difference. Result has 275 places, 384 transitions, 4745 flow [2025-04-13 20:27:20,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4061, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4745, PETRI_PLACES=275, PETRI_TRANSITIONS=384} [2025-04-13 20:27:20,527 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 254 predicate places. [2025-04-13 20:27:20,527 INFO L485 AbstractCegarLoop]: Abstraction has has 275 places, 384 transitions, 4745 flow [2025-04-13 20:27:20,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:20,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:20,527 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:20,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:27:20,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:20,731 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-13 20:27:20,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1060222495, now seen corresponding path program 5 times [2025-04-13 20:27:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:20,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072092348] [2025-04-13 20:27:20,731 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:20,734 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:20,735 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:20,735 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:20,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072092348] [2025-04-13 20:27:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072092348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:20,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18350717] [2025-04-13 20:27:20,827 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:20,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:20,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:20,829 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:20,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:27:20,851 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:20,860 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:20,860 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:20,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:20,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:27:20,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:20,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18350717] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:21,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-04-13 20:27:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350142408] [2025-04-13 20:27:21,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:21,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:27:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:21,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:27:21,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:27:21,135 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:21,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 384 transitions, 4745 flow. Second operand has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 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-13 20:27:21,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:21,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:21,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:21,654 INFO L116 PetriNetUnfolderBase]: 1270/2345 cut-off events. [2025-04-13 20:27:21,654 INFO L117 PetriNetUnfolderBase]: For 6055/6055 co-relation queries the response was YES. [2025-04-13 20:27:21,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12190 conditions, 2345 events. 1270/2345 cut-off events. For 6055/6055 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 13969 event pairs, 168 based on Foata normal form. 3/2163 useless extension candidates. Maximal degree in co-relation 12124. Up to 2097 conditions per place. [2025-04-13 20:27:21,665 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 396 selfloop transitions, 70 changer transitions 12/478 dead transitions. [2025-04-13 20:27:21,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 478 transitions, 6218 flow [2025-04-13 20:27:21,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:27:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:27:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 189 transitions. [2025-04-13 20:27:21,666 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2025-04-13 20:27:21,666 INFO L175 Difference]: Start difference. First operand has 275 places, 384 transitions, 4745 flow. Second operand 28 states and 189 transitions. [2025-04-13 20:27:21,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 478 transitions, 6218 flow [2025-04-13 20:27:21,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 478 transitions, 5983 flow, removed 4 selfloop flow, removed 16 redundant places. [2025-04-13 20:27:21,712 INFO L231 Difference]: Finished difference. Result has 299 places, 419 transitions, 5107 flow [2025-04-13 20:27:21,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4512, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5107, PETRI_PLACES=299, PETRI_TRANSITIONS=419} [2025-04-13 20:27:21,713 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 278 predicate places. [2025-04-13 20:27:21,713 INFO L485 AbstractCegarLoop]: Abstraction has has 299 places, 419 transitions, 5107 flow [2025-04-13 20:27:21,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 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-13 20:27:21,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:21,713 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:21,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:21,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 20:27:21,914 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-13 20:27:21,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1092831331, now seen corresponding path program 6 times [2025-04-13 20:27:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:21,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937299935] [2025-04-13 20:27:21,914 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:21,916 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:21,918 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:21,918 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:21,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:22,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:22,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937299935] [2025-04-13 20:27:22,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937299935] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:22,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752192732] [2025-04-13 20:27:22,026 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:22,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:22,028 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:22,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:27:22,053 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:22,061 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:22,061 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:22,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:22,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:27:22,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:22,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752192732] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:22,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-04-13 20:27:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737750140] [2025-04-13 20:27:22,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:22,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:27:22,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:22,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:27:22,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:27:22,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:22,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 419 transitions, 5107 flow. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 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-13 20:27:22,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:22,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:22,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:22,756 INFO L116 PetriNetUnfolderBase]: 1269/2334 cut-off events. [2025-04-13 20:27:22,756 INFO L117 PetriNetUnfolderBase]: For 11533/11533 co-relation queries the response was YES. [2025-04-13 20:27:22,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13154 conditions, 2334 events. 1269/2334 cut-off events. For 11533/11533 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13801 event pairs, 178 based on Foata normal form. 2/2292 useless extension candidates. Maximal degree in co-relation 13075. Up to 2105 conditions per place. [2025-04-13 20:27:22,772 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 392 selfloop transitions, 66 changer transitions 8/466 dead transitions. [2025-04-13 20:27:22,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 466 transitions, 6249 flow [2025-04-13 20:27:22,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:27:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:27:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 164 transitions. [2025-04-13 20:27:22,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3253968253968254 [2025-04-13 20:27:22,773 INFO L175 Difference]: Start difference. First operand has 299 places, 419 transitions, 5107 flow. Second operand 24 states and 164 transitions. [2025-04-13 20:27:22,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 466 transitions, 6249 flow [2025-04-13 20:27:22,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 466 transitions, 6069 flow, removed 56 selfloop flow, removed 11 redundant places. [2025-04-13 20:27:22,839 INFO L231 Difference]: Finished difference. Result has 309 places, 417 transitions, 5073 flow [2025-04-13 20:27:22,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4925, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5073, PETRI_PLACES=309, PETRI_TRANSITIONS=417} [2025-04-13 20:27:22,840 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 288 predicate places. [2025-04-13 20:27:22,840 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 417 transitions, 5073 flow [2025-04-13 20:27:22,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 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-13 20:27:22,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:22,840 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:22,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:23,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 20:27:23,041 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-13 20:27:23,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1016565197, now seen corresponding path program 7 times [2025-04-13 20:27:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:23,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255959814] [2025-04-13 20:27:23,041 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:23,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:23,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:23,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:23,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:23,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:23,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:23,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255959814] [2025-04-13 20:27:23,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255959814] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:23,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293544209] [2025-04-13 20:27:23,150 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:23,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:23,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:23,152 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:23,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:27:23,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:23,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:23,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:23,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:23,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:27:23,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:23,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293544209] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:23,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-04-13 20:27:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231746251] [2025-04-13 20:27:23,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:23,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:23,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:23,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:23,422 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:23,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 417 transitions, 5073 flow. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 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-13 20:27:23,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:23,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:23,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:23,992 INFO L116 PetriNetUnfolderBase]: 1321/2433 cut-off events. [2025-04-13 20:27:23,992 INFO L117 PetriNetUnfolderBase]: For 11454/11454 co-relation queries the response was YES. [2025-04-13 20:27:24,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13682 conditions, 2433 events. 1321/2433 cut-off events. For 11454/11454 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14598 event pairs, 155 based on Foata normal form. 4/2393 useless extension candidates. Maximal degree in co-relation 13604. Up to 2131 conditions per place. [2025-04-13 20:27:24,005 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 416 selfloop transitions, 80 changer transitions 10/506 dead transitions. [2025-04-13 20:27:24,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 506 transitions, 6692 flow [2025-04-13 20:27:24,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:27:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:27:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 188 transitions. [2025-04-13 20:27:24,006 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3197278911564626 [2025-04-13 20:27:24,006 INFO L175 Difference]: Start difference. First operand has 309 places, 417 transitions, 5073 flow. Second operand 28 states and 188 transitions. [2025-04-13 20:27:24,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 506 transitions, 6692 flow [2025-04-13 20:27:24,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 506 transitions, 6552 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-04-13 20:27:24,068 INFO L231 Difference]: Finished difference. Result has 326 places, 445 transitions, 5560 flow [2025-04-13 20:27:24,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4941, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5560, PETRI_PLACES=326, PETRI_TRANSITIONS=445} [2025-04-13 20:27:24,069 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 305 predicate places. [2025-04-13 20:27:24,069 INFO L485 AbstractCegarLoop]: Abstraction has has 326 places, 445 transitions, 5560 flow [2025-04-13 20:27:24,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 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-13 20:27:24,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:24,069 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:24,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:27:24,269 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,SelfDestructingSolverStorable22 [2025-04-13 20:27:24,270 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-13 20:27:24,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:24,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1672728077, now seen corresponding path program 8 times [2025-04-13 20:27:24,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:24,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135440306] [2025-04-13 20:27:24,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:24,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:24,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:24,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:24,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:24,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135440306] [2025-04-13 20:27:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135440306] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:24,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106691577] [2025-04-13 20:27:24,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:24,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:24,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:24,380 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:24,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:27:24,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:24,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:24,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:24,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:24,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:27:24,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:24,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106691577] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:24,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-04-13 20:27:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555321198] [2025-04-13 20:27:24,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:24,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:24,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:24,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:24,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:24,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 445 transitions, 5560 flow. Second operand has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:24,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:24,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:24,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:25,007 INFO L116 PetriNetUnfolderBase]: 1364/2514 cut-off events. [2025-04-13 20:27:25,007 INFO L117 PetriNetUnfolderBase]: For 13716/13716 co-relation queries the response was YES. [2025-04-13 20:27:25,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14634 conditions, 2514 events. 1364/2514 cut-off events. For 13716/13716 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15232 event pairs, 166 based on Foata normal form. 4/2472 useless extension candidates. Maximal degree in co-relation 14543. Up to 2356 conditions per place. [2025-04-13 20:27:25,026 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 429 selfloop transitions, 66 changer transitions 11/506 dead transitions. [2025-04-13 20:27:25,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 506 transitions, 6995 flow [2025-04-13 20:27:25,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:27:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:27:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 108 transitions. [2025-04-13 20:27:25,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3025210084033613 [2025-04-13 20:27:25,027 INFO L175 Difference]: Start difference. First operand has 326 places, 445 transitions, 5560 flow. Second operand 17 states and 108 transitions. [2025-04-13 20:27:25,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 506 transitions, 6995 flow [2025-04-13 20:27:25,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 506 transitions, 6917 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-04-13 20:27:25,149 INFO L231 Difference]: Finished difference. Result has 339 places, 475 transitions, 6071 flow [2025-04-13 20:27:25,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5483, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6071, PETRI_PLACES=339, PETRI_TRANSITIONS=475} [2025-04-13 20:27:25,149 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 318 predicate places. [2025-04-13 20:27:25,149 INFO L485 AbstractCegarLoop]: Abstraction has has 339 places, 475 transitions, 6071 flow [2025-04-13 20:27:25,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:25,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:25,150 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:25,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:25,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:25,350 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-13 20:27:25,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1838524221, now seen corresponding path program 9 times [2025-04-13 20:27:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:25,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429647031] [2025-04-13 20:27:25,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:25,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:25,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:25,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:27:25,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:25,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429647031] [2025-04-13 20:27:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429647031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:27:25,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307970426] [2025-04-13 20:27:25,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:25,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:27:25,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:25,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:27:25,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:27:25,459 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:25,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 475 transitions, 6071 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-13 20:27:25,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:25,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:25,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:25,918 INFO L116 PetriNetUnfolderBase]: 1360/2500 cut-off events. [2025-04-13 20:27:25,919 INFO L117 PetriNetUnfolderBase]: For 13952/13952 co-relation queries the response was YES. [2025-04-13 20:27:25,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14936 conditions, 2500 events. 1360/2500 cut-off events. For 13952/13952 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15072 event pairs, 170 based on Foata normal form. 1/2459 useless extension candidates. Maximal degree in co-relation 14838. Up to 2438 conditions per place. [2025-04-13 20:27:25,938 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 470 selfloop transitions, 22 changer transitions 4/496 dead transitions. [2025-04-13 20:27:25,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 496 transitions, 7164 flow [2025-04-13 20:27:25,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:27:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:27:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2025-04-13 20:27:25,939 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3246753246753247 [2025-04-13 20:27:25,939 INFO L175 Difference]: Start difference. First operand has 339 places, 475 transitions, 6071 flow. Second operand 11 states and 75 transitions. [2025-04-13 20:27:25,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 496 transitions, 7164 flow [2025-04-13 20:27:26,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 496 transitions, 7052 flow, removed 19 selfloop flow, removed 10 redundant places. [2025-04-13 20:27:26,052 INFO L231 Difference]: Finished difference. Result has 340 places, 478 transitions, 6060 flow [2025-04-13 20:27:26,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5961, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6060, PETRI_PLACES=340, PETRI_TRANSITIONS=478} [2025-04-13 20:27:26,053 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 319 predicate places. [2025-04-13 20:27:26,053 INFO L485 AbstractCegarLoop]: Abstraction has has 340 places, 478 transitions, 6060 flow [2025-04-13 20:27:26,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-13 20:27:26,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:26,053 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:26,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 20:27:26,053 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-13 20:27:26,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash -798392751, now seen corresponding path program 10 times [2025-04-13 20:27:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:26,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317097123] [2025-04-13 20:27:26,054 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:26,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:26,056 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:26,058 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:26,058 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:26,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:26,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317097123] [2025-04-13 20:27:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317097123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:27:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122391297] [2025-04-13 20:27:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:26,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:27:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:26,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:27:26,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:27:26,151 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:26,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 478 transitions, 6060 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-13 20:27:26,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:26,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:26,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:26,580 INFO L116 PetriNetUnfolderBase]: 1368/2512 cut-off events. [2025-04-13 20:27:26,581 INFO L117 PetriNetUnfolderBase]: For 14207/14207 co-relation queries the response was YES. [2025-04-13 20:27:26,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14953 conditions, 2512 events. 1368/2512 cut-off events. For 14207/14207 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15133 event pairs, 175 based on Foata normal form. 1/2471 useless extension candidates. Maximal degree in co-relation 14855. Up to 2445 conditions per place. [2025-04-13 20:27:26,599 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 473 selfloop transitions, 26 changer transitions 4/503 dead transitions. [2025-04-13 20:27:26,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 503 transitions, 7238 flow [2025-04-13 20:27:26,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:27:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:27:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2025-04-13 20:27:26,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2025-04-13 20:27:26,600 INFO L175 Difference]: Start difference. First operand has 340 places, 478 transitions, 6060 flow. Second operand 11 states and 78 transitions. [2025-04-13 20:27:26,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 503 transitions, 7238 flow [2025-04-13 20:27:26,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 503 transitions, 7185 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-04-13 20:27:26,701 INFO L231 Difference]: Finished difference. Result has 345 places, 485 transitions, 6200 flow [2025-04-13 20:27:26,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6007, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6200, PETRI_PLACES=345, PETRI_TRANSITIONS=485} [2025-04-13 20:27:26,701 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 324 predicate places. [2025-04-13 20:27:26,702 INFO L485 AbstractCegarLoop]: Abstraction has has 345 places, 485 transitions, 6200 flow [2025-04-13 20:27:26,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-13 20:27:26,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:26,702 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:26,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 20:27:26,702 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-13 20:27:26,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash -968028471, now seen corresponding path program 11 times [2025-04-13 20:27:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:26,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331109891] [2025-04-13 20:27:26,702 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:26,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:26,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:26,708 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:26,708 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:27:26,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:26,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:26,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331109891] [2025-04-13 20:27:26,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331109891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:26,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:26,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:27:26,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004193506] [2025-04-13 20:27:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:26,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:27:26,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:26,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:27:26,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:27:26,822 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:26,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 485 transitions, 6200 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-13 20:27:26,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:26,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:26,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:27,270 INFO L116 PetriNetUnfolderBase]: 1371/2518 cut-off events. [2025-04-13 20:27:27,271 INFO L117 PetriNetUnfolderBase]: For 15542/15542 co-relation queries the response was YES. [2025-04-13 20:27:27,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15181 conditions, 2518 events. 1371/2518 cut-off events. For 15542/15542 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15173 event pairs, 172 based on Foata normal form. 1/2477 useless extension candidates. Maximal degree in co-relation 15080. Up to 2454 conditions per place. [2025-04-13 20:27:27,292 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 475 selfloop transitions, 25 changer transitions 4/504 dead transitions. [2025-04-13 20:27:27,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 504 transitions, 7280 flow [2025-04-13 20:27:27,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:27:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:27:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2025-04-13 20:27:27,292 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-13 20:27:27,293 INFO L175 Difference]: Start difference. First operand has 345 places, 485 transitions, 6200 flow. Second operand 10 states and 75 transitions. [2025-04-13 20:27:27,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 504 transitions, 7280 flow [2025-04-13 20:27:27,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 504 transitions, 7193 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-04-13 20:27:27,406 INFO L231 Difference]: Finished difference. Result has 348 places, 486 transitions, 6181 flow [2025-04-13 20:27:27,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6113, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6181, PETRI_PLACES=348, PETRI_TRANSITIONS=486} [2025-04-13 20:27:27,406 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 327 predicate places. [2025-04-13 20:27:27,406 INFO L485 AbstractCegarLoop]: Abstraction has has 348 places, 486 transitions, 6181 flow [2025-04-13 20:27:27,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-13 20:27:27,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:27,407 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:27,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 20:27:27,407 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-13 20:27:27,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:27,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1044294605, now seen corresponding path program 12 times [2025-04-13 20:27:27,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:27,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119211108] [2025-04-13 20:27:27,407 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:27,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:27,412 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:27,413 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:27,414 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:27,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:27,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119211108] [2025-04-13 20:27:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119211108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:27,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599540843] [2025-04-13 20:27:27,536 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:27,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:27,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:27,539 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:27,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:27:27,566 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:27,575 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:27,575 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:27,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:27,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:27:27,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:27,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:27,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599540843] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:27,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:27,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-04-13 20:27:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969410135] [2025-04-13 20:27:27,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:27,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:27,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:27,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:27,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:27,869 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:27,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 486 transitions, 6181 flow. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 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-13 20:27:27,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:27,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:27,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:28,424 INFO L116 PetriNetUnfolderBase]: 1412/2610 cut-off events. [2025-04-13 20:27:28,424 INFO L117 PetriNetUnfolderBase]: For 17770/17770 co-relation queries the response was YES. [2025-04-13 20:27:28,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15768 conditions, 2610 events. 1412/2610 cut-off events. For 17770/17770 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16020 event pairs, 167 based on Foata normal form. 9/2571 useless extension candidates. Maximal degree in co-relation 15666. Up to 2380 conditions per place. [2025-04-13 20:27:28,441 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 468 selfloop transitions, 66 changer transitions 14/548 dead transitions. [2025-04-13 20:27:28,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 548 transitions, 7639 flow [2025-04-13 20:27:28,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 20:27:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 20:27:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 152 transitions. [2025-04-13 20:27:28,442 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.329004329004329 [2025-04-13 20:27:28,442 INFO L175 Difference]: Start difference. First operand has 348 places, 486 transitions, 6181 flow. Second operand 22 states and 152 transitions. [2025-04-13 20:27:28,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 548 transitions, 7639 flow [2025-04-13 20:27:28,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 548 transitions, 7579 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-04-13 20:27:28,570 INFO L231 Difference]: Finished difference. Result has 368 places, 502 transitions, 6505 flow [2025-04-13 20:27:28,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6118, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6505, PETRI_PLACES=368, PETRI_TRANSITIONS=502} [2025-04-13 20:27:28,570 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 347 predicate places. [2025-04-13 20:27:28,570 INFO L485 AbstractCegarLoop]: Abstraction has has 368 places, 502 transitions, 6505 flow [2025-04-13 20:27:28,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 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-13 20:27:28,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:28,571 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:28,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 20:27:28,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 20:27:28,774 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-13 20:27:28,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1122740744, now seen corresponding path program 1 times [2025-04-13 20:27:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:28,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559891580] [2025-04-13 20:27:28,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:28,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:28,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:28,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:28,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:28,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559891580] [2025-04-13 20:27:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559891580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:28,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:27:28,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287654349] [2025-04-13 20:27:28,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:28,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:27:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:28,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:27:28,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:27:28,798 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:28,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 502 transitions, 6505 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:28,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:28,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:28,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:29,319 INFO L116 PetriNetUnfolderBase]: 1504/2776 cut-off events. [2025-04-13 20:27:29,319 INFO L117 PetriNetUnfolderBase]: For 24583/24583 co-relation queries the response was YES. [2025-04-13 20:27:29,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17556 conditions, 2776 events. 1504/2776 cut-off events. For 24583/24583 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17039 event pairs, 204 based on Foata normal form. 30/2768 useless extension candidates. Maximal degree in co-relation 17446. Up to 2275 conditions per place. [2025-04-13 20:27:29,342 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 493 selfloop transitions, 42 changer transitions 2/537 dead transitions. [2025-04-13 20:27:29,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 537 transitions, 7876 flow [2025-04-13 20:27:29,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:27:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:27:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-13 20:27:29,343 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-13 20:27:29,343 INFO L175 Difference]: Start difference. First operand has 368 places, 502 transitions, 6505 flow. Second operand 5 states and 55 transitions. [2025-04-13 20:27:29,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 537 transitions, 7876 flow [2025-04-13 20:27:29,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 537 transitions, 7676 flow, removed 43 selfloop flow, removed 14 redundant places. [2025-04-13 20:27:29,497 INFO L231 Difference]: Finished difference. Result has 358 places, 507 transitions, 6488 flow [2025-04-13 20:27:29,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6285, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6488, PETRI_PLACES=358, PETRI_TRANSITIONS=507} [2025-04-13 20:27:29,498 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 337 predicate places. [2025-04-13 20:27:29,498 INFO L485 AbstractCegarLoop]: Abstraction has has 358 places, 507 transitions, 6488 flow [2025-04-13 20:27:29,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:29,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:29,498 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:29,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:27:29,498 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-13 20:27:29,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1800600843, now seen corresponding path program 13 times [2025-04-13 20:27:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:29,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988394070] [2025-04-13 20:27:29,499 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:29,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:29,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:29,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:29,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:29,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988394070] [2025-04-13 20:27:29,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988394070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:29,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183175167] [2025-04-13 20:27:29,616 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:29,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:29,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:29,618 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-13 20:27:29,618 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-13 20:27:29,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:27:29,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:29,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:29,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:29,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:27:29,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:29,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:29,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183175167] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:29,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:29,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-04-13 20:27:29,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394134911] [2025-04-13 20:27:29,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:29,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:29,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:29,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:29,905 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:29,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 507 transitions, 6488 flow. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 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-13 20:27:29,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:29,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:29,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:30,528 INFO L116 PetriNetUnfolderBase]: 1645/3057 cut-off events. [2025-04-13 20:27:30,528 INFO L117 PetriNetUnfolderBase]: For 29018/29018 co-relation queries the response was YES. [2025-04-13 20:27:30,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19414 conditions, 3057 events. 1645/3057 cut-off events. For 29018/29018 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 19461 event pairs, 188 based on Foata normal form. 5/3016 useless extension candidates. Maximal degree in co-relation 19304. Up to 2598 conditions per place. [2025-04-13 20:27:30,550 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 466 selfloop transitions, 133 changer transitions 12/611 dead transitions. [2025-04-13 20:27:30,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 611 transitions, 8614 flow [2025-04-13 20:27:30,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 20:27:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 20:27:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 167 transitions. [2025-04-13 20:27:30,550 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2945326278659612 [2025-04-13 20:27:30,550 INFO L175 Difference]: Start difference. First operand has 358 places, 507 transitions, 6488 flow. Second operand 27 states and 167 transitions. [2025-04-13 20:27:30,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 611 transitions, 8614 flow [2025-04-13 20:27:30,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 611 transitions, 8496 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-04-13 20:27:30,712 INFO L231 Difference]: Finished difference. Result has 383 places, 560 transitions, 7491 flow [2025-04-13 20:27:30,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6378, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=7491, PETRI_PLACES=383, PETRI_TRANSITIONS=560} [2025-04-13 20:27:30,712 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 362 predicate places. [2025-04-13 20:27:30,712 INFO L485 AbstractCegarLoop]: Abstraction has has 383 places, 560 transitions, 7491 flow [2025-04-13 20:27:30,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 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-13 20:27:30,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:30,713 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:30,718 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-13 20:27:30,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:30,913 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-13 20:27:30,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1841769151, now seen corresponding path program 14 times [2025-04-13 20:27:30,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:30,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679881918] [2025-04-13 20:27:30,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:30,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:30,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:30,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:30,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:30,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:31,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:31,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679881918] [2025-04-13 20:27:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679881918] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:31,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72115629] [2025-04-13 20:27:31,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:31,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:31,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:31,031 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-13 20:27:31,032 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-13 20:27:31,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:27:31,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:27:31,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:31,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:31,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:27:31,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:31,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:31,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72115629] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:31,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:31,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-04-13 20:27:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327604796] [2025-04-13 20:27:31,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:31,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:31,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:31,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:31,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:31,286 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:31,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 560 transitions, 7491 flow. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 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-13 20:27:31,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:31,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:31,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:31,897 INFO L116 PetriNetUnfolderBase]: 1636/3022 cut-off events. [2025-04-13 20:27:31,897 INFO L117 PetriNetUnfolderBase]: For 32821/32821 co-relation queries the response was YES. [2025-04-13 20:27:31,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20316 conditions, 3022 events. 1636/3022 cut-off events. For 32821/32821 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 19018 event pairs, 184 based on Foata normal form. 6/3004 useless extension candidates. Maximal degree in co-relation 20200. Up to 2598 conditions per place. [2025-04-13 20:27:31,916 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 458 selfloop transitions, 138 changer transitions 9/605 dead transitions. [2025-04-13 20:27:31,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 605 transitions, 8969 flow [2025-04-13 20:27:31,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 20:27:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 20:27:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 159 transitions. [2025-04-13 20:27:31,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3028571428571429 [2025-04-13 20:27:31,917 INFO L175 Difference]: Start difference. First operand has 383 places, 560 transitions, 7491 flow. Second operand 25 states and 159 transitions. [2025-04-13 20:27:31,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 605 transitions, 8969 flow [2025-04-13 20:27:32,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 605 transitions, 8507 flow, removed 207 selfloop flow, removed 12 redundant places. [2025-04-13 20:27:32,122 INFO L231 Difference]: Finished difference. Result has 393 places, 566 transitions, 7527 flow [2025-04-13 20:27:32,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7099, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=7527, PETRI_PLACES=393, PETRI_TRANSITIONS=566} [2025-04-13 20:27:32,123 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 372 predicate places. [2025-04-13 20:27:32,123 INFO L485 AbstractCegarLoop]: Abstraction has has 393 places, 566 transitions, 7527 flow [2025-04-13 20:27:32,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 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-13 20:27:32,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:32,123 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:32,128 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-13 20:27:32,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:32,324 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-13 20:27:32,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash 513823535, now seen corresponding path program 7 times [2025-04-13 20:27:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:32,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855532819] [2025-04-13 20:27:32,324 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:32,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:32,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:27:32,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:32,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:32,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:27:32,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:32,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855532819] [2025-04-13 20:27:32,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855532819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:32,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521891257] [2025-04-13 20:27:32,418 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:32,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:32,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:32,419 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-13 20:27:32,420 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-13 20:27:32,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:27:32,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:32,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:32,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:32,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:32,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:32,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521891257] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:32,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 30 [2025-04-13 20:27:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732426890] [2025-04-13 20:27:32,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:32,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:27:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:32,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:27:32,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:27:32,832 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:32,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 566 transitions, 7527 flow. Second operand has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:32,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:32,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:32,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:35,700 INFO L116 PetriNetUnfolderBase]: 2382/4264 cut-off events. [2025-04-13 20:27:35,700 INFO L117 PetriNetUnfolderBase]: For 37197/37197 co-relation queries the response was YES. [2025-04-13 20:27:35,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27430 conditions, 4264 events. 2382/4264 cut-off events. For 37197/37197 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 27833 event pairs, 71 based on Foata normal form. 2/4220 useless extension candidates. Maximal degree in co-relation 27314. Up to 1423 conditions per place. [2025-04-13 20:27:35,736 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 463 selfloop transitions, 557 changer transitions 8/1028 dead transitions. [2025-04-13 20:27:35,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 1028 transitions, 13853 flow [2025-04-13 20:27:35,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-04-13 20:27:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2025-04-13 20:27:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 599 transitions. [2025-04-13 20:27:35,738 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3241341991341991 [2025-04-13 20:27:35,738 INFO L175 Difference]: Start difference. First operand has 393 places, 566 transitions, 7527 flow. Second operand 88 states and 599 transitions. [2025-04-13 20:27:35,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 1028 transitions, 13853 flow [2025-04-13 20:27:36,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1028 transitions, 13577 flow, removed 44 selfloop flow, removed 16 redundant places. [2025-04-13 20:27:36,064 INFO L231 Difference]: Finished difference. Result has 476 places, 766 transitions, 11123 flow [2025-04-13 20:27:36,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7276, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=11123, PETRI_PLACES=476, PETRI_TRANSITIONS=766} [2025-04-13 20:27:36,065 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 455 predicate places. [2025-04-13 20:27:36,065 INFO L485 AbstractCegarLoop]: Abstraction has has 476 places, 766 transitions, 11123 flow [2025-04-13 20:27:36,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:36,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:36,065 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:36,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 20:27:36,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:36,266 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-13 20:27:36,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2063394701, now seen corresponding path program 8 times [2025-04-13 20:27:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:36,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246258751] [2025-04-13 20:27:36,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:36,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:27:36,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:36,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:36,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:27:36,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:36,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246258751] [2025-04-13 20:27:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246258751] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:36,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879352409] [2025-04-13 20:27:36,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:27:36,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:36,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:36,376 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-13 20:27:36,377 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-13 20:27:36,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:27:36,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:36,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:36,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:36,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:36,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:36,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879352409] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:36,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:36,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 30 [2025-04-13 20:27:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661100857] [2025-04-13 20:27:36,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:36,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:27:36,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:36,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:27:36,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:27:36,747 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:36,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 766 transitions, 11123 flow. Second operand has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:36,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:36,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:36,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:38,908 INFO L116 PetriNetUnfolderBase]: 2519/4478 cut-off events. [2025-04-13 20:27:38,908 INFO L117 PetriNetUnfolderBase]: For 45059/45059 co-relation queries the response was YES. [2025-04-13 20:27:38,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31497 conditions, 4478 events. 2519/4478 cut-off events. For 45059/45059 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 29199 event pairs, 81 based on Foata normal form. 2/4456 useless extension candidates. Maximal degree in co-relation 31366. Up to 2035 conditions per place. [2025-04-13 20:27:38,946 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 468 selfloop transitions, 513 changer transitions 8/989 dead transitions. [2025-04-13 20:27:38,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 989 transitions, 15066 flow [2025-04-13 20:27:38,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 20:27:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-13 20:27:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 426 transitions. [2025-04-13 20:27:38,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3325526932084309 [2025-04-13 20:27:38,948 INFO L175 Difference]: Start difference. First operand has 476 places, 766 transitions, 11123 flow. Second operand 61 states and 426 transitions. [2025-04-13 20:27:38,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 989 transitions, 15066 flow [2025-04-13 20:27:39,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 989 transitions, 14058 flow, removed 351 selfloop flow, removed 37 redundant places. [2025-04-13 20:27:39,356 INFO L231 Difference]: Finished difference. Result has 508 places, 801 transitions, 12005 flow [2025-04-13 20:27:39,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10233, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=478, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=12005, PETRI_PLACES=508, PETRI_TRANSITIONS=801} [2025-04-13 20:27:39,357 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 487 predicate places. [2025-04-13 20:27:39,357 INFO L485 AbstractCegarLoop]: Abstraction has has 508 places, 801 transitions, 12005 flow [2025-04-13 20:27:39,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:39,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:39,357 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:39,362 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-13 20:27:39,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:39,558 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-13 20:27:39,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2009836690, now seen corresponding path program 15 times [2025-04-13 20:27:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:39,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96609543] [2025-04-13 20:27:39,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:39,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 20:27:39,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:39,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:27:39,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:39,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:39,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96609543] [2025-04-13 20:27:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96609543] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:39,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236694486] [2025-04-13 20:27:39,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:39,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:39,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:39,671 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-13 20:27:39,672 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-13 20:27:39,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 20:27:39,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:39,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:27:39,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:39,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:39,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:39,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:27:39,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236694486] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:39,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 20:27:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015580976] [2025-04-13 20:27:39,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:39,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:39,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:39,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:39,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:39,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 801 transitions, 12005 flow. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 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-13 20:27:39,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:39,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:39,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:41,422 INFO L116 PetriNetUnfolderBase]: 2808/5055 cut-off events. [2025-04-13 20:27:41,423 INFO L117 PetriNetUnfolderBase]: For 49324/49324 co-relation queries the response was YES. [2025-04-13 20:27:41,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35547 conditions, 5055 events. 2808/5055 cut-off events. For 49324/49324 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 34433 event pairs, 334 based on Foata normal form. 20/5047 useless extension candidates. Maximal degree in co-relation 35408. Up to 3886 conditions per place. [2025-04-13 20:27:41,466 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 567 selfloop transitions, 404 changer transitions 14/985 dead transitions. [2025-04-13 20:27:41,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 985 transitions, 15934 flow [2025-04-13 20:27:41,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 20:27:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 20:27:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 268 transitions. [2025-04-13 20:27:41,466 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32722832722832723 [2025-04-13 20:27:41,466 INFO L175 Difference]: Start difference. First operand has 508 places, 801 transitions, 12005 flow. Second operand 39 states and 268 transitions. [2025-04-13 20:27:41,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 985 transitions, 15934 flow [2025-04-13 20:27:41,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 985 transitions, 15456 flow, removed 16 selfloop flow, removed 39 redundant places. [2025-04-13 20:27:41,905 INFO L231 Difference]: Finished difference. Result has 516 places, 910 transitions, 14315 flow [2025-04-13 20:27:41,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=11572, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=14315, PETRI_PLACES=516, PETRI_TRANSITIONS=910} [2025-04-13 20:27:41,906 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 495 predicate places. [2025-04-13 20:27:41,906 INFO L485 AbstractCegarLoop]: Abstraction has has 516 places, 910 transitions, 14315 flow [2025-04-13 20:27:41,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 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-13 20:27:41,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:41,906 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:41,911 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-13 20:27:42,106 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,SelfDestructingSolverStorable33 [2025-04-13 20:27:42,107 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-13 20:27:42,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1763934836, now seen corresponding path program 16 times [2025-04-13 20:27:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:42,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404911121] [2025-04-13 20:27:42,107 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:42,109 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:27:42,112 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:42,112 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:42,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:27:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:42,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404911121] [2025-04-13 20:27:42,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404911121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:42,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832688055] [2025-04-13 20:27:42,202 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:42,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:42,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:42,204 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-13 20:27:42,205 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-13 20:27:42,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:27:42,232 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:42,232 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:42,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:42,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:42,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:42,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:27:42,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832688055] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:42,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:42,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 24 [2025-04-13 20:27:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637740371] [2025-04-13 20:27:42,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:42,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:42,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:42,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:42,500 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:42,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 910 transitions, 14315 flow. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 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-13 20:27:42,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:42,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:42,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:44,043 INFO L116 PetriNetUnfolderBase]: 2786/4982 cut-off events. [2025-04-13 20:27:44,043 INFO L117 PetriNetUnfolderBase]: For 57226/57226 co-relation queries the response was YES. [2025-04-13 20:27:44,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36635 conditions, 4982 events. 2786/4982 cut-off events. For 57226/57226 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 33555 event pairs, 328 based on Foata normal form. 3/4961 useless extension candidates. Maximal degree in co-relation 36489. Up to 4158 conditions per place. [2025-04-13 20:27:44,087 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 618 selfloop transitions, 381 changer transitions 10/1009 dead transitions. [2025-04-13 20:27:44,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 1009 transitions, 17184 flow [2025-04-13 20:27:44,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 20:27:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 20:27:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 226 transitions. [2025-04-13 20:27:44,088 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32611832611832614 [2025-04-13 20:27:44,088 INFO L175 Difference]: Start difference. First operand has 516 places, 910 transitions, 14315 flow. Second operand 33 states and 226 transitions. [2025-04-13 20:27:44,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 1009 transitions, 17184 flow [2025-04-13 20:27:44,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 1009 transitions, 16927 flow, removed 77 selfloop flow, removed 18 redundant places. [2025-04-13 20:27:44,607 INFO L231 Difference]: Finished difference. Result has 531 places, 948 transitions, 15572 flow [2025-04-13 20:27:44,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=14062, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=354, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=15572, PETRI_PLACES=531, PETRI_TRANSITIONS=948} [2025-04-13 20:27:44,608 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 510 predicate places. [2025-04-13 20:27:44,608 INFO L485 AbstractCegarLoop]: Abstraction has has 531 places, 948 transitions, 15572 flow [2025-04-13 20:27:44,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 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-13 20:27:44,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:44,608 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:44,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:27:44,809 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,SelfDestructingSolverStorable34 [2025-04-13 20:27:44,809 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-13 20:27:44,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:44,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1933570556, now seen corresponding path program 17 times [2025-04-13 20:27:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:44,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783631968] [2025-04-13 20:27:44,810 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:44,812 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-04-13 20:27:44,813 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:44,813 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:27:44,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:27:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:44,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783631968] [2025-04-13 20:27:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783631968] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:44,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081803633] [2025-04-13 20:27:44,910 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:44,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:44,911 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-13 20:27:44,912 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-13 20:27:44,933 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-04-13 20:27:44,940 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:44,940 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:27:44,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:44,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:44,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:45,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:27:45,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081803633] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:45,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:45,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2025-04-13 20:27:45,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230434057] [2025-04-13 20:27:45,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:45,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:27:45,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:45,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:27:45,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:27:45,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:45,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 948 transitions, 15572 flow. Second operand has 24 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 24 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:45,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:45,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:45,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:46,516 INFO L116 PetriNetUnfolderBase]: 2805/5007 cut-off events. [2025-04-13 20:27:46,516 INFO L117 PetriNetUnfolderBase]: For 64581/64581 co-relation queries the response was YES. [2025-04-13 20:27:46,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38027 conditions, 5007 events. 2805/5007 cut-off events. For 64581/64581 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 33722 event pairs, 333 based on Foata normal form. 3/4984 useless extension candidates. Maximal degree in co-relation 37883. Up to 4185 conditions per place. [2025-04-13 20:27:46,565 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 618 selfloop transitions, 388 changer transitions 9/1015 dead transitions. [2025-04-13 20:27:46,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 1015 transitions, 18044 flow [2025-04-13 20:27:46,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:27:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:27:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 221 transitions. [2025-04-13 20:27:46,568 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33947772657450076 [2025-04-13 20:27:46,569 INFO L175 Difference]: Start difference. First operand has 531 places, 948 transitions, 15572 flow. Second operand 31 states and 221 transitions. [2025-04-13 20:27:46,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 1015 transitions, 18044 flow [2025-04-13 20:27:47,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 1015 transitions, 17325 flow, removed 216 selfloop flow, removed 13 redundant places. [2025-04-13 20:27:47,217 INFO L231 Difference]: Finished difference. Result has 548 places, 959 transitions, 15974 flow [2025-04-13 20:27:47,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=14969, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=15974, PETRI_PLACES=548, PETRI_TRANSITIONS=959} [2025-04-13 20:27:47,218 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 527 predicate places. [2025-04-13 20:27:47,218 INFO L485 AbstractCegarLoop]: Abstraction has has 548 places, 959 transitions, 15974 flow [2025-04-13 20:27:47,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 24 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:47,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:47,219 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:47,225 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-13 20:27:47,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:47,419 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-13 20:27:47,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash 502525261, now seen corresponding path program 9 times [2025-04-13 20:27:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:47,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124371954] [2025-04-13 20:27:47,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:47,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 20:27:47,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:47,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:27:47,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:27:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:47,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124371954] [2025-04-13 20:27:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124371954] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:47,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909436280] [2025-04-13 20:27:47,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:47,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:47,601 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-13 20:27:47,602 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-13 20:27:47,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 20:27:47,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:47,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:27:47,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:47,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:47,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:47,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909436280] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:47,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:47,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2025-04-13 20:27:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119301077] [2025-04-13 20:27:47,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:47,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:27:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:47,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:27:47,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:27:47,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:47,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 959 transitions, 15974 flow. Second operand has 33 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 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-13 20:27:47,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:47,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:47,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:50,317 INFO L116 PetriNetUnfolderBase]: 2803/5007 cut-off events. [2025-04-13 20:27:50,317 INFO L117 PetriNetUnfolderBase]: For 54980/54980 co-relation queries the response was YES. [2025-04-13 20:27:50,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37567 conditions, 5007 events. 2803/5007 cut-off events. For 54980/54980 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 33703 event pairs, 137 based on Foata normal form. 2/4983 useless extension candidates. Maximal degree in co-relation 37419. Up to 2975 conditions per place. [2025-04-13 20:27:50,377 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 496 selfloop transitions, 537 changer transitions 75/1108 dead transitions. [2025-04-13 20:27:50,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 1108 transitions, 19302 flow [2025-04-13 20:27:50,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 20:27:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-04-13 20:27:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 399 transitions. [2025-04-13 20:27:50,379 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30158730158730157 [2025-04-13 20:27:50,379 INFO L175 Difference]: Start difference. First operand has 548 places, 959 transitions, 15974 flow. Second operand 63 states and 399 transitions. [2025-04-13 20:27:50,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 1108 transitions, 19302 flow [2025-04-13 20:27:51,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 1108 transitions, 18784 flow, removed 3 selfloop flow, removed 20 redundant places. [2025-04-13 20:27:51,020 INFO L231 Difference]: Finished difference. Result has 588 places, 914 transitions, 15878 flow [2025-04-13 20:27:51,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15463, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=536, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=15878, PETRI_PLACES=588, PETRI_TRANSITIONS=914} [2025-04-13 20:27:51,021 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 567 predicate places. [2025-04-13 20:27:51,021 INFO L485 AbstractCegarLoop]: Abstraction has has 588 places, 914 transitions, 15878 flow [2025-04-13 20:27:51,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 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-13 20:27:51,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:51,021 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:51,027 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-13 20:27:51,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:51,225 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-13 20:27:51,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:51,226 INFO L85 PathProgramCache]: Analyzing trace with hash 523136023, now seen corresponding path program 1 times [2025-04-13 20:27:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:51,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858513717] [2025-04-13 20:27:51,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:51,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:27:51,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:51,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:51,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:51,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858513717] [2025-04-13 20:27:51,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858513717] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:51,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857000797] [2025-04-13 20:27:51,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:27:51,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:51,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:51,327 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-13 20:27:51,328 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-13 20:27:51,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:27:51,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:51,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:51,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:51,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:27:51,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:51,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:51,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857000797] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:51,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:51,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-04-13 20:27:51,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340733291] [2025-04-13 20:27:51,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:51,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:27:51,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:51,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:27:51,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:27:51,713 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:51,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 914 transitions, 15878 flow. Second operand has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 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-13 20:27:51,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:51,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:53,406 INFO L116 PetriNetUnfolderBase]: 3184/5695 cut-off events. [2025-04-13 20:27:53,406 INFO L117 PetriNetUnfolderBase]: For 75017/75017 co-relation queries the response was YES. [2025-04-13 20:27:53,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43689 conditions, 5695 events. 3184/5695 cut-off events. For 75017/75017 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 39818 event pairs, 284 based on Foata normal form. 13/5682 useless extension candidates. Maximal degree in co-relation 43539. Up to 4135 conditions per place. [2025-04-13 20:27:53,463 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 824 selfloop transitions, 299 changer transitions 23/1146 dead transitions. [2025-04-13 20:27:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 1146 transitions, 20730 flow [2025-04-13 20:27:53,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:27:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:27:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 230 transitions. [2025-04-13 20:27:53,464 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3533026113671275 [2025-04-13 20:27:53,464 INFO L175 Difference]: Start difference. First operand has 588 places, 914 transitions, 15878 flow. Second operand 31 states and 230 transitions. [2025-04-13 20:27:53,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 1146 transitions, 20730 flow [2025-04-13 20:27:54,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 1146 transitions, 19579 flow, removed 26 selfloop flow, removed 52 redundant places. [2025-04-13 20:27:54,087 INFO L231 Difference]: Finished difference. Result has 524 places, 1031 transitions, 17270 flow [2025-04-13 20:27:54,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=14755, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=17270, PETRI_PLACES=524, PETRI_TRANSITIONS=1031} [2025-04-13 20:27:54,088 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 503 predicate places. [2025-04-13 20:27:54,088 INFO L485 AbstractCegarLoop]: Abstraction has has 524 places, 1031 transitions, 17270 flow [2025-04-13 20:27:54,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 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-13 20:27:54,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:54,089 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:54,094 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-13 20:27:54,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 20:27:54,289 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-13 20:27:54,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash 224270804, now seen corresponding path program 18 times [2025-04-13 20:27:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:54,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69953641] [2025-04-13 20:27:54,290 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:54,292 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:27:54,293 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:54,293 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:54,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:54,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69953641] [2025-04-13 20:27:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69953641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:54,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425136234] [2025-04-13 20:27:54,412 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:54,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:54,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:54,414 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-13 20:27:54,415 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-13 20:27:54,436 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:27:54,445 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:54,445 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:54,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:54,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:54,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:54,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:27:54,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425136234] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:54,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:54,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 20:27:54,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78643406] [2025-04-13 20:27:54,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:54,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:54,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:54,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:54,669 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:54,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 1031 transitions, 17270 flow. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 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-13 20:27:54,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:54,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:54,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:56,514 INFO L116 PetriNetUnfolderBase]: 3291/5889 cut-off events. [2025-04-13 20:27:56,514 INFO L117 PetriNetUnfolderBase]: For 102449/102449 co-relation queries the response was YES. [2025-04-13 20:27:56,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47467 conditions, 5889 events. 3291/5889 cut-off events. For 102449/102449 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 41367 event pairs, 344 based on Foata normal form. 23/5886 useless extension candidates. Maximal degree in co-relation 47318. Up to 4806 conditions per place. [2025-04-13 20:27:56,579 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 731 selfloop transitions, 397 changer transitions 11/1139 dead transitions. [2025-04-13 20:27:56,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 1139 transitions, 20556 flow [2025-04-13 20:27:56,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 20:27:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-13 20:27:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 238 transitions. [2025-04-13 20:27:56,580 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:27:56,580 INFO L175 Difference]: Start difference. First operand has 524 places, 1031 transitions, 17270 flow. Second operand 34 states and 238 transitions. [2025-04-13 20:27:56,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 1139 transitions, 20556 flow [2025-04-13 20:27:57,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 1139 transitions, 19997 flow, removed 213 selfloop flow, removed 16 redundant places. [2025-04-13 20:27:57,528 INFO L231 Difference]: Finished difference. Result has 540 places, 1074 transitions, 18431 flow [2025-04-13 20:27:57,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=16724, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=18431, PETRI_PLACES=540, PETRI_TRANSITIONS=1074} [2025-04-13 20:27:57,529 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 519 predicate places. [2025-04-13 20:27:57,529 INFO L485 AbstractCegarLoop]: Abstraction has has 540 places, 1074 transitions, 18431 flow [2025-04-13 20:27:57,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 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-13 20:27:57,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:57,529 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:57,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:57,729 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,SelfDestructingSolverStorable38 [2025-04-13 20:27:57,730 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-13 20:27:57,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash 470172658, now seen corresponding path program 19 times [2025-04-13 20:27:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:57,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580200317] [2025-04-13 20:27:57,730 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:57,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:57,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:27:57,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:57,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:57,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:57,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580200317] [2025-04-13 20:27:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580200317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:57,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916903690] [2025-04-13 20:27:57,835 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:57,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:57,837 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-13 20:27:57,838 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-13 20:27:57,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:27:57,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:27:57,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:57,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:57,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:57,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:57,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:27:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916903690] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:58,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:27:58,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 24 [2025-04-13 20:27:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245128059] [2025-04-13 20:27:58,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:58,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:27:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:58,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:27:58,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:58,070 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:27:58,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 1074 transitions, 18431 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:27:58,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:58,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:27:58,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:59,663 INFO L116 PetriNetUnfolderBase]: 3280/5814 cut-off events. [2025-04-13 20:27:59,663 INFO L117 PetriNetUnfolderBase]: For 97364/97364 co-relation queries the response was YES. [2025-04-13 20:27:59,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47361 conditions, 5814 events. 3280/5814 cut-off events. For 97364/97364 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 40124 event pairs, 348 based on Foata normal form. 1/5789 useless extension candidates. Maximal degree in co-relation 47210. Up to 5244 conditions per place. [2025-04-13 20:27:59,721 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 802 selfloop transitions, 310 changer transitions 5/1117 dead transitions. [2025-04-13 20:27:59,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 1117 transitions, 21074 flow [2025-04-13 20:27:59,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:27:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:27:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2025-04-13 20:27:59,722 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3401360544217687 [2025-04-13 20:27:59,722 INFO L175 Difference]: Start difference. First operand has 540 places, 1074 transitions, 18431 flow. Second operand 14 states and 100 transitions. [2025-04-13 20:27:59,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 1117 transitions, 21074 flow [2025-04-13 20:28:00,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 1117 transitions, 20178 flow, removed 177 selfloop flow, removed 36 redundant places. [2025-04-13 20:28:00,628 INFO L231 Difference]: Finished difference. Result has 515 places, 1089 transitions, 18464 flow [2025-04-13 20:28:00,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=17541, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=18464, PETRI_PLACES=515, PETRI_TRANSITIONS=1089} [2025-04-13 20:28:00,629 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 494 predicate places. [2025-04-13 20:28:00,629 INFO L485 AbstractCegarLoop]: Abstraction has has 515 places, 1089 transitions, 18464 flow [2025-04-13 20:28:00,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:00,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:00,630 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:00,636 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-13 20:28:00,830 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,SelfDestructingSolverStorable39 [2025-04-13 20:28:00,830 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-13 20:28:00,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash 300536938, now seen corresponding path program 20 times [2025-04-13 20:28:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:00,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619039370] [2025-04-13 20:28:00,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:28:00,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:00,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:00,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:00,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:00,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:00,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619039370] [2025-04-13 20:28:00,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619039370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:00,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990365547] [2025-04-13 20:28:00,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:28:00,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:00,954 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-13 20:28:00,955 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-13 20:28:00,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:00,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:00,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:00,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:00,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:28:00,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:01,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:28:01,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990365547] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:01,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:28:01,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 10] total 22 [2025-04-13 20:28:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112122611] [2025-04-13 20:28:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:28:01,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:28:01,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:01,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:28:01,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:28:01,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:01,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 1089 transitions, 18464 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:01,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:01,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:01,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:02,351 INFO L116 PetriNetUnfolderBase]: 3277/5806 cut-off events. [2025-04-13 20:28:02,352 INFO L117 PetriNetUnfolderBase]: For 97285/97285 co-relation queries the response was YES. [2025-04-13 20:28:02,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46982 conditions, 5806 events. 3277/5806 cut-off events. For 97285/97285 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 40064 event pairs, 369 based on Foata normal form. 1/5779 useless extension candidates. Maximal degree in co-relation 46845. Up to 5244 conditions per place. [2025-04-13 20:28:02,412 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 800 selfloop transitions, 309 changer transitions 4/1113 dead transitions. [2025-04-13 20:28:02,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 1113 transitions, 20829 flow [2025-04-13 20:28:02,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:28:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:28:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2025-04-13 20:28:02,412 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-04-13 20:28:02,412 INFO L175 Difference]: Start difference. First operand has 515 places, 1089 transitions, 18464 flow. Second operand 12 states and 91 transitions. [2025-04-13 20:28:02,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 1113 transitions, 20829 flow [2025-04-13 20:28:03,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 1113 transitions, 20541 flow, removed 73 selfloop flow, removed 6 redundant places. [2025-04-13 20:28:03,278 INFO L231 Difference]: Finished difference. Result has 520 places, 1091 transitions, 18906 flow [2025-04-13 20:28:03,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=18205, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1088, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=306, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=18906, PETRI_PLACES=520, PETRI_TRANSITIONS=1091} [2025-04-13 20:28:03,279 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 499 predicate places. [2025-04-13 20:28:03,279 INFO L485 AbstractCegarLoop]: Abstraction has has 520 places, 1091 transitions, 18906 flow [2025-04-13 20:28:03,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:03,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:03,279 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:03,285 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-13 20:28:03,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:03,479 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-13 20:28:03,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -404162668, now seen corresponding path program 21 times [2025-04-13 20:28:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:03,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536035882] [2025-04-13 20:28:03,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:28:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:03,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:03,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:03,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:28:03,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:03,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536035882] [2025-04-13 20:28:03,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536035882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:03,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908207929] [2025-04-13 20:28:03,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:28:03,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:03,571 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-13 20:28:03,572 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-13 20:28:03,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:03,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:03,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:28:03,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:03,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:28:03,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:03,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:28:03,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908207929] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:03,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:03,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 20:28:03,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149057041] [2025-04-13 20:28:03,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:03,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:28:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:03,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:28:03,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:28:03,769 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:03,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 1091 transitions, 18906 flow. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 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-13 20:28:03,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:03,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:03,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:05,410 INFO L116 PetriNetUnfolderBase]: 3432/6091 cut-off events. [2025-04-13 20:28:05,410 INFO L117 PetriNetUnfolderBase]: For 102688/102688 co-relation queries the response was YES. [2025-04-13 20:28:05,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49650 conditions, 6091 events. 3432/6091 cut-off events. For 102688/102688 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 42621 event pairs, 364 based on Foata normal form. 6/6069 useless extension candidates. Maximal degree in co-relation 49511. Up to 5010 conditions per place. [2025-04-13 20:28:05,470 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 707 selfloop transitions, 536 changer transitions 16/1259 dead transitions. [2025-04-13 20:28:05,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 1259 transitions, 23556 flow [2025-04-13 20:28:05,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 20:28:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 20:28:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 199 transitions. [2025-04-13 20:28:05,471 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2961309523809524 [2025-04-13 20:28:05,471 INFO L175 Difference]: Start difference. First operand has 520 places, 1091 transitions, 18906 flow. Second operand 32 states and 199 transitions. [2025-04-13 20:28:05,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 1259 transitions, 23556 flow [2025-04-13 20:28:06,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 1259 transitions, 22943 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-04-13 20:28:06,316 INFO L231 Difference]: Finished difference. Result has 550 places, 1201 transitions, 21647 flow [2025-04-13 20:28:06,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=18293, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1091, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=450, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=21647, PETRI_PLACES=550, PETRI_TRANSITIONS=1201} [2025-04-13 20:28:06,317 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 529 predicate places. [2025-04-13 20:28:06,317 INFO L485 AbstractCegarLoop]: Abstraction has has 550 places, 1201 transitions, 21647 flow [2025-04-13 20:28:06,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 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-13 20:28:06,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:06,317 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:06,323 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-13 20:28:06,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:06,518 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-13 20:28:06,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash -569801802, now seen corresponding path program 22 times [2025-04-13 20:28:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:06,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214102686] [2025-04-13 20:28:06,518 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:28:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:06,520 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:06,522 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:06,522 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:28:06,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:28:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:06,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214102686] [2025-04-13 20:28:06,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214102686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:06,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2895395] [2025-04-13 20:28:06,605 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:28:06,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:06,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:06,607 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-13 20:28:06,607 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-13 20:28:06,627 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:06,635 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:06,635 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:28:06,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:06,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:28:06,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:06,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:28:06,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2895395] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:06,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:06,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 24 [2025-04-13 20:28:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843347326] [2025-04-13 20:28:06,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:06,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:28:06,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:06,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:28:06,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:28:06,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:06,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 1201 transitions, 21647 flow. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 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-13 20:28:06,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:06,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:06,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:08,972 INFO L116 PetriNetUnfolderBase]: 3703/6599 cut-off events. [2025-04-13 20:28:08,973 INFO L117 PetriNetUnfolderBase]: For 130091/130091 co-relation queries the response was YES. [2025-04-13 20:28:09,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56527 conditions, 6599 events. 3703/6599 cut-off events. For 130091/130091 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 47152 event pairs, 317 based on Foata normal form. 6/6577 useless extension candidates. Maximal degree in co-relation 56380. Up to 5135 conditions per place. [2025-04-13 20:28:09,036 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 863 selfloop transitions, 599 changer transitions 15/1477 dead transitions. [2025-04-13 20:28:09,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 1477 transitions, 28703 flow [2025-04-13 20:28:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 20:28:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-13 20:28:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 276 transitions. [2025-04-13 20:28:09,037 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2987012987012987 [2025-04-13 20:28:09,037 INFO L175 Difference]: Start difference. First operand has 550 places, 1201 transitions, 21647 flow. Second operand 44 states and 276 transitions. [2025-04-13 20:28:09,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 1477 transitions, 28703 flow [2025-04-13 20:28:10,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 1477 transitions, 27435 flow, removed 409 selfloop flow, removed 21 redundant places. [2025-04-13 20:28:10,253 INFO L231 Difference]: Finished difference. Result has 581 places, 1388 transitions, 25657 flow [2025-04-13 20:28:10,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=20605, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=451, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=25657, PETRI_PLACES=581, PETRI_TRANSITIONS=1388} [2025-04-13 20:28:10,254 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 560 predicate places. [2025-04-13 20:28:10,254 INFO L485 AbstractCegarLoop]: Abstraction has has 581 places, 1388 transitions, 25657 flow [2025-04-13 20:28:10,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 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-13 20:28:10,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:10,254 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:10,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 20:28:10,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:10,455 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-13 20:28:10,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash 662258819, now seen corresponding path program 2 times [2025-04-13 20:28:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:10,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252868863] [2025-04-13 20:28:10,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:28:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:10,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:10,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:10,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:10,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:10,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252868863] [2025-04-13 20:28:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252868863] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:10,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904270978] [2025-04-13 20:28:10,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:28:10,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:10,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:10,554 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-13 20:28:10,555 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-13 20:28:10,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:10,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:10,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:10,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:10,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:28:10,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:10,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:11,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904270978] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:11,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:11,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-04-13 20:28:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681339169] [2025-04-13 20:28:11,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:11,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:28:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:11,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:28:11,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:28:11,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:11,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 1388 transitions, 25657 flow. Second operand has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 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-13 20:28:11,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:11,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:11,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:13,205 INFO L116 PetriNetUnfolderBase]: 3760/6741 cut-off events. [2025-04-13 20:28:13,206 INFO L117 PetriNetUnfolderBase]: For 139635/139635 co-relation queries the response was YES. [2025-04-13 20:28:13,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59120 conditions, 6741 events. 3760/6741 cut-off events. For 139635/139635 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 48414 event pairs, 234 based on Foata normal form. 13/6730 useless extension candidates. Maximal degree in co-relation 58963. Up to 5429 conditions per place. [2025-04-13 20:28:13,281 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1220 selfloop transitions, 251 changer transitions 32/1503 dead transitions. [2025-04-13 20:28:13,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 1503 transitions, 29977 flow [2025-04-13 20:28:13,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 20:28:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 20:28:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 199 transitions. [2025-04-13 20:28:13,282 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3509700176366843 [2025-04-13 20:28:13,282 INFO L175 Difference]: Start difference. First operand has 581 places, 1388 transitions, 25657 flow. Second operand 27 states and 199 transitions. [2025-04-13 20:28:13,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 1503 transitions, 29977 flow [2025-04-13 20:28:14,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 1503 transitions, 28387 flow, removed 562 selfloop flow, removed 23 redundant places. [2025-04-13 20:28:14,959 INFO L231 Difference]: Finished difference. Result has 586 places, 1390 transitions, 24771 flow [2025-04-13 20:28:14,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=24097, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=24771, PETRI_PLACES=586, PETRI_TRANSITIONS=1390} [2025-04-13 20:28:14,960 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 565 predicate places. [2025-04-13 20:28:14,960 INFO L485 AbstractCegarLoop]: Abstraction has has 586 places, 1390 transitions, 24771 flow [2025-04-13 20:28:14,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 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-13 20:28:14,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:14,961 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:14,966 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-13 20:28:15,161 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,SelfDestructingSolverStorable43 [2025-04-13 20:28:15,161 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-13 20:28:15,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash -403568022, now seen corresponding path program 23 times [2025-04-13 20:28:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:15,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827950903] [2025-04-13 20:28:15,162 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:28:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:15,165 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:15,167 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:15,167 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:15,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:15,272 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-13 20:28:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:15,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827950903] [2025-04-13 20:28:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827950903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:15,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025135529] [2025-04-13 20:28:15,272 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:28:15,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:15,274 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-13 20:28:15,275 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-13 20:28:15,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:15,307 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:15,307 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:15,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:15,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:28:15,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:15,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:28:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025135529] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:15,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:28:15,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 11] total 24 [2025-04-13 20:28:15,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840004626] [2025-04-13 20:28:15,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:28:15,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:28:15,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:15,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:28:15,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:28:15,552 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:15,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 1390 transitions, 24771 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:15,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:15,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:15,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:17,763 INFO L116 PetriNetUnfolderBase]: 3755/6721 cut-off events. [2025-04-13 20:28:17,764 INFO L117 PetriNetUnfolderBase]: For 115851/115851 co-relation queries the response was YES. [2025-04-13 20:28:17,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56669 conditions, 6721 events. 3755/6721 cut-off events. For 115851/115851 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 48299 event pairs, 325 based on Foata normal form. 7/6704 useless extension candidates. Maximal degree in co-relation 56507. Up to 6002 conditions per place. [2025-04-13 20:28:17,828 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1071 selfloop transitions, 353 changer transitions 11/1435 dead transitions. [2025-04-13 20:28:17,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 1435 transitions, 28150 flow [2025-04-13 20:28:17,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:28:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:28:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2025-04-13 20:28:17,829 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2025-04-13 20:28:17,829 INFO L175 Difference]: Start difference. First operand has 586 places, 1390 transitions, 24771 flow. Second operand 12 states and 88 transitions. [2025-04-13 20:28:17,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 1435 transitions, 28150 flow [2025-04-13 20:28:19,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 1435 transitions, 27760 flow, removed 79 selfloop flow, removed 21 redundant places. [2025-04-13 20:28:19,067 INFO L231 Difference]: Finished difference. Result has 568 places, 1407 transitions, 25533 flow [2025-04-13 20:28:19,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=24381, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=335, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1037, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=25533, PETRI_PLACES=568, PETRI_TRANSITIONS=1407} [2025-04-13 20:28:19,068 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 547 predicate places. [2025-04-13 20:28:19,068 INFO L485 AbstractCegarLoop]: Abstraction has has 568 places, 1407 transitions, 25533 flow [2025-04-13 20:28:19,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:19,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:19,069 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:19,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 20:28:19,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:19,269 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-13 20:28:19,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash -573203742, now seen corresponding path program 24 times [2025-04-13 20:28:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:19,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374846178] [2025-04-13 20:28:19,270 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:28:19,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:19,272 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:19,273 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:19,273 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:28:19,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:19,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:19,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374846178] [2025-04-13 20:28:19,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374846178] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:19,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023912845] [2025-04-13 20:28:19,386 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:28:19,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:19,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:19,388 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-13 20:28:19,390 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-13 20:28:19,409 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:19,417 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:19,417 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:28:19,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:19,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:28:19,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:19,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:28:19,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023912845] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:19,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:19,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 20:28:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299169339] [2025-04-13 20:28:19,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:19,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:28:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:19,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:28:19,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:28:19,619 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:19,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 1407 transitions, 25533 flow. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 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-13 20:28:19,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:19,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:19,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:21,995 INFO L116 PetriNetUnfolderBase]: 4024/7146 cut-off events. [2025-04-13 20:28:21,995 INFO L117 PetriNetUnfolderBase]: For 132084/132084 co-relation queries the response was YES. [2025-04-13 20:28:22,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61106 conditions, 7146 events. 4024/7146 cut-off events. For 132084/132084 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 51501 event pairs, 305 based on Foata normal form. 10/7136 useless extension candidates. Maximal degree in co-relation 60945. Up to 4815 conditions per place. [2025-04-13 20:28:22,079 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 682 selfloop transitions, 902 changer transitions 13/1597 dead transitions. [2025-04-13 20:28:22,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 1597 transitions, 31332 flow [2025-04-13 20:28:22,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:28:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:28:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 257 transitions. [2025-04-13 20:28:22,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29849012775842043 [2025-04-13 20:28:22,080 INFO L175 Difference]: Start difference. First operand has 568 places, 1407 transitions, 25533 flow. Second operand 41 states and 257 transitions. [2025-04-13 20:28:22,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 1597 transitions, 31332 flow [2025-04-13 20:28:23,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 1597 transitions, 30683 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-04-13 20:28:23,582 INFO L231 Difference]: Finished difference. Result has 607 places, 1525 transitions, 29811 flow [2025-04-13 20:28:23,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=24877, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=806, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=29811, PETRI_PLACES=607, PETRI_TRANSITIONS=1525} [2025-04-13 20:28:23,583 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 586 predicate places. [2025-04-13 20:28:23,583 INFO L485 AbstractCegarLoop]: Abstraction has has 607 places, 1525 transitions, 29811 flow [2025-04-13 20:28:23,583 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 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-13 20:28:23,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:23,583 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:23,589 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-13 20:28:23,783 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:23,784 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-13 20:28:23,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1675998102, now seen corresponding path program 25 times [2025-04-13 20:28:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:23,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239503066] [2025-04-13 20:28:23,784 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:28:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:23,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:28:23,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:23,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:28:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:23,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239503066] [2025-04-13 20:28:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239503066] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:23,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231039492] [2025-04-13 20:28:23,882 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:28:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:23,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:23,885 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-13 20:28:23,885 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-13 20:28:23,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:28:23,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:28:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:23,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:28:23,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:24,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231039492] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:24,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-04-13 20:28:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056440231] [2025-04-13 20:28:24,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:24,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:28:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:24,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:28:24,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:28:24,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:24,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 1525 transitions, 29811 flow. Second operand has 32 states, 32 states have (on average 3.4375) internal successors, (110), 32 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-13 20:28:24,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:24,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:24,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:27,364 INFO L116 PetriNetUnfolderBase]: 4471/7936 cut-off events. [2025-04-13 20:28:27,364 INFO L117 PetriNetUnfolderBase]: For 178578/178578 co-relation queries the response was YES. [2025-04-13 20:28:27,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73184 conditions, 7936 events. 4471/7936 cut-off events. For 178578/178578 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 58301 event pairs, 315 based on Foata normal form. 15/7927 useless extension candidates. Maximal degree in co-relation 73015. Up to 6690 conditions per place. [2025-04-13 20:28:27,464 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1347 selfloop transitions, 495 changer transitions 22/1864 dead transitions. [2025-04-13 20:28:27,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 1864 transitions, 39358 flow [2025-04-13 20:28:27,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 20:28:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-04-13 20:28:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 304 transitions. [2025-04-13 20:28:27,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2783882783882784 [2025-04-13 20:28:27,465 INFO L175 Difference]: Start difference. First operand has 607 places, 1525 transitions, 29811 flow. Second operand 52 states and 304 transitions. [2025-04-13 20:28:27,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 1864 transitions, 39358 flow [2025-04-13 20:28:29,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 1864 transitions, 37658 flow, removed 607 selfloop flow, removed 25 redundant places. [2025-04-13 20:28:29,848 INFO L231 Difference]: Finished difference. Result has 654 places, 1769 transitions, 35359 flow [2025-04-13 20:28:29,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=28477, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=35359, PETRI_PLACES=654, PETRI_TRANSITIONS=1769} [2025-04-13 20:28:29,850 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 633 predicate places. [2025-04-13 20:28:29,850 INFO L485 AbstractCegarLoop]: Abstraction has has 654 places, 1769 transitions, 35359 flow [2025-04-13 20:28:29,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.4375) internal successors, (110), 32 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-13 20:28:29,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:29,850 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:29,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 20:28:30,050 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,SelfDestructingSolverStorable46 [2025-04-13 20:28:30,050 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-13 20:28:30,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2114226823, now seen corresponding path program 3 times [2025-04-13 20:28:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:30,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55889921] [2025-04-13 20:28:30,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:28:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:30,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:30,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:30,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:28:30,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:30,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:30,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55889921] [2025-04-13 20:28:30,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55889921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:30,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610231802] [2025-04-13 20:28:30,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:28:30,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:30,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:30,181 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-13 20:28:30,182 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-13 20:28:30,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:30,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:30,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:28:30,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:30,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:28:30,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:30,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610231802] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:30,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-04-13 20:28:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118327742] [2025-04-13 20:28:30,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:30,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:28:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:30,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:28:30,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2025-04-13 20:28:30,515 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:30,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 1769 transitions, 35359 flow. Second operand has 30 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:30,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:30,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:30,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:33,887 INFO L116 PetriNetUnfolderBase]: 4508/8017 cut-off events. [2025-04-13 20:28:33,887 INFO L117 PetriNetUnfolderBase]: For 190021/190021 co-relation queries the response was YES. [2025-04-13 20:28:33,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75126 conditions, 8017 events. 4508/8017 cut-off events. For 190021/190021 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 59234 event pairs, 316 based on Foata normal form. 4/7997 useless extension candidates. Maximal degree in co-relation 74936. Up to 7646 conditions per place. [2025-04-13 20:28:33,979 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1752 selfloop transitions, 110 changer transitions 10/1872 dead transitions. [2025-04-13 20:28:33,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 1872 transitions, 40306 flow [2025-04-13 20:28:33,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 20:28:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-13 20:28:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 233 transitions. [2025-04-13 20:28:33,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29197994987468673 [2025-04-13 20:28:33,980 INFO L175 Difference]: Start difference. First operand has 654 places, 1769 transitions, 35359 flow. Second operand 38 states and 233 transitions. [2025-04-13 20:28:33,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 1872 transitions, 40306 flow [2025-04-13 20:28:36,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 1872 transitions, 39679 flow, removed 245 selfloop flow, removed 24 redundant places. [2025-04-13 20:28:36,526 INFO L231 Difference]: Finished difference. Result has 673 places, 1803 transitions, 35908 flow [2025-04-13 20:28:36,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=34749, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=35908, PETRI_PLACES=673, PETRI_TRANSITIONS=1803} [2025-04-13 20:28:36,528 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 652 predicate places. [2025-04-13 20:28:36,528 INFO L485 AbstractCegarLoop]: Abstraction has has 673 places, 1803 transitions, 35908 flow [2025-04-13 20:28:36,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:28:36,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:36,531 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:36,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 20:28:36,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 20:28:36,732 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-13 20:28:36,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2117628763, now seen corresponding path program 4 times [2025-04-13 20:28:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:36,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695468404] [2025-04-13 20:28:36,733 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:28:36,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:36,735 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:36,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:36,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:28:36,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:36,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695468404] [2025-04-13 20:28:36,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695468404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:36,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018593858] [2025-04-13 20:28:36,828 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:28:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:36,829 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-13 20:28:36,830 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-13 20:28:36,850 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:36,858 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:36,858 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:28:36,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:36,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:28:36,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:36,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:37,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018593858] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:37,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2025-04-13 20:28:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148354000] [2025-04-13 20:28:37,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:37,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:28:37,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:37,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:28:37,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:28:37,158 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:37,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 1803 transitions, 35908 flow. Second operand has 31 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 31 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-13 20:28:37,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:37,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:37,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:40,427 INFO L116 PetriNetUnfolderBase]: 4502/7992 cut-off events. [2025-04-13 20:28:40,427 INFO L117 PetriNetUnfolderBase]: For 195856/195856 co-relation queries the response was YES. [2025-04-13 20:28:40,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75076 conditions, 7992 events. 4502/7992 cut-off events. For 195856/195856 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 58863 event pairs, 324 based on Foata normal form. 3/7973 useless extension candidates. Maximal degree in co-relation 74880. Up to 7720 conditions per place. [2025-04-13 20:28:40,537 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1764 selfloop transitions, 86 changer transitions 15/1865 dead transitions. [2025-04-13 20:28:40,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 1865 transitions, 40130 flow [2025-04-13 20:28:40,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:28:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:28:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 196 transitions. [2025-04-13 20:28:40,538 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2025-04-13 20:28:40,538 INFO L175 Difference]: Start difference. First operand has 673 places, 1803 transitions, 35908 flow. Second operand 31 states and 196 transitions. [2025-04-13 20:28:40,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 1865 transitions, 40130 flow [2025-04-13 20:28:43,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 1865 transitions, 39417 flow, removed 308 selfloop flow, removed 16 redundant places. [2025-04-13 20:28:43,204 INFO L231 Difference]: Finished difference. Result has 688 places, 1807 transitions, 35638 flow [2025-04-13 20:28:43,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=35345, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=35638, PETRI_PLACES=688, PETRI_TRANSITIONS=1807} [2025-04-13 20:28:43,205 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 667 predicate places. [2025-04-13 20:28:43,205 INFO L485 AbstractCegarLoop]: Abstraction has has 688 places, 1807 transitions, 35638 flow [2025-04-13 20:28:43,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 31 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-13 20:28:43,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:43,205 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:43,212 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-13 20:28:43,406 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,SelfDestructingSolverStorable48 [2025-04-13 20:28:43,406 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-13 20:28:43,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1503705424, now seen corresponding path program 26 times [2025-04-13 20:28:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:43,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835581034] [2025-04-13 20:28:43,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:28:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:43,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:43,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:43,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:43,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:43,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:43,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835581034] [2025-04-13 20:28:43,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835581034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:43,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191000869] [2025-04-13 20:28:43,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:28:43,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:43,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:43,519 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-13 20:28:43,520 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-13 20:28:43,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:43,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:43,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:43,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:43,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:28:43,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:43,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191000869] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:43,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:43,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-04-13 20:28:43,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809573930] [2025-04-13 20:28:43,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:43,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:28:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:43,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:28:43,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2025-04-13 20:28:43,806 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:43,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 1807 transitions, 35638 flow. Second operand has 30 states, 30 states have (on average 3.5) internal successors, (105), 30 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-13 20:28:43,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:43,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:43,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:46,899 INFO L116 PetriNetUnfolderBase]: 4556/8089 cut-off events. [2025-04-13 20:28:46,900 INFO L117 PetriNetUnfolderBase]: For 177500/177500 co-relation queries the response was YES. [2025-04-13 20:28:46,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74816 conditions, 8089 events. 4556/8089 cut-off events. For 177500/177500 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 59740 event pairs, 323 based on Foata normal form. 7/8074 useless extension candidates. Maximal degree in co-relation 74616. Up to 7477 conditions per place. [2025-04-13 20:28:46,999 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1628 selfloop transitions, 148 changer transitions 124/1900 dead transitions. [2025-04-13 20:28:46,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 1900 transitions, 40786 flow [2025-04-13 20:28:46,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:28:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:28:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 162 transitions. [2025-04-13 20:28:47,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2755102040816326 [2025-04-13 20:28:47,000 INFO L175 Difference]: Start difference. First operand has 688 places, 1807 transitions, 35638 flow. Second operand 28 states and 162 transitions. [2025-04-13 20:28:47,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 1900 transitions, 40786 flow [2025-04-13 20:28:49,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 1900 transitions, 40633 flow, removed 25 selfloop flow, removed 20 redundant places. [2025-04-13 20:28:49,666 INFO L231 Difference]: Finished difference. Result has 694 places, 1755 transitions, 34702 flow [2025-04-13 20:28:49,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=35480, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=34702, PETRI_PLACES=694, PETRI_TRANSITIONS=1755} [2025-04-13 20:28:49,668 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 673 predicate places. [2025-04-13 20:28:49,668 INFO L485 AbstractCegarLoop]: Abstraction has has 694 places, 1755 transitions, 34702 flow [2025-04-13 20:28:49,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.5) internal successors, (105), 30 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-13 20:28:49,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:49,668 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:49,674 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-13 20:28:49,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 20:28:49,869 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-13 20:28:49,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1670992267, now seen corresponding path program 5 times [2025-04-13 20:28:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:49,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474053644] [2025-04-13 20:28:49,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:28:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:49,872 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:49,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:49,874 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:49,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:49,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474053644] [2025-04-13 20:28:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474053644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:49,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108188537] [2025-04-13 20:28:49,996 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:28:49,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:49,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:49,998 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-13 20:28:50,000 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-13 20:28:50,024 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:50,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:50,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:50,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:50,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:28:50,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:50,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:50,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108188537] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:50,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:50,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2025-04-13 20:28:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985090252] [2025-04-13 20:28:50,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:50,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:28:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:50,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:28:50,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:28:50,353 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:50,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 1755 transitions, 34702 flow. Second operand has 31 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 31 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-13 20:28:50,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:50,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:50,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:53,410 INFO L116 PetriNetUnfolderBase]: 4420/7816 cut-off events. [2025-04-13 20:28:53,410 INFO L117 PetriNetUnfolderBase]: For 186674/186674 co-relation queries the response was YES. [2025-04-13 20:28:53,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73066 conditions, 7816 events. 4420/7816 cut-off events. For 186674/186674 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 57078 event pairs, 311 based on Foata normal form. 3/7797 useless extension candidates. Maximal degree in co-relation 72860. Up to 7638 conditions per place. [2025-04-13 20:28:53,512 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1755 selfloop transitions, 51 changer transitions 12/1818 dead transitions. [2025-04-13 20:28:53,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 1818 transitions, 38879 flow [2025-04-13 20:28:53,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:28:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:28:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 174 transitions. [2025-04-13 20:28:53,513 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2672811059907834 [2025-04-13 20:28:53,513 INFO L175 Difference]: Start difference. First operand has 694 places, 1755 transitions, 34702 flow. Second operand 31 states and 174 transitions. [2025-04-13 20:28:53,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 1818 transitions, 38879 flow [2025-04-13 20:28:56,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 1818 transitions, 37883 flow, removed 439 selfloop flow, removed 22 redundant places. [2025-04-13 20:28:56,115 INFO L231 Difference]: Finished difference. Result has 682 places, 1765 transitions, 34079 flow [2025-04-13 20:28:56,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=33732, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=34079, PETRI_PLACES=682, PETRI_TRANSITIONS=1765} [2025-04-13 20:28:56,116 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 661 predicate places. [2025-04-13 20:28:56,116 INFO L485 AbstractCegarLoop]: Abstraction has has 682 places, 1765 transitions, 34079 flow [2025-04-13 20:28:56,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 31 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-13 20:28:56,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:56,117 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:56,122 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-13 20:28:56,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:56,317 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-13 20:28:56,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1674394207, now seen corresponding path program 6 times [2025-04-13 20:28:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:56,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059099409] [2025-04-13 20:28:56,318 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:28:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:56,320 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:56,321 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:56,322 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:28:56,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:56,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:56,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059099409] [2025-04-13 20:28:56,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059099409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:56,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541531144] [2025-04-13 20:28:56,431 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:28:56,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:56,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:56,433 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-13 20:28:56,434 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-13 20:28:56,454 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:28:56,461 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:28:56,461 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:28:56,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:56,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:28:56,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:56,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541531144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:56,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-04-13 20:28:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952471622] [2025-04-13 20:28:56,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:56,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:28:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:56,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:28:56,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:28:56,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:28:56,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 1765 transitions, 34079 flow. Second operand has 29 states, 29 states have (on average 3.5517241379310347) internal successors, (103), 29 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-13 20:28:56,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:56,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:28:56,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:59,932 INFO L116 PetriNetUnfolderBase]: 4413/7791 cut-off events. [2025-04-13 20:28:59,933 INFO L117 PetriNetUnfolderBase]: For 183301/183301 co-relation queries the response was YES. [2025-04-13 20:29:00,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71898 conditions, 7791 events. 4413/7791 cut-off events. For 183301/183301 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 56628 event pairs, 323 based on Foata normal form. 3/7772 useless extension candidates. Maximal degree in co-relation 71696. Up to 7638 conditions per place. [2025-04-13 20:29:00,052 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1743 selfloop transitions, 44 changer transitions 13/1800 dead transitions. [2025-04-13 20:29:00,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 1800 transitions, 37846 flow [2025-04-13 20:29:00,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 20:29:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 20:29:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 131 transitions. [2025-04-13 20:29:00,053 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28354978354978355 [2025-04-13 20:29:00,053 INFO L175 Difference]: Start difference. First operand has 682 places, 1765 transitions, 34079 flow. Second operand 22 states and 131 transitions. [2025-04-13 20:29:00,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 1800 transitions, 37846 flow [2025-04-13 20:29:02,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 1800 transitions, 37618 flow, removed 70 selfloop flow, removed 13 redundant places. [2025-04-13 20:29:02,611 INFO L231 Difference]: Finished difference. Result has 685 places, 1760 transitions, 33952 flow [2025-04-13 20:29:02,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=33839, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=33952, PETRI_PLACES=685, PETRI_TRANSITIONS=1760} [2025-04-13 20:29:02,612 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 664 predicate places. [2025-04-13 20:29:02,612 INFO L485 AbstractCegarLoop]: Abstraction has has 685 places, 1760 transitions, 33952 flow [2025-04-13 20:29:02,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.5517241379310347) internal successors, (103), 29 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-13 20:29:02,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:02,612 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:02,618 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-13 20:29:02,813 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,SelfDestructingSolverStorable51 [2025-04-13 20:29:02,813 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-13 20:29:02,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -249281630, now seen corresponding path program 10 times [2025-04-13 20:29:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:02,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594310546] [2025-04-13 20:29:02,814 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:29:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:02,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:29:02,817 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:29:02,817 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:29:02,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:29:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:02,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594310546] [2025-04-13 20:29:02,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594310546] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:02,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728440696] [2025-04-13 20:29:02,903 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:29:02,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:02,904 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-13 20:29:02,905 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-13 20:29:02,926 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:29:02,935 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:29:02,935 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:29:02,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:02,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:29:02,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:03,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728440696] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:03,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 33 [2025-04-13 20:29:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001469105] [2025-04-13 20:29:03,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:03,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:29:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:03,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:29:03,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:29:03,325 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:29:03,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 1760 transitions, 33952 flow. Second operand has 35 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 35 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-13 20:29:03,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:03,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:29:03,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:09,312 INFO L116 PetriNetUnfolderBase]: 7049/12081 cut-off events. [2025-04-13 20:29:09,313 INFO L117 PetriNetUnfolderBase]: For 373511/373511 co-relation queries the response was YES. [2025-04-13 20:29:09,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118769 conditions, 12081 events. 7049/12081 cut-off events. For 373511/373511 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 87419 event pairs, 117 based on Foata normal form. 2/12055 useless extension candidates. Maximal degree in co-relation 118565. Up to 3282 conditions per place. [2025-04-13 20:29:09,475 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 712 selfloop transitions, 2061 changer transitions 8/2781 dead transitions. [2025-04-13 20:29:09,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 2781 transitions, 58102 flow [2025-04-13 20:29:09,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:29:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:29:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 369 transitions. [2025-04-13 20:29:09,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2025-04-13 20:29:09,476 INFO L175 Difference]: Start difference. First operand has 685 places, 1760 transitions, 33952 flow. Second operand 48 states and 369 transitions. [2025-04-13 20:29:09,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 2781 transitions, 58102 flow [2025-04-13 20:29:13,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 2781 transitions, 57870 flow, removed 82 selfloop flow, removed 15 redundant places. [2025-04-13 20:29:13,892 INFO L231 Difference]: Finished difference. Result has 718 places, 2461 transitions, 55252 flow [2025-04-13 20:29:13,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=33800, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=55252, PETRI_PLACES=718, PETRI_TRANSITIONS=2461} [2025-04-13 20:29:13,893 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 697 predicate places. [2025-04-13 20:29:13,893 INFO L485 AbstractCegarLoop]: Abstraction has has 718 places, 2461 transitions, 55252 flow [2025-04-13 20:29:13,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 35 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-13 20:29:13,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:13,893 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:13,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 20:29:14,094 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,SelfDestructingSolverStorable52 [2025-04-13 20:29:14,094 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-13 20:29:14,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash -248647370, now seen corresponding path program 11 times [2025-04-13 20:29:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:14,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756354412] [2025-04-13 20:29:14,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:29:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:14,097 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 5 equivalence classes. [2025-04-13 20:29:14,099 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:29:14,099 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 20:29:14,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:29:14,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:14,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756354412] [2025-04-13 20:29:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756354412] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:14,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603466125] [2025-04-13 20:29:14,191 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:29:14,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:14,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:14,192 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-13 20:29:14,194 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-13 20:29:14,213 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 5 equivalence classes. [2025-04-13 20:29:14,221 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:29:14,222 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 20:29:14,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:14,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:29:14,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:14,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603466125] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:14,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:14,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 33 [2025-04-13 20:29:14,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498931064] [2025-04-13 20:29:14,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:14,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:29:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:14,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:29:14,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:29:14,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:29:14,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 2461 transitions, 55252 flow. Second operand has 35 states, 35 states have (on average 3.5142857142857142) internal successors, (123), 35 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-13 20:29:14,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:14,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:29:14,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:24,436 INFO L116 PetriNetUnfolderBase]: 9231/15570 cut-off events. [2025-04-13 20:29:24,436 INFO L117 PetriNetUnfolderBase]: For 527178/527178 co-relation queries the response was YES. [2025-04-13 20:29:24,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168873 conditions, 15570 events. 9231/15570 cut-off events. For 527178/527178 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 112943 event pairs, 218 based on Foata normal form. 2/15568 useless extension candidates. Maximal degree in co-relation 168663. Up to 4683 conditions per place. [2025-04-13 20:29:24,665 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1731 selfloop transitions, 1965 changer transitions 12/3708 dead transitions. [2025-04-13 20:29:24,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 3708 transitions, 86038 flow [2025-04-13 20:29:24,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-04-13 20:29:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2025-04-13 20:29:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 673 transitions. [2025-04-13 20:29:24,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3521716378859236 [2025-04-13 20:29:24,667 INFO L175 Difference]: Start difference. First operand has 718 places, 2461 transitions, 55252 flow. Second operand 91 states and 673 transitions. [2025-04-13 20:29:24,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 806 places, 3708 transitions, 86038 flow [2025-04-13 20:29:35,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 3708 transitions, 83680 flow, removed 960 selfloop flow, removed 26 redundant places. [2025-04-13 20:29:35,988 INFO L231 Difference]: Finished difference. Result has 798 places, 3015 transitions, 71648 flow [2025-04-13 20:29:35,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=53700, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=71648, PETRI_PLACES=798, PETRI_TRANSITIONS=3015} [2025-04-13 20:29:35,991 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 777 predicate places. [2025-04-13 20:29:35,991 INFO L485 AbstractCegarLoop]: Abstraction has has 798 places, 3015 transitions, 71648 flow [2025-04-13 20:29:35,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.5142857142857142) internal successors, (123), 35 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-13 20:29:35,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:35,991 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:35,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-04-13 20:29:36,191 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,SelfDestructingSolverStorable53 [2025-04-13 20:29:36,192 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-13 20:29:36,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 64905733, now seen corresponding path program 7 times [2025-04-13 20:29:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:36,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130942572] [2025-04-13 20:29:36,192 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:29:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:36,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:29:36,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:29:36,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:29:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:36,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:36,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130942572] [2025-04-13 20:29:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130942572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:36,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664016155] [2025-04-13 20:29:36,223 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:29:36,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:36,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:36,225 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-13 20:29:36,226 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-13 20:29:36,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:29:36,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:29:36,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:29:36,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:36,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:29:36,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:36,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664016155] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:36,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:36,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-04-13 20:29:36,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004445400] [2025-04-13 20:29:36,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:36,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:29:36,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:36,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:29:36,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:29:36,307 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:29:36,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 3015 transitions, 71648 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:29:36,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:36,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:29:36,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:46,119 INFO L116 PetriNetUnfolderBase]: 10488/17732 cut-off events. [2025-04-13 20:29:46,119 INFO L117 PetriNetUnfolderBase]: For 745994/745994 co-relation queries the response was YES. [2025-04-13 20:29:46,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203457 conditions, 17732 events. 10488/17732 cut-off events. For 745994/745994 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 130377 event pairs, 699 based on Foata normal form. 259/17981 useless extension candidates. Maximal degree in co-relation 203234. Up to 11792 conditions per place. [2025-04-13 20:29:46,381 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 2859 selfloop transitions, 422 changer transitions 23/3304 dead transitions. [2025-04-13 20:29:46,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 794 places, 3304 transitions, 84588 flow [2025-04-13 20:29:46,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:29:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:29:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-13 20:29:46,382 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-04-13 20:29:46,382 INFO L175 Difference]: Start difference. First operand has 798 places, 3015 transitions, 71648 flow. Second operand 6 states and 68 transitions. [2025-04-13 20:29:46,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 794 places, 3304 transitions, 84588 flow [2025-04-13 20:29:59,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 3304 transitions, 81620 flow, removed 658 selfloop flow, removed 47 redundant places. [2025-04-13 20:29:59,488 INFO L231 Difference]: Finished difference. Result has 750 places, 3019 transitions, 70698 flow [2025-04-13 20:29:59,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=66632, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70698, PETRI_PLACES=750, PETRI_TRANSITIONS=3019} [2025-04-13 20:29:59,490 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 729 predicate places. [2025-04-13 20:29:59,490 INFO L485 AbstractCegarLoop]: Abstraction has has 750 places, 3019 transitions, 70698 flow [2025-04-13 20:29:59,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:29:59,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:59,490 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:59,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-04-13 20:29:59,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:59,691 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-13 20:29:59,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash -504360396, now seen corresponding path program 8 times [2025-04-13 20:29:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:59,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122526008] [2025-04-13 20:29:59,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:29:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:59,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:29:59,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:29:59,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:29:59,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:59,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:59,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122526008] [2025-04-13 20:29:59,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122526008] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:59,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592057967] [2025-04-13 20:29:59,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:29:59,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:59,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:59,804 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-13 20:29:59,804 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-13 20:29:59,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:29:59,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:29:59,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:29:59,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:59,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:29:59,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:59,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:00,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592057967] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:00,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 20:30:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074404267] [2025-04-13 20:30:00,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:00,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:30:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:00,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:30:00,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:30:00,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:30:00,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 3019 transitions, 70698 flow. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 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-13 20:30:00,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:00,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:30:00,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:10,086 INFO L116 PetriNetUnfolderBase]: 10454/17644 cut-off events. [2025-04-13 20:30:10,087 INFO L117 PetriNetUnfolderBase]: For 727294/727294 co-relation queries the response was YES. [2025-04-13 20:30:10,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202254 conditions, 17644 events. 10454/17644 cut-off events. For 727294/727294 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 129584 event pairs, 1051 based on Foata normal form. 3/17637 useless extension candidates. Maximal degree in co-relation 202033. Up to 16035 conditions per place. [2025-04-13 20:30:10,374 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 2521 selfloop transitions, 522 changer transitions 48/3091 dead transitions. [2025-04-13 20:30:10,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 3091 transitions, 77319 flow [2025-04-13 20:30:10,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 20:30:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 20:30:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 185 transitions. [2025-04-13 20:30:10,375 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2025-04-13 20:30:10,375 INFO L175 Difference]: Start difference. First operand has 750 places, 3019 transitions, 70698 flow. Second operand 25 states and 185 transitions. [2025-04-13 20:30:10,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 756 places, 3091 transitions, 77319 flow [2025-04-13 20:30:22,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 3091 transitions, 76657 flow, removed 187 selfloop flow, removed 12 redundant places. [2025-04-13 20:30:22,414 INFO L231 Difference]: Finished difference. Result has 749 places, 3009 transitions, 70912 flow [2025-04-13 20:30:22,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=70074, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=522, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=70912, PETRI_PLACES=749, PETRI_TRANSITIONS=3009} [2025-04-13 20:30:22,416 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 728 predicate places. [2025-04-13 20:30:22,416 INFO L485 AbstractCegarLoop]: Abstraction has has 749 places, 3009 transitions, 70912 flow [2025-04-13 20:30:22,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 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-13 20:30:22,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:22,416 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:22,422 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-13 20:30:22,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:22,616 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-13 20:30:22,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -865860744, now seen corresponding path program 9 times [2025-04-13 20:30:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:22,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382329648] [2025-04-13 20:30:22,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:30:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:22,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:30:22,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:22,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:30:22,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:22,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382329648] [2025-04-13 20:30:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382329648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:22,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477843352] [2025-04-13 20:30:22,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:30:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:22,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:22,807 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-13 20:30:22,810 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-13 20:30:22,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:30:22,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:22,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:30:22,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:22,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:30:22,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:23,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477843352] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:23,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-13 20:30:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225705200] [2025-04-13 20:30:23,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:23,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:30:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:23,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:30:23,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:30:23,137 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:30:23,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 3009 transitions, 70912 flow. Second operand has 32 states, 32 states have (on average 3.375) internal successors, (108), 32 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-13 20:30:23,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:23,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:30:23,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:32,907 INFO L116 PetriNetUnfolderBase]: 10416/17564 cut-off events. [2025-04-13 20:30:32,908 INFO L117 PetriNetUnfolderBase]: For 649087/649087 co-relation queries the response was YES. [2025-04-13 20:30:33,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197531 conditions, 17564 events. 10416/17564 cut-off events. For 649087/649087 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 128771 event pairs, 1034 based on Foata normal form. 3/17557 useless extension candidates. Maximal degree in co-relation 197311. Up to 16012 conditions per place. [2025-04-13 20:30:33,167 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 2516 selfloop transitions, 519 changer transitions 44/3079 dead transitions. [2025-04-13 20:30:33,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 3079 transitions, 77451 flow [2025-04-13 20:30:33,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:30:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:30:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 197 transitions. [2025-04-13 20:30:33,169 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33503401360544216 [2025-04-13 20:30:33,169 INFO L175 Difference]: Start difference. First operand has 749 places, 3009 transitions, 70912 flow. Second operand 28 states and 197 transitions. [2025-04-13 20:30:33,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 761 places, 3079 transitions, 77451 flow [2025-04-13 20:30:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 745 places, 3079 transitions, 76712 flow, removed 20 selfloop flow, removed 16 redundant places. [2025-04-13 20:30:44,423 INFO L231 Difference]: Finished difference. Result has 750 places, 2999 transitions, 71023 flow [2025-04-13 20:30:44,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=70195, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3009, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=519, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=71023, PETRI_PLACES=750, PETRI_TRANSITIONS=2999} [2025-04-13 20:30:44,426 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 729 predicate places. [2025-04-13 20:30:44,426 INFO L485 AbstractCegarLoop]: Abstraction has has 750 places, 2999 transitions, 71023 flow [2025-04-13 20:30:44,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.375) internal successors, (108), 32 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-13 20:30:44,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:44,426 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:44,432 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-13 20:30:44,630 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,SelfDestructingSolverStorable56 [2025-04-13 20:30:44,630 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-13 20:30:44,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:44,630 INFO L85 PathProgramCache]: Analyzing trace with hash -155623346, now seen corresponding path program 10 times [2025-04-13 20:30:44,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:44,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838976046] [2025-04-13 20:30:44,631 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:30:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:44,635 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:44,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:44,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:30:44,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:44,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:44,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838976046] [2025-04-13 20:30:44,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838976046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:44,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996450669] [2025-04-13 20:30:44,789 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:30:44,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:44,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:44,791 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-13 20:30:44,792 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-13 20:30:44,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:44,824 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:44,824 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:30:44,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:44,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:30:44,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:44,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:45,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996450669] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:45,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:45,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 29 [2025-04-13 20:30:45,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735971756] [2025-04-13 20:30:45,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:45,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:30:45,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:45,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:30:45,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:30:45,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:30:45,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 2999 transitions, 71023 flow. Second operand has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 31 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:45,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:45,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:30:45,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:56,250 INFO L116 PetriNetUnfolderBase]: 10544/17781 cut-off events. [2025-04-13 20:30:56,250 INFO L117 PetriNetUnfolderBase]: For 666258/666258 co-relation queries the response was YES. [2025-04-13 20:30:56,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199981 conditions, 17781 events. 10544/17781 cut-off events. For 666258/666258 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 130764 event pairs, 1052 based on Foata normal form. 6/17777 useless extension candidates. Maximal degree in co-relation 199762. Up to 15912 conditions per place. [2025-04-13 20:30:56,671 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 2504 selfloop transitions, 658 changer transitions 11/3173 dead transitions. [2025-04-13 20:30:56,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 3173 transitions, 79564 flow [2025-04-13 20:30:56,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 20:30:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-13 20:30:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 282 transitions. [2025-04-13 20:30:56,672 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3197278911564626 [2025-04-13 20:30:56,672 INFO L175 Difference]: Start difference. First operand has 750 places, 2999 transitions, 71023 flow. Second operand 42 states and 282 transitions. [2025-04-13 20:30:56,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 3173 transitions, 79564 flow [2025-04-13 20:31:08,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 750 places, 3173 transitions, 78002 flow, removed 30 selfloop flow, removed 27 redundant places. [2025-04-13 20:31:08,397 INFO L231 Difference]: Finished difference. Result has 760 places, 3092 transitions, 73053 flow [2025-04-13 20:31:08,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=69539, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=586, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=73053, PETRI_PLACES=760, PETRI_TRANSITIONS=3092} [2025-04-13 20:31:08,399 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 739 predicate places. [2025-04-13 20:31:08,399 INFO L485 AbstractCegarLoop]: Abstraction has has 760 places, 3092 transitions, 73053 flow [2025-04-13 20:31:08,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 31 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:08,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:08,399 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:08,406 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-13 20:31:08,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 20:31:08,600 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-13 20:31:08,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash -79530192, now seen corresponding path program 11 times [2025-04-13 20:31:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:08,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253919549] [2025-04-13 20:31:08,601 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:08,605 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:31:08,608 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:08,608 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:31:08,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:08,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:08,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253919549] [2025-04-13 20:31:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253919549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:08,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664796369] [2025-04-13 20:31:08,763 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:08,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:08,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:08,764 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-13 20:31:08,765 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-13 20:31:08,787 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:31:08,796 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:08,796 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:31:08,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:08,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:31:08,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:08,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664796369] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:09,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 30 [2025-04-13 20:31:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023328407] [2025-04-13 20:31:09,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:09,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:31:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:09,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:31:09,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:31:09,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:31:09,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 760 places, 3092 transitions, 73053 flow. Second operand has 32 states, 32 states have (on average 3.34375) internal successors, (107), 32 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-13 20:31:09,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:09,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:31:09,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:19,921 INFO L116 PetriNetUnfolderBase]: 10623/17913 cut-off events. [2025-04-13 20:31:19,921 INFO L117 PetriNetUnfolderBase]: For 631688/631688 co-relation queries the response was YES. [2025-04-13 20:31:20,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200038 conditions, 17913 events. 10623/17913 cut-off events. For 631688/631688 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 131882 event pairs, 1073 based on Foata normal form. 3/17906 useless extension candidates. Maximal degree in co-relation 199815. Up to 15862 conditions per place. [2025-04-13 20:31:20,435 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 2494 selfloop transitions, 724 changer transitions 12/3230 dead transitions. [2025-04-13 20:31:20,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 804 places, 3230 transitions, 81255 flow [2025-04-13 20:31:20,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 20:31:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-04-13 20:31:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 302 transitions. [2025-04-13 20:31:20,436 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3059777102330294 [2025-04-13 20:31:20,436 INFO L175 Difference]: Start difference. First operand has 760 places, 3092 transitions, 73053 flow. Second operand 47 states and 302 transitions. [2025-04-13 20:31:20,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 804 places, 3230 transitions, 81255 flow [2025-04-13 20:31:32,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 783 places, 3230 transitions, 79990 flow, removed 273 selfloop flow, removed 21 redundant places. [2025-04-13 20:31:32,695 INFO L231 Difference]: Finished difference. Result has 790 places, 3146 transitions, 74990 flow [2025-04-13 20:31:32,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=71802, PETRI_DIFFERENCE_MINUEND_PLACES=737, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3092, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=677, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=74990, PETRI_PLACES=790, PETRI_TRANSITIONS=3146} [2025-04-13 20:31:32,698 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 769 predicate places. [2025-04-13 20:31:32,698 INFO L485 AbstractCegarLoop]: Abstraction has has 790 places, 3146 transitions, 74990 flow [2025-04-13 20:31:32,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.34375) internal successors, (107), 32 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-13 20:31:32,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:32,698 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:32,703 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-13 20:31:32,898 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,SelfDestructingSolverStorable58 [2025-04-13 20:31:32,899 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-13 20:31:32,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash -156217992, now seen corresponding path program 12 times [2025-04-13 20:31:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:32,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114654658] [2025-04-13 20:31:32,899 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:32,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:32,902 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:31:32,905 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:32,905 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:31:32,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:33,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:33,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114654658] [2025-04-13 20:31:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114654658] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:33,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418727201] [2025-04-13 20:31:33,045 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:33,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:33,047 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-13 20:31:33,049 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-13 20:31:33,071 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:31:33,081 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:33,081 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:31:33,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:33,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:31:33,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:33,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418727201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:33,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-13 20:31:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324947515] [2025-04-13 20:31:33,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:33,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:31:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:33,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:31:33,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:31:33,357 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:31:33,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 790 places, 3146 transitions, 74990 flow. Second operand has 32 states, 32 states have (on average 3.375) internal successors, (108), 32 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-13 20:31:33,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:33,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:31:33,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:44,665 INFO L116 PetriNetUnfolderBase]: 11031/18592 cut-off events. [2025-04-13 20:31:44,665 INFO L117 PetriNetUnfolderBase]: For 709613/709613 co-relation queries the response was YES. [2025-04-13 20:31:44,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211399 conditions, 18592 events. 11031/18592 cut-off events. For 709613/709613 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 137842 event pairs, 1039 based on Foata normal form. 10/18592 useless extension candidates. Maximal degree in co-relation 211173. Up to 15500 conditions per place. [2025-04-13 20:31:44,995 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 2451 selfloop transitions, 928 changer transitions 13/3392 dead transitions. [2025-04-13 20:31:44,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 3392 transitions, 86109 flow [2025-04-13 20:31:44,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 20:31:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-13 20:31:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 260 transitions. [2025-04-13 20:31:44,996 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-04-13 20:31:44,996 INFO L175 Difference]: Start difference. First operand has 790 places, 3146 transitions, 74990 flow. Second operand 40 states and 260 transitions. [2025-04-13 20:31:44,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 827 places, 3392 transitions, 86109 flow [2025-04-13 20:31:58,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 796 places, 3392 transitions, 84767 flow, removed 264 selfloop flow, removed 31 redundant places. [2025-04-13 20:31:58,424 INFO L231 Difference]: Finished difference. Result has 801 places, 3288 transitions, 79660 flow [2025-04-13 20:31:58,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=73710, PETRI_DIFFERENCE_MINUEND_PLACES=757, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=816, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=79660, PETRI_PLACES=801, PETRI_TRANSITIONS=3288} [2025-04-13 20:31:58,426 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 780 predicate places. [2025-04-13 20:31:58,426 INFO L485 AbstractCegarLoop]: Abstraction has has 801 places, 3288 transitions, 79660 flow [2025-04-13 20:31:58,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.375) internal successors, (108), 32 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-13 20:31:58,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:58,426 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:58,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 20:31:58,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:58,631 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-13 20:31:58,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1939615179, now seen corresponding path program 27 times [2025-04-13 20:31:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:58,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022081635] [2025-04-13 20:31:58,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:58,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:31:58,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:58,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:31:58,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:58,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:58,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022081635] [2025-04-13 20:31:58,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022081635] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:58,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013480777] [2025-04-13 20:31:58,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:58,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:58,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:58,777 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-13 20:31:58,779 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-13 20:31:58,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:31:58,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:58,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:31:58,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:58,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:31:58,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:59,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:31:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013480777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:59,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 28 [2025-04-13 20:31:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3184397] [2025-04-13 20:31:59,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:59,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:31:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:59,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:31:59,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-04-13 20:31:59,116 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:31:59,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 801 places, 3288 transitions, 79660 flow. Second operand has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 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-13 20:31:59,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:59,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:31:59,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:12,126 INFO L116 PetriNetUnfolderBase]: 11632/19634 cut-off events. [2025-04-13 20:32:12,126 INFO L117 PetriNetUnfolderBase]: For 829322/829322 co-relation queries the response was YES. [2025-04-13 20:32:12,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230858 conditions, 19634 events. 11632/19634 cut-off events. For 829322/829322 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 147349 event pairs, 1097 based on Foata normal form. 23/19647 useless extension candidates. Maximal degree in co-relation 230628. Up to 14974 conditions per place. [2025-04-13 20:32:12,422 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 1941 selfloop transitions, 1711 changer transitions 65/3717 dead transitions. [2025-04-13 20:32:12,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 848 places, 3717 transitions, 95991 flow [2025-04-13 20:32:12,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 20:32:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-13 20:32:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 298 transitions. [2025-04-13 20:32:12,423 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2838095238095238 [2025-04-13 20:32:12,423 INFO L175 Difference]: Start difference. First operand has 801 places, 3288 transitions, 79660 flow. Second operand 50 states and 298 transitions. [2025-04-13 20:32:12,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 848 places, 3717 transitions, 95991 flow [2025-04-13 20:32:28,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 824 places, 3717 transitions, 93961 flow, removed 688 selfloop flow, removed 24 redundant places. [2025-04-13 20:32:28,639 INFO L231 Difference]: Finished difference. Result has 839 places, 3573 transitions, 90491 flow [2025-04-13 20:32:28,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=77635, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1480, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=90491, PETRI_PLACES=839, PETRI_TRANSITIONS=3573} [2025-04-13 20:32:28,642 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 818 predicate places. [2025-04-13 20:32:28,642 INFO L485 AbstractCegarLoop]: Abstraction has has 839 places, 3573 transitions, 90491 flow [2025-04-13 20:32:28,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 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-13 20:32:28,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:28,642 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:28,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2025-04-13 20:32:28,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:28,843 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-13 20:32:28,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1421123738, now seen corresponding path program 13 times [2025-04-13 20:32:28,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:28,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243032333] [2025-04-13 20:32:28,844 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:32:28,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:28,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:32:28,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:32:28,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:28,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:32:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:28,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243032333] [2025-04-13 20:32:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243032333] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:28,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795095699] [2025-04-13 20:32:28,972 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:32:28,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:28,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:28,974 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-13 20:32:28,975 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-13 20:32:28,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:32:29,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:32:29,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:29,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:29,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:32:29,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:32:29,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:29,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795095699] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:32:29,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:32:29,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 27 [2025-04-13 20:32:29,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638011638] [2025-04-13 20:32:29,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:32:29,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:32:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:29,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:32:29,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:32:29,297 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:32:29,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 3573 transitions, 90491 flow. Second operand has 29 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:29,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:29,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:32:29,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:43,266 INFO L116 PetriNetUnfolderBase]: 11685/19716 cut-off events. [2025-04-13 20:32:43,266 INFO L117 PetriNetUnfolderBase]: For 882304/882304 co-relation queries the response was YES. [2025-04-13 20:32:43,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239481 conditions, 19716 events. 11685/19716 cut-off events. For 882304/882304 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 147991 event pairs, 1049 based on Foata normal form. 5/19711 useless extension candidates. Maximal degree in co-relation 239237. Up to 18556 conditions per place. [2025-04-13 20:32:43,590 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3117 selfloop transitions, 577 changer transitions 24/3718 dead transitions. [2025-04-13 20:32:43,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 873 places, 3718 transitions, 100156 flow [2025-04-13 20:32:43,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 20:32:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-13 20:32:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 245 transitions. [2025-04-13 20:32:43,592 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3153153153153153 [2025-04-13 20:32:43,592 INFO L175 Difference]: Start difference. First operand has 839 places, 3573 transitions, 90491 flow. Second operand 37 states and 245 transitions. [2025-04-13 20:32:43,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 873 places, 3718 transitions, 100156 flow [2025-04-13 20:33:03,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 840 places, 3718 transitions, 97991 flow, removed 750 selfloop flow, removed 33 redundant places. [2025-04-13 20:33:03,335 INFO L231 Difference]: Finished difference. Result has 848 places, 3637 transitions, 91250 flow [2025-04-13 20:33:03,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=88326, PETRI_DIFFERENCE_MINUEND_PLACES=804, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=529, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3020, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=91250, PETRI_PLACES=848, PETRI_TRANSITIONS=3637} [2025-04-13 20:33:03,337 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 827 predicate places. [2025-04-13 20:33:03,337 INFO L485 AbstractCegarLoop]: Abstraction has has 848 places, 3637 transitions, 91250 flow [2025-04-13 20:33:03,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:03,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:03,337 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:03,343 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-13 20:33:03,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:03,537 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-13 20:33:03,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1497811538, now seen corresponding path program 14 times [2025-04-13 20:33:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:03,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408316946] [2025-04-13 20:33:03,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:03,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:33:03,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:33:03,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:03,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:03,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408316946] [2025-04-13 20:33:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408316946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:03,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265827801] [2025-04-13 20:33:03,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:03,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:03,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:03,679 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-13 20:33:03,680 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-13 20:33:03,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:33:03,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:33:03,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:03,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:03,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:33:03,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:03,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:03,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265827801] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:03,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:03,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 27 [2025-04-13 20:33:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037192984] [2025-04-13 20:33:03,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:03,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:33:03,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:03,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:33:03,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:33:03,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:33:03,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 848 places, 3637 transitions, 91250 flow. Second operand has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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-13 20:33:03,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:03,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:33:03,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:18,359 INFO L116 PetriNetUnfolderBase]: 11803/19948 cut-off events. [2025-04-13 20:33:18,359 INFO L117 PetriNetUnfolderBase]: For 877170/877170 co-relation queries the response was YES. [2025-04-13 20:33:18,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238787 conditions, 19948 events. 11803/19948 cut-off events. For 877170/877170 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 150582 event pairs, 1004 based on Foata normal form. 4/19942 useless extension candidates. Maximal degree in co-relation 238542. Up to 18386 conditions per place. [2025-04-13 20:33:18,692 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3099 selfloop transitions, 670 changer transitions 12/3781 dead transitions. [2025-04-13 20:33:18,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 890 places, 3781 transitions, 101344 flow [2025-04-13 20:33:18,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:33:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:33:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 307 transitions. [2025-04-13 20:33:18,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30456349206349204 [2025-04-13 20:33:18,693 INFO L175 Difference]: Start difference. First operand has 848 places, 3637 transitions, 91250 flow. Second operand 48 states and 307 transitions. [2025-04-13 20:33:18,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 890 places, 3781 transitions, 101344 flow [2025-04-13 20:33:34,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 866 places, 3781 transitions, 99908 flow, removed 369 selfloop flow, removed 24 redundant places. [2025-04-13 20:33:34,953 INFO L231 Difference]: Finished difference. Result has 875 places, 3692 transitions, 93218 flow [2025-04-13 20:33:34,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=89940, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=624, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=93218, PETRI_PLACES=875, PETRI_TRANSITIONS=3692} [2025-04-13 20:33:34,955 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 854 predicate places. [2025-04-13 20:33:34,955 INFO L485 AbstractCegarLoop]: Abstraction has has 875 places, 3692 transitions, 93218 flow [2025-04-13 20:33:34,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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-13 20:33:34,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:34,955 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:34,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2025-04-13 20:33:35,156 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,SelfDestructingSolverStorable62 [2025-04-13 20:33:35,156 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-13 20:33:35,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1101401556, now seen corresponding path program 15 times [2025-04-13 20:33:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:35,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552861069] [2025-04-13 20:33:35,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:33:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:35,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:33:35,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:33:35,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:33:35,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:35,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552861069] [2025-04-13 20:33:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552861069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:35,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259587063] [2025-04-13 20:33:35,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:33:35,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:35,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:35,279 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-13 20:33:35,280 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-13 20:33:35,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:33:35,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:33:35,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:33:35,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:35,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:33:35,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:35,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:35,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259587063] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:35,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:35,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-04-13 20:33:35,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178393958] [2025-04-13 20:33:35,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:35,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:33:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:35,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:33:35,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:33:35,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:33:35,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 3692 transitions, 93218 flow. Second operand has 36 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 36 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-13 20:33:35,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:35,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:33:35,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:52,020 INFO L116 PetriNetUnfolderBase]: 12508/21322 cut-off events. [2025-04-13 20:33:52,020 INFO L117 PetriNetUnfolderBase]: For 1232572/1232572 co-relation queries the response was YES. [2025-04-13 20:33:52,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266375 conditions, 21322 events. 12508/21322 cut-off events. For 1232572/1232572 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 164781 event pairs, 865 based on Foata normal form. 7/21319 useless extension candidates. Maximal degree in co-relation 266125. Up to 17591 conditions per place. [2025-04-13 20:33:52,442 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3340 selfloop transitions, 828 changer transitions 18/4186 dead transitions. [2025-04-13 20:33:52,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 4186 transitions, 112422 flow [2025-04-13 20:33:52,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 20:33:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-04-13 20:33:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 442 transitions. [2025-04-13 20:33:52,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3006802721088435 [2025-04-13 20:33:52,443 INFO L175 Difference]: Start difference. First operand has 875 places, 3692 transitions, 93218 flow. Second operand 70 states and 442 transitions. [2025-04-13 20:33:52,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 4186 transitions, 112422 flow [2025-04-13 20:34:13,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 914 places, 4186 transitions, 110134 flow, removed 777 selfloop flow, removed 28 redundant places. [2025-04-13 20:34:13,748 INFO L231 Difference]: Finished difference. Result has 938 places, 4006 transitions, 103397 flow [2025-04-13 20:34:13,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=91760, PETRI_DIFFERENCE_MINUEND_PLACES=845, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=583, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3020, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=103397, PETRI_PLACES=938, PETRI_TRANSITIONS=4006} [2025-04-13 20:34:13,756 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 917 predicate places. [2025-04-13 20:34:13,757 INFO L485 AbstractCegarLoop]: Abstraction has has 938 places, 4006 transitions, 103397 flow [2025-04-13 20:34:13,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 36 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-13 20:34:13,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:13,758 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:13,774 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-13 20:34:13,958 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,SelfDestructingSolverStorable63 [2025-04-13 20:34:13,959 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-13 20:34:13,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1181664276, now seen corresponding path program 16 times [2025-04-13 20:34:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:13,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439011131] [2025-04-13 20:34:13,960 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:34:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:13,963 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:34:13,964 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:34:13,964 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:34:13,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:34:14,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:14,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439011131] [2025-04-13 20:34:14,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439011131] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:14,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762913652] [2025-04-13 20:34:14,073 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:34:14,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:14,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:14,075 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-13 20:34:14,076 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-13 20:34:14,099 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:34:14,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:34:14,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:34:14,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:14,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:34:14,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:34:14,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:34:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762913652] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:34:14,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:34:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-04-13 20:34:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985554540] [2025-04-13 20:34:14,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:34:14,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:34:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:14,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:34:14,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:34:14,524 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:34:14,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 4006 transitions, 103397 flow. Second operand has 39 states, 39 states have (on average 3.358974358974359) internal successors, (131), 39 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:34:14,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:14,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:34:14,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:32,682 INFO L116 PetriNetUnfolderBase]: 12517/21318 cut-off events. [2025-04-13 20:34:32,683 INFO L117 PetriNetUnfolderBase]: For 1264125/1264125 co-relation queries the response was YES. [2025-04-13 20:34:33,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271105 conditions, 21318 events. 12517/21318 cut-off events. For 1264125/1264125 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 164590 event pairs, 857 based on Foata normal form. 6/21316 useless extension candidates. Maximal degree in co-relation 270831. Up to 17705 conditions per place. [2025-04-13 20:34:33,118 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3354 selfloop transitions, 786 changer transitions 31/4171 dead transitions. [2025-04-13 20:34:33,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 4171 transitions, 113873 flow [2025-04-13 20:34:33,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 20:34:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-13 20:34:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 392 transitions. [2025-04-13 20:34:33,120 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30601092896174864 [2025-04-13 20:34:33,120 INFO L175 Difference]: Start difference. First operand has 938 places, 4006 transitions, 103397 flow. Second operand 61 states and 392 transitions. [2025-04-13 20:34:33,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 4171 transitions, 113873 flow [2025-04-13 20:35:00,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 4171 transitions, 109623 flow, removed 2059 selfloop flow, removed 27 redundant places. [2025-04-13 20:35:00,715 INFO L231 Difference]: Finished difference. Result has 974 places, 4012 transitions, 101531 flow [2025-04-13 20:35:00,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=99765, PETRI_DIFFERENCE_MINUEND_PLACES=908, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=769, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=101531, PETRI_PLACES=974, PETRI_TRANSITIONS=4012} [2025-04-13 20:35:00,717 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 953 predicate places. [2025-04-13 20:35:00,717 INFO L485 AbstractCegarLoop]: Abstraction has has 974 places, 4012 transitions, 101531 flow [2025-04-13 20:35:00,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.358974358974359) internal successors, (131), 39 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:35:00,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:00,717 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:00,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-04-13 20:35:00,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:00,918 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-13 20:35:00,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1415462274, now seen corresponding path program 17 times [2025-04-13 20:35:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:00,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493416964] [2025-04-13 20:35:00,918 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:35:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:00,921 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:35:00,923 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:35:00,923 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:35:00,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:35:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:01,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493416964] [2025-04-13 20:35:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493416964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:01,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674559909] [2025-04-13 20:35:01,021 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:35:01,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:01,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:01,023 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-13 20:35:01,023 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-13 20:35:01,046 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:35:01,054 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:35:01,054 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:35:01,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:01,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:35:01,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:35:01,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:35:01,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674559909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:35:01,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:35:01,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 26 [2025-04-13 20:35:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025697239] [2025-04-13 20:35:01,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:35:01,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:35:01,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:01,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:35:01,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:35:01,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:35:01,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 4012 transitions, 101531 flow. Second operand has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 28 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-13 20:35:01,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:01,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:35:01,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:17,707 INFO L116 PetriNetUnfolderBase]: 12547/21361 cut-off events. [2025-04-13 20:35:17,707 INFO L117 PetriNetUnfolderBase]: For 987866/987866 co-relation queries the response was YES. [2025-04-13 20:35:18,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257653 conditions, 21361 events. 12547/21361 cut-off events. For 987866/987866 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 164978 event pairs, 944 based on Foata normal form. 6/21357 useless extension candidates. Maximal degree in co-relation 257381. Up to 20284 conditions per place. [2025-04-13 20:35:18,247 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3527 selfloop transitions, 537 changer transitions 27/4091 dead transitions. [2025-04-13 20:35:18,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 4091 transitions, 110555 flow [2025-04-13 20:35:18,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:35:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:35:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 193 transitions. [2025-04-13 20:35:18,248 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3282312925170068 [2025-04-13 20:35:18,248 INFO L175 Difference]: Start difference. First operand has 974 places, 4012 transitions, 101531 flow. Second operand 28 states and 193 transitions. [2025-04-13 20:35:18,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 4091 transitions, 110555 flow [2025-04-13 20:35:38,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 965 places, 4091 transitions, 109690 flow, removed 217 selfloop flow, removed 29 redundant places. [2025-04-13 20:35:38,722 INFO L231 Difference]: Finished difference. Result has 972 places, 4026 transitions, 102288 flow [2025-04-13 20:35:38,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=100676, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=519, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=102288, PETRI_PLACES=972, PETRI_TRANSITIONS=4026} [2025-04-13 20:35:38,724 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 951 predicate places. [2025-04-13 20:35:38,724 INFO L485 AbstractCegarLoop]: Abstraction has has 972 places, 4026 transitions, 102288 flow [2025-04-13 20:35:38,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 28 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-13 20:35:38,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:38,725 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:38,730 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-13 20:35:38,925 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,SelfDestructingSolverStorable65 [2025-04-13 20:35:38,925 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-13 20:35:38,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1501386458, now seen corresponding path program 18 times [2025-04-13 20:35:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:38,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625838521] [2025-04-13 20:35:38,926 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:35:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:38,929 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:35:38,932 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:35:38,932 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:35:38,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:35:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:39,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625838521] [2025-04-13 20:35:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625838521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:39,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404589273] [2025-04-13 20:35:39,049 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:35:39,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:39,051 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-13 20:35:39,052 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-13 20:35:39,078 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:35:39,087 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:35:39,087 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:35:39,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:39,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:35:39,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:35:39,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:35:39,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404589273] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:35:39,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:35:39,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 27 [2025-04-13 20:35:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407256509] [2025-04-13 20:35:39,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:35:39,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:35:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:39,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:35:39,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:35:39,323 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:35:39,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 972 places, 4026 transitions, 102288 flow. Second operand has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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-13 20:35:39,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:39,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:35:39,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:57,353 INFO L116 PetriNetUnfolderBase]: 12519/21274 cut-off events. [2025-04-13 20:35:57,354 INFO L117 PetriNetUnfolderBase]: For 1006667/1006667 co-relation queries the response was YES. [2025-04-13 20:35:57,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257700 conditions, 21274 events. 12519/21274 cut-off events. For 1006667/1006667 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 163712 event pairs, 908 based on Foata normal form. 8/21272 useless extension candidates. Maximal degree in co-relation 257423. Up to 19623 conditions per place. [2025-04-13 20:35:57,726 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3377 selfloop transitions, 736 changer transitions 24/4137 dead transitions. [2025-04-13 20:35:57,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 4137 transitions, 111925 flow [2025-04-13 20:35:57,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:35:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:35:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 305 transitions. [2025-04-13 20:35:57,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30257936507936506 [2025-04-13 20:35:57,727 INFO L175 Difference]: Start difference. First operand has 972 places, 4026 transitions, 102288 flow. Second operand 48 states and 305 transitions. [2025-04-13 20:35:57,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 4137 transitions, 111925 flow [2025-04-13 20:36:18,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 990 places, 4137 transitions, 111075 flow, removed 111 selfloop flow, removed 19 redundant places. [2025-04-13 20:36:18,457 INFO L231 Difference]: Finished difference. Result has 994 places, 4039 transitions, 103530 flow [2025-04-13 20:36:18,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=101426, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=719, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=103530, PETRI_PLACES=994, PETRI_TRANSITIONS=4039} [2025-04-13 20:36:18,460 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 973 predicate places. [2025-04-13 20:36:18,460 INFO L485 AbstractCegarLoop]: Abstraction has has 994 places, 4039 transitions, 103530 flow [2025-04-13 20:36:18,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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-13 20:36:18,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:18,460 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:18,466 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-13 20:36:18,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 20:36:18,660 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-13 20:36:18,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash 995040192, now seen corresponding path program 19 times [2025-04-13 20:36:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:18,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438443119] [2025-04-13 20:36:18,661 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:36:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:18,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:36:18,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:36:18,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:18,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:36:18,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:18,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438443119] [2025-04-13 20:36:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438443119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:18,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14566173] [2025-04-13 20:36:18,775 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:36:18,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:18,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:18,777 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-13 20:36:18,778 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-13 20:36:18,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:36:18,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:36:18,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:18,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:18,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:36:18,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:36:18,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:36:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14566173] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:19,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 27 [2025-04-13 20:36:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160341470] [2025-04-13 20:36:19,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:19,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:36:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:19,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:36:19,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:36:19,038 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:36:19,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 4039 transitions, 103530 flow. Second operand has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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-13 20:36:19,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:19,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:36:19,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:39,032 INFO L116 PetriNetUnfolderBase]: 13769/23307 cut-off events. [2025-04-13 20:36:39,033 INFO L117 PetriNetUnfolderBase]: For 1224068/1224068 co-relation queries the response was YES. [2025-04-13 20:36:39,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288334 conditions, 23307 events. 13769/23307 cut-off events. For 1224068/1224068 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 181443 event pairs, 915 based on Foata normal form. 11/23308 useless extension candidates. Maximal degree in co-relation 288055. Up to 20548 conditions per place. [2025-04-13 20:36:39,515 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3623 selfloop transitions, 963 changer transitions 51/4637 dead transitions. [2025-04-13 20:36:39,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 4637 transitions, 126678 flow [2025-04-13 20:36:39,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 20:36:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-13 20:36:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 261 transitions. [2025-04-13 20:36:39,516 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32706766917293234 [2025-04-13 20:36:39,516 INFO L175 Difference]: Start difference. First operand has 994 places, 4039 transitions, 103530 flow. Second operand 38 states and 261 transitions. [2025-04-13 20:36:39,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 4637 transitions, 126678 flow [2025-04-13 20:37:03,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 4637 transitions, 125438 flow, removed 193 selfloop flow, removed 34 redundant places. [2025-04-13 20:37:03,458 INFO L231 Difference]: Finished difference. Result has 1009 places, 4441 transitions, 115622 flow [2025-04-13 20:37:03,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=102318, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4039, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=648, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=115622, PETRI_PLACES=1009, PETRI_TRANSITIONS=4441} [2025-04-13 20:37:03,460 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 988 predicate places. [2025-04-13 20:37:03,460 INFO L485 AbstractCegarLoop]: Abstraction has has 1009 places, 4441 transitions, 115622 flow [2025-04-13 20:37:03,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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-13 20:37:03,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:03,460 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:03,466 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-13 20:37:03,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:03,661 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-13 20:37:03,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash 991638252, now seen corresponding path program 20 times [2025-04-13 20:37:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:03,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463839402] [2025-04-13 20:37:03,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:37:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:03,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:37:03,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:37:03,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:03,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:03,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463839402] [2025-04-13 20:37:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463839402] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:03,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783745015] [2025-04-13 20:37:03,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:37:03,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:03,777 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-13 20:37:03,777 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-13 20:37:03,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:37:03,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:37:03,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:03,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:03,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:37:03,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:03,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:04,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783745015] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:04,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:04,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 27 [2025-04-13 20:37:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78613917] [2025-04-13 20:37:04,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:04,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:37:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:04,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:37:04,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:37:04,040 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:37:04,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 4441 transitions, 115622 flow. Second operand has 29 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:04,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:04,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:37:04,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:26,409 INFO L116 PetriNetUnfolderBase]: 13686/23163 cut-off events. [2025-04-13 20:37:26,409 INFO L117 PetriNetUnfolderBase]: For 1234269/1234269 co-relation queries the response was YES. [2025-04-13 20:37:26,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292197 conditions, 23163 events. 13686/23163 cut-off events. For 1234269/1234269 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 180063 event pairs, 915 based on Foata normal form. 17/23170 useless extension candidates. Maximal degree in co-relation 291903. Up to 20548 conditions per place. [2025-04-13 20:37:26,946 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3589 selfloop transitions, 986 changer transitions 22/4597 dead transitions. [2025-04-13 20:37:26,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1043 places, 4597 transitions, 127886 flow [2025-04-13 20:37:26,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 20:37:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-13 20:37:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 260 transitions. [2025-04-13 20:37:26,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3258145363408521 [2025-04-13 20:37:26,947 INFO L175 Difference]: Start difference. First operand has 1009 places, 4441 transitions, 115622 flow. Second operand 38 states and 260 transitions. [2025-04-13 20:37:26,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1043 places, 4597 transitions, 127886 flow [2025-04-13 20:37:53,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 4597 transitions, 124438 flow, removed 1579 selfloop flow, removed 11 redundant places. [2025-04-13 20:37:53,694 INFO L231 Difference]: Finished difference. Result has 1037 places, 4473 transitions, 115730 flow [2025-04-13 20:37:53,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=112283, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=958, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=115730, PETRI_PLACES=1037, PETRI_TRANSITIONS=4473} [2025-04-13 20:37:53,697 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1016 predicate places. [2025-04-13 20:37:53,697 INFO L485 AbstractCegarLoop]: Abstraction has has 1037 places, 4473 transitions, 115730 flow [2025-04-13 20:37:53,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:53,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:53,697 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:53,704 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-13 20:37:53,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:53,898 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-13 20:37:53,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:53,898 INFO L85 PathProgramCache]: Analyzing trace with hash -12521219, now seen corresponding path program 28 times [2025-04-13 20:37:53,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:53,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787071717] [2025-04-13 20:37:53,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:37:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:53,901 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:37:53,903 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:37:53,903 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:37:53,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:54,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:54,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787071717] [2025-04-13 20:37:54,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787071717] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:54,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573321257] [2025-04-13 20:37:54,010 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:37:54,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:54,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:54,012 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-13 20:37:54,013 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-13 20:37:54,038 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:37:54,047 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:37:54,047 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:37:54,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:54,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:37:54,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:54,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573321257] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:54,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:54,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 26 [2025-04-13 20:37:54,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492155484] [2025-04-13 20:37:54,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:54,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:37:54,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:54,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:37:54,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:37:54,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:37:54,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1037 places, 4473 transitions, 115730 flow. Second operand has 28 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:54,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:54,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:37:54,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:18,124 INFO L116 PetriNetUnfolderBase]: 14374/24356 cut-off events. [2025-04-13 20:38:18,125 INFO L117 PetriNetUnfolderBase]: For 1113940/1113940 co-relation queries the response was YES. [2025-04-13 20:38:18,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297790 conditions, 24356 events. 14374/24356 cut-off events. For 1113940/1113940 co-relation queries the response was YES. Maximal size of possible extension queue 1166. Compared 190811 event pairs, 887 based on Foata normal form. 15/24361 useless extension candidates. Maximal degree in co-relation 297490. Up to 20670 conditions per place. [2025-04-13 20:38:18,579 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 3489 selfloop transitions, 1485 changer transitions 48/5022 dead transitions. [2025-04-13 20:38:18,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1069 places, 5022 transitions, 137759 flow [2025-04-13 20:38:18,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 20:38:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-13 20:38:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 224 transitions. [2025-04-13 20:38:18,581 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2025-04-13 20:38:18,581 INFO L175 Difference]: Start difference. First operand has 1037 places, 4473 transitions, 115730 flow. Second operand 36 states and 224 transitions. [2025-04-13 20:38:18,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1069 places, 5022 transitions, 137759 flow [2025-04-13 20:38:45,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1043 places, 5022 transitions, 135969 flow, removed 293 selfloop flow, removed 26 redundant places. [2025-04-13 20:38:45,797 INFO L231 Difference]: Finished difference. Result has 1052 places, 4930 transitions, 129826 flow [2025-04-13 20:38:45,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=113940, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=129826, PETRI_PLACES=1052, PETRI_TRANSITIONS=4930} [2025-04-13 20:38:45,800 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1031 predicate places. [2025-04-13 20:38:45,800 INFO L485 AbstractCegarLoop]: Abstraction has has 1052 places, 4930 transitions, 129826 flow [2025-04-13 20:38:45,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:38:45,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:45,800 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:38:45,806 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-13 20:38:46,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:46,001 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-13 20:38:46,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:46,001 INFO L85 PathProgramCache]: Analyzing trace with hash 634033686, now seen corresponding path program 21 times [2025-04-13 20:38:46,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:46,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556373922] [2025-04-13 20:38:46,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:38:46,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:46,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:38:46,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:38:46,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:38:46,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:46,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556373922] [2025-04-13 20:38:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556373922] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:46,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353970480] [2025-04-13 20:38:46,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:38:46,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:46,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:46,127 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-13 20:38:46,128 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-13 20:38:46,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:38:46,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:38:46,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:38:46,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:46,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:38:46,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:46,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:46,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353970480] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:38:46,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:38:46,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-04-13 20:38:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880132098] [2025-04-13 20:38:46,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:38:46,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:38:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:46,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:38:46,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1202, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:38:46,537 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:38:46,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 4930 transitions, 129826 flow. Second operand has 38 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 38 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-13 20:38:46,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:46,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:38:46,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:13,235 INFO L116 PetriNetUnfolderBase]: 14602/24830 cut-off events. [2025-04-13 20:39:13,235 INFO L117 PetriNetUnfolderBase]: For 1198485/1198485 co-relation queries the response was YES. [2025-04-13 20:39:13,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311282 conditions, 24830 events. 14602/24830 cut-off events. For 1198485/1198485 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 196652 event pairs, 850 based on Foata normal form. 18/24846 useless extension candidates. Maximal degree in co-relation 310972. Up to 23404 conditions per place. [2025-04-13 20:39:13,936 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 4656 selfloop transitions, 456 changer transitions 60/5172 dead transitions. [2025-04-13 20:39:13,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1097 places, 5172 transitions, 144520 flow [2025-04-13 20:39:13,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:39:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:39:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 291 transitions. [2025-04-13 20:39:13,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28869047619047616 [2025-04-13 20:39:13,937 INFO L175 Difference]: Start difference. First operand has 1052 places, 4930 transitions, 129826 flow. Second operand 48 states and 291 transitions. [2025-04-13 20:39:13,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1097 places, 5172 transitions, 144520 flow [2025-04-13 20:39:46,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1076 places, 5172 transitions, 140854 flow, removed 1331 selfloop flow, removed 21 redundant places. [2025-04-13 20:39:46,262 INFO L231 Difference]: Finished difference. Result has 1092 places, 5044 transitions, 130696 flow [2025-04-13 20:39:46,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=126168, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=130696, PETRI_PLACES=1092, PETRI_TRANSITIONS=5044} [2025-04-13 20:39:46,265 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1071 predicate places. [2025-04-13 20:39:46,265 INFO L485 AbstractCegarLoop]: Abstraction has has 1092 places, 5044 transitions, 130696 flow [2025-04-13 20:39:46,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 38 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-13 20:39:46,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:46,265 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:46,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-04-13 20:39:46,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:46,466 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-13 20:39:46,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash 714296406, now seen corresponding path program 22 times [2025-04-13 20:39:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:46,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079109356] [2025-04-13 20:39:46,467 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:46,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:46,472 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:46,472 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:39:46,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:46,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079109356] [2025-04-13 20:39:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079109356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:46,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277099870] [2025-04-13 20:39:46,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:46,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:46,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:46,592 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-13 20:39:46,593 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-13 20:39:46,617 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:46,625 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:46,625 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:39:46,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:46,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:39:46,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:46,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277099870] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:46,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:46,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-04-13 20:39:46,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298046211] [2025-04-13 20:39:46,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:46,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:39:46,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:46,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:39:46,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:39:46,969 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:39:46,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1092 places, 5044 transitions, 130696 flow. Second operand has 37 states, 37 states have (on average 3.4054054054054053) internal successors, (126), 37 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:46,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:46,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:39:46,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:14,130 INFO L116 PetriNetUnfolderBase]: 14552/24723 cut-off events. [2025-04-13 20:40:14,130 INFO L117 PetriNetUnfolderBase]: For 1191552/1191552 co-relation queries the response was YES. [2025-04-13 20:40:14,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308487 conditions, 24723 events. 14552/24723 cut-off events. For 1191552/1191552 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 195199 event pairs, 882 based on Foata normal form. 6/24727 useless extension candidates. Maximal degree in co-relation 308162. Up to 23753 conditions per place. [2025-04-13 20:40:14,721 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 4767 selfloop transitions, 356 changer transitions 18/5141 dead transitions. [2025-04-13 20:40:14,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1120 places, 5141 transitions, 142266 flow [2025-04-13 20:40:14,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:40:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:40:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 261 transitions. [2025-04-13 20:40:14,722 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30313588850174217 [2025-04-13 20:40:14,722 INFO L175 Difference]: Start difference. First operand has 1092 places, 5044 transitions, 130696 flow. Second operand 41 states and 261 transitions. [2025-04-13 20:40:14,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1120 places, 5141 transitions, 142266 flow Received shutdown request... [2025-04-13 20:40:28,167 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:40:28,175 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-13 20:40:28,213 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:40:28,213 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:40:28,368 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,SelfDestructingSolverStorable71 [2025-04-13 20:40:28,368 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-13 20:40:28,373 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:40:28,373 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:40:28,374 INFO L422 BasicCegarLoop]: Path program histogram: [28, 22, 11, 4, 4, 2, 1] [2025-04-13 20:40:28,381 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:40:28,381 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:40:28,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:40:28 BasicIcfg [2025-04-13 20:40:28,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:40:28,397 INFO L158 Benchmark]: Toolchain (without parser) took 805016.39ms. Allocated memory was 155.2MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 107.4MB in the beginning and 1.1GB in the end (delta: -981.1MB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-13 20:40:28,397 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:40:28,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.95ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 93.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:40:28,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.19ms. Allocated memory is still 155.2MB. Free memory was 93.3MB in the beginning and 91.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:40:28,398 INFO L158 Benchmark]: Boogie Preprocessor took 28.19ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 89.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:40:28,398 INFO L158 Benchmark]: RCFGBuilder took 326.41ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 63.9MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 20:40:28,398 INFO L158 Benchmark]: TraceAbstraction took 804397.16ms. Allocated memory was 155.2MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 63.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-13 20:40:28,401 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.17ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.95ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 93.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.19ms. Allocated memory is still 155.2MB. Free memory was 93.3MB in the beginning and 91.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.19ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 89.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 326.41ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 63.9MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 804397.16ms. Allocated memory was 155.2MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 63.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 66]: 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, 28 locations, 35 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: 804.3s, OverallIterations: 72, TraceHistogramMax: 5, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.0s, AutomataDifference: 766.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8903 SdHoareTripleChecker+Valid, 22.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8903 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 18.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3887 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64140 IncrementalHoareTripleChecker+Invalid, 68027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3887 mSolverCounterUnsat, 0 mSDtfsCounter, 64140 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3687 GetRequests, 1057 SyntacticMatches, 26 SemanticMatches, 2604 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39836 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130696occurred in iteration=71, InterpolantAutomatonStates: 2162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 2264 NumberOfCodeBlocks, 2264 NumberOfCodeBlocksAsserted, 253 NumberOfCheckSat, 3114 ConstructedInterpolants, 0 QuantifiedInterpolants, 27039 SizeOfPredicates, 320 NumberOfNonLiveVariables, 6545 ConjunctsInSsa, 1675 ConjunctsInUnsatCore, 188 InterpolantComputations, 17 PerfectInterpolantSequences, 99/709 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