/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/bench-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:49:49,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:49:49,721 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 19:49:49,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:49:49,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:49:49,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:49:49,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:49:49,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:49:49,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:49:49,740 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:49:49,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:49:49,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:49:49,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:49:49,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:49:49,741 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:49:49,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:49:49,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:49:49,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:49:49,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:49:49,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:49:49,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:49:49,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:49:49,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:49:49,743 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 19:49:49,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:49:49,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:49:49,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:49:49,945 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:49:49,947 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:49:49,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2025-04-13 19:49:51,202 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097f87ee4/29d15fbc16e94a1b9d864e54471e09c3/FLAGe56f8dd7e [2025-04-13 19:49:51,400 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:49:51,401 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2025-04-13 19:49:51,410 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097f87ee4/29d15fbc16e94a1b9d864e54471e09c3/FLAGe56f8dd7e [2025-04-13 19:49:52,252 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097f87ee4/29d15fbc16e94a1b9d864e54471e09c3 [2025-04-13 19:49:52,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:49:52,255 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:49:52,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:49:52,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:49:52,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:49:52,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1133678a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52, skipping insertion in model container [2025-04-13 19:49:52,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:49:52,420 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/bench-exp2x4.wvr.c[2361,2374] [2025-04-13 19:49:52,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:49:52,434 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:49:52,462 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/bench-exp2x4.wvr.c[2361,2374] [2025-04-13 19:49:52,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:49:52,477 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:49:52,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52 WrapperNode [2025-04-13 19:49:52,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:49:52,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:49:52,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:49:52,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:49:52,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,508 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-04-13 19:49:52,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:49:52,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:49:52,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:49:52,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:49:52,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,538 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 19:49:52,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:49:52,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:49:52,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:49:52,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:49:52,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (1/1) ... [2025-04-13 19:49:52,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:49:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:49:52,579 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 19:49:52,582 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 19:49:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:49:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:49:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:49:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:49:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:49:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:49:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:49:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 19:49:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 19:49:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:49:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:49:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:49:52,599 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 19:49:52,665 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:49:52,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:49:52,790 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:49:52,791 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:49:52,791 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:49:52,924 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:49:52,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:49:52 BoogieIcfgContainer [2025-04-13 19:49:52,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:49:52,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:49:52,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:49:52,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:49:52,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:49:52" (1/3) ... [2025-04-13 19:49:52,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb33a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:49:52, skipping insertion in model container [2025-04-13 19:49:52,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:49:52" (2/3) ... [2025-04-13 19:49:52,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb33a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:49:52, skipping insertion in model container [2025-04-13 19:49:52,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:49:52" (3/3) ... [2025-04-13 19:49:52,935 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2025-04-13 19:49:52,944 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:49:52,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x4.wvr.c that has 5 procedures, 28 locations, 27 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 19:49:52,945 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:49:52,987 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 19:49:53,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 19:49:53,041 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-13 19:49:53,044 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:49:53,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 4/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 17 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-13 19:49:53,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 19:49:53,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2025-04-13 19:49:53,055 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:49:53,063 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;@57be1068, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:49:53,063 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:49:53,073 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:49:53,073 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-13 19:49:53,073 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:49:53,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:53,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:53,074 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:53,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:53,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1761742243, now seen corresponding path program 1 times [2025-04-13 19:49:53,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:53,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937638745] [2025-04-13 19:49:53,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:53,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:53,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:49:53,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:49:53,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:53,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:53,397 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 19:49:53,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:53,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937638745] [2025-04-13 19:49:53,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937638745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:49:53,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:49:53,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:49:53,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525851890] [2025-04-13 19:49:53,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:49:53,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:49:53,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:53,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:49:53,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:49:53,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:53,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:53,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:53,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:53,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:53,622 INFO L116 PetriNetUnfolderBase]: 1367/1731 cut-off events. [2025-04-13 19:49:53,623 INFO L117 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-04-13 19:49:53,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1731 events. 1367/1731 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5573 event pairs, 123 based on Foata normal form. 1/990 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-04-13 19:49:53,637 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2025-04-13 19:49:53,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 217 flow [2025-04-13 19:49:53,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:49:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:49:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-13 19:49:53,645 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-13 19:49:53,647 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 76 flow. Second operand 3 states and 66 transitions. [2025-04-13 19:49:53,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 217 flow [2025-04-13 19:49:53,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 45 transitions, 187 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 19:49:53,655 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 93 flow [2025-04-13 19:49:53,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2025-04-13 19:49:53,661 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-13 19:49:53,661 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 93 flow [2025-04-13 19:49:53,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:53,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:53,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:53,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:49:53,661 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:53,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:53,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1333027229, now seen corresponding path program 1 times [2025-04-13 19:49:53,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:53,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921560920] [2025-04-13 19:49:53,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:53,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:49:53,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:53,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:53,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:53,787 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 19:49:53,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:53,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921560920] [2025-04-13 19:49:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921560920] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:49:53,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:49:53,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:49:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801536375] [2025-04-13 19:49:53,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:49:53,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:49:53,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:53,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:49:53,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:49:53,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:53,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:53,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:53,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:53,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:54,006 INFO L116 PetriNetUnfolderBase]: 1560/2014 cut-off events. [2025-04-13 19:49:54,007 INFO L117 PetriNetUnfolderBase]: For 648/648 co-relation queries the response was YES. [2025-04-13 19:49:54,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4994 conditions, 2014 events. 1560/2014 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6885 event pairs, 89 based on Foata normal form. 33/2011 useless extension candidates. Maximal degree in co-relation 1787. Up to 826 conditions per place. [2025-04-13 19:49:54,016 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 57 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-04-13 19:49:54,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 71 transitions, 351 flow [2025-04-13 19:49:54,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:49:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:49:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-13 19:49:54,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-13 19:49:54,018 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 93 flow. Second operand 5 states and 101 transitions. [2025-04-13 19:49:54,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 71 transitions, 351 flow [2025-04-13 19:49:54,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 71 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:49:54,020 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 153 flow [2025-04-13 19:49:54,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-04-13 19:49:54,020 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-04-13 19:49:54,020 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 153 flow [2025-04-13 19:49:54,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:54,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:54,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:54,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:49:54,022 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:54,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1657963332, now seen corresponding path program 1 times [2025-04-13 19:49:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:54,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372038194] [2025-04-13 19:49:54,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:54,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:49:54,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:54,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:54,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:54,137 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 19:49:54,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:54,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372038194] [2025-04-13 19:49:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372038194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:49:54,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275062523] [2025-04-13 19:49:54,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:54,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:49:54,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:49:54,140 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 19:49:54,141 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 19:49:54,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:49:54,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:54,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:54,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:49:54,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:49:54,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 19:49:54,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:49:54,345 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 19:49:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275062523] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:49:54,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:49:54,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:49:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682663361] [2025-04-13 19:49:54,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:49:54,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:49:54,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:54,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:49:54,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:49:54,346 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:54,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:54,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:54,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:54,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:54,610 INFO L116 PetriNetUnfolderBase]: 1955/2589 cut-off events. [2025-04-13 19:49:54,610 INFO L117 PetriNetUnfolderBase]: For 2885/2897 co-relation queries the response was YES. [2025-04-13 19:49:54,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 2589 events. 1955/2589 cut-off events. For 2885/2897 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10399 event pairs, 325 based on Foata normal form. 80/2635 useless extension candidates. Maximal degree in co-relation 4051. Up to 1294 conditions per place. [2025-04-13 19:49:54,622 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 89 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2025-04-13 19:49:54,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 101 transitions, 613 flow [2025-04-13 19:49:54,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:49:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:49:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-04-13 19:49:54,623 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7290322580645161 [2025-04-13 19:49:54,623 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 153 flow. Second operand 5 states and 113 transitions. [2025-04-13 19:49:54,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 101 transitions, 613 flow [2025-04-13 19:49:54,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 101 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:49:54,628 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 208 flow [2025-04-13 19:49:54,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-13 19:49:54,628 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-04-13 19:49:54,628 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 208 flow [2025-04-13 19:49:54,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:54,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:54,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:54,636 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 19:49:54,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:49:54,833 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:54,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash 338636606, now seen corresponding path program 2 times [2025-04-13 19:49:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:54,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060656368] [2025-04-13 19:49:54,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:49:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:54,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:49:54,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:54,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:49:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:54,942 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 19:49:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:54,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060656368] [2025-04-13 19:49:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060656368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:49:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:49:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:49:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917532861] [2025-04-13 19:49:54,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:49:54,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:49:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:54,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:49:54,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:49:54,944 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:54,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:54,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:54,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:54,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:55,180 INFO L116 PetriNetUnfolderBase]: 1710/2233 cut-off events. [2025-04-13 19:49:55,180 INFO L117 PetriNetUnfolderBase]: For 3794/3797 co-relation queries the response was YES. [2025-04-13 19:49:55,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8289 conditions, 2233 events. 1710/2233 cut-off events. For 3794/3797 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8255 event pairs, 145 based on Foata normal form. 34/2256 useless extension candidates. Maximal degree in co-relation 4441. Up to 937 conditions per place. [2025-04-13 19:49:55,195 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 88 selfloop transitions, 11 changer transitions 0/103 dead transitions. [2025-04-13 19:49:55,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 103 transitions, 681 flow [2025-04-13 19:49:55,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:49:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:49:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-13 19:49:55,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-13 19:49:55,198 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 208 flow. Second operand 5 states and 110 transitions. [2025-04-13 19:49:55,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 103 transitions, 681 flow [2025-04-13 19:49:55,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 103 transitions, 681 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:49:55,207 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 269 flow [2025-04-13 19:49:55,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-13 19:49:55,207 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2025-04-13 19:49:55,207 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 269 flow [2025-04-13 19:49:55,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:55,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:55,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:55,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:49:55,208 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:55,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1742464281, now seen corresponding path program 1 times [2025-04-13 19:49:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:55,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679909261] [2025-04-13 19:49:55,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:55,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:49:55,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:55,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:55,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:55,284 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 19:49:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:55,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679909261] [2025-04-13 19:49:55,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679909261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:49:55,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:49:55,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:49:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076232540] [2025-04-13 19:49:55,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:49:55,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:49:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:55,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:49:55,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:49:55,285 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:55,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:55,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:55,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:55,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:55,521 INFO L116 PetriNetUnfolderBase]: 1664/2187 cut-off events. [2025-04-13 19:49:55,522 INFO L117 PetriNetUnfolderBase]: For 5027/5030 co-relation queries the response was YES. [2025-04-13 19:49:55,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8700 conditions, 2187 events. 1664/2187 cut-off events. For 5027/5030 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8363 event pairs, 119 based on Foata normal form. 46/2222 useless extension candidates. Maximal degree in co-relation 4740. Up to 973 conditions per place. [2025-04-13 19:49:55,536 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 86 selfloop transitions, 8 changer transitions 2/100 dead transitions. [2025-04-13 19:49:55,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 100 transitions, 690 flow [2025-04-13 19:49:55,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:49:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:49:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-13 19:49:55,538 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6967741935483871 [2025-04-13 19:49:55,538 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 269 flow. Second operand 5 states and 108 transitions. [2025-04-13 19:49:55,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 100 transitions, 690 flow [2025-04-13 19:49:55,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 100 transitions, 679 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 19:49:55,544 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 272 flow [2025-04-13 19:49:55,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-04-13 19:49:55,544 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2025-04-13 19:49:55,544 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 272 flow [2025-04-13 19:49:55,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:55,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:55,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:55,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:49:55,545 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:55,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1241141516, now seen corresponding path program 1 times [2025-04-13 19:49:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:55,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483274763] [2025-04-13 19:49:55,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:49:55,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:55,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:55,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:55,613 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 19:49:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:55,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483274763] [2025-04-13 19:49:55,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483274763] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:49:55,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103982462] [2025-04-13 19:49:55,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:55,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:49:55,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:49:55,615 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 19:49:55,617 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 19:49:55,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:49:55,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:55,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:55,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:55,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:49:55,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:49:55,762 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 19:49:55,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:49:55,804 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 19:49:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103982462] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:49:55,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:49:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:49:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727895067] [2025-04-13 19:49:55,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:49:55,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:49:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:55,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:49:55,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:49:55,805 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:55,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:55,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:55,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:55,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:55,999 INFO L116 PetriNetUnfolderBase]: 1750/2372 cut-off events. [2025-04-13 19:49:55,999 INFO L117 PetriNetUnfolderBase]: For 6133/6133 co-relation queries the response was YES. [2025-04-13 19:49:56,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9755 conditions, 2372 events. 1750/2372 cut-off events. For 6133/6133 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9745 event pairs, 287 based on Foata normal form. 64/2394 useless extension candidates. Maximal degree in co-relation 5126. Up to 980 conditions per place. [2025-04-13 19:49:56,013 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 93 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2025-04-13 19:49:56,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 107 transitions, 857 flow [2025-04-13 19:49:56,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:49:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:49:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-13 19:49:56,014 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2025-04-13 19:49:56,014 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 272 flow. Second operand 5 states and 103 transitions. [2025-04-13 19:49:56,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 107 transitions, 857 flow [2025-04-13 19:49:56,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 107 transitions, 824 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-13 19:49:56,018 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 317 flow [2025-04-13 19:49:56,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-04-13 19:49:56,019 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-04-13 19:49:56,019 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 317 flow [2025-04-13 19:49:56,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:56,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:56,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:56,025 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 19:49:56,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 19:49:56,220 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:56,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash -605505382, now seen corresponding path program 2 times [2025-04-13 19:49:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:56,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767637752] [2025-04-13 19:49:56,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:49:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:56,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:49:56,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:56,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:49:56,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:56,271 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 19:49:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:56,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767637752] [2025-04-13 19:49:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767637752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:49:56,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:49:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:49:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681896820] [2025-04-13 19:49:56,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:49:56,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:49:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:56,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:49:56,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:49:56,272 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:56,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:56,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:56,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:56,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:56,452 INFO L116 PetriNetUnfolderBase]: 1577/2119 cut-off events. [2025-04-13 19:49:56,452 INFO L117 PetriNetUnfolderBase]: For 5547/5547 co-relation queries the response was YES. [2025-04-13 19:49:56,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9333 conditions, 2119 events. 1577/2119 cut-off events. For 5547/5547 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8107 event pairs, 91 based on Foata normal form. 31/2120 useless extension candidates. Maximal degree in co-relation 6308. Up to 864 conditions per place. [2025-04-13 19:49:56,467 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 88 selfloop transitions, 9 changer transitions 4/105 dead transitions. [2025-04-13 19:49:56,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 843 flow [2025-04-13 19:49:56,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:49:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:49:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-13 19:49:56,468 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-13 19:49:56,468 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 317 flow. Second operand 5 states and 101 transitions. [2025-04-13 19:49:56,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 843 flow [2025-04-13 19:49:56,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 834 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:49:56,477 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 321 flow [2025-04-13 19:49:56,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2025-04-13 19:49:56,478 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2025-04-13 19:49:56,478 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 321 flow [2025-04-13 19:49:56,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:56,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:56,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:56,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:49:56,479 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:56,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -905841865, now seen corresponding path program 2 times [2025-04-13 19:49:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:56,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476282377] [2025-04-13 19:49:56,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:49:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:56,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:49:56,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:56,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:49:56,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:56,532 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 19:49:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:56,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476282377] [2025-04-13 19:49:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476282377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:49:56,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960686427] [2025-04-13 19:49:56,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:49:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:49:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:49:56,535 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 19:49:56,537 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 19:49:56,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:49:56,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:56,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:49:56,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:56,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:49:56,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:49:56,699 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 19:49:56,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:49:56,753 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 19:49:56,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960686427] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:49:56,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:49:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:49:56,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133139217] [2025-04-13 19:49:56,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:49:56,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:49:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:56,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:49:56,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:49:56,754 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:56,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 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 19:49:56,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:56,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:56,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:56,970 INFO L116 PetriNetUnfolderBase]: 1515/2069 cut-off events. [2025-04-13 19:49:56,970 INFO L117 PetriNetUnfolderBase]: For 5819/5819 co-relation queries the response was YES. [2025-04-13 19:49:56,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9470 conditions, 2069 events. 1515/2069 cut-off events. For 5819/5819 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8396 event pairs, 258 based on Foata normal form. 62/2089 useless extension candidates. Maximal degree in co-relation 5971. Up to 1124 conditions per place. [2025-04-13 19:49:56,979 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 91 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2025-04-13 19:49:56,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 863 flow [2025-04-13 19:49:56,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:49:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:49:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-13 19:49:56,980 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.632258064516129 [2025-04-13 19:49:56,980 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 321 flow. Second operand 5 states and 98 transitions. [2025-04-13 19:49:56,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 863 flow [2025-04-13 19:49:56,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 856 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:49:56,985 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 368 flow [2025-04-13 19:49:56,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2025-04-13 19:49:56,986 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-04-13 19:49:56,986 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 368 flow [2025-04-13 19:49:56,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 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 19:49:56,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:56,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:56,993 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 19:49:57,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:49:57,188 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:57,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1756493289, now seen corresponding path program 2 times [2025-04-13 19:49:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:57,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039307261] [2025-04-13 19:49:57,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:49:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:57,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:49:57,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:57,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:49:57,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:57,252 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 19:49:57,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:57,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039307261] [2025-04-13 19:49:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039307261] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:49:57,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838772074] [2025-04-13 19:49:57,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:49:57,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:49:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:49:57,255 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 19:49:57,256 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 19:49:57,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:49:57,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:49:57,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:49:57,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:57,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:49:57,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:49:57,368 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 19:49:57,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:49:57,402 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 19:49:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838772074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:49:57,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:49:57,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:49:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046234990] [2025-04-13 19:49:57,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:49:57,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:49:57,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:57,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:49:57,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:49:57,403 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:57,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:57,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:57,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:57,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:57,592 INFO L116 PetriNetUnfolderBase]: 1447/1984 cut-off events. [2025-04-13 19:49:57,592 INFO L117 PetriNetUnfolderBase]: For 7228/7264 co-relation queries the response was YES. [2025-04-13 19:49:57,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9761 conditions, 1984 events. 1447/1984 cut-off events. For 7228/7264 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8236 event pairs, 375 based on Foata normal form. 72/2035 useless extension candidates. Maximal degree in co-relation 8537. Up to 1150 conditions per place. [2025-04-13 19:49:57,602 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 111 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-04-13 19:49:57,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 1138 flow [2025-04-13 19:49:57,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:49:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:49:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-04-13 19:49:57,603 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6838709677419355 [2025-04-13 19:49:57,603 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 368 flow. Second operand 5 states and 106 transitions. [2025-04-13 19:49:57,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 1138 flow [2025-04-13 19:49:57,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 123 transitions, 1097 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-13 19:49:57,610 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 406 flow [2025-04-13 19:49:57,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2025-04-13 19:49:57,610 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2025-04-13 19:49:57,610 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 406 flow [2025-04-13 19:49:57,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:49:57,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:49:57,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:49:57,616 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 19:49:57,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:49:57,815 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:49:57,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:49:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2033751776, now seen corresponding path program 1 times [2025-04-13 19:49:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:49:57,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627188265] [2025-04-13 19:49:57,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:49:57,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:49:57,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:49:57,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:57,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:58,187 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 19:49:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:49:58,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627188265] [2025-04-13 19:49:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627188265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:49:58,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276423709] [2025-04-13 19:49:58,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:49:58,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:49:58,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:49:58,190 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 19:49:58,191 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 19:49:58,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:49:58,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:49:58,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:49:58,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:49:58,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:49:58,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:04,167 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 19:50:04,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:04,703 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 19:50:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276423709] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:04,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 19:50:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916243132] [2025-04-13 19:50:04,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:04,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:50:04,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:04,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:50:04,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:50:04,704 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:04,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 406 flow. Second operand has 16 states, 16 states have (on average 11.4375) internal successors, (183), 16 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:04,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:04,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:04,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:07,496 INFO L116 PetriNetUnfolderBase]: 3088/4261 cut-off events. [2025-04-13 19:50:07,496 INFO L117 PetriNetUnfolderBase]: For 14214/14214 co-relation queries the response was YES. [2025-04-13 19:50:07,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21434 conditions, 4261 events. 3088/4261 cut-off events. For 14214/14214 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 20087 event pairs, 155 based on Foata normal form. 21/4265 useless extension candidates. Maximal degree in co-relation 19744. Up to 2243 conditions per place. [2025-04-13 19:50:07,521 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 215 selfloop transitions, 100 changer transitions 15/334 dead transitions. [2025-04-13 19:50:07,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 334 transitions, 2827 flow [2025-04-13 19:50:07,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:50:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:50:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 360 transitions. [2025-04-13 19:50:07,523 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2025-04-13 19:50:07,523 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 406 flow. Second operand 16 states and 360 transitions. [2025-04-13 19:50:07,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 334 transitions, 2827 flow [2025-04-13 19:50:07,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 334 transitions, 2779 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-04-13 19:50:07,539 INFO L231 Difference]: Finished difference. Result has 93 places, 152 transitions, 1634 flow [2025-04-13 19:50:07,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1634, PETRI_PLACES=93, PETRI_TRANSITIONS=152} [2025-04-13 19:50:07,541 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2025-04-13 19:50:07,541 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 152 transitions, 1634 flow [2025-04-13 19:50:07,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.4375) internal successors, (183), 16 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:07,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:07,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:07,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 19:50:07,742 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,SelfDestructingSolverStorable9 [2025-04-13 19:50:07,742 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:07,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash -395680608, now seen corresponding path program 1 times [2025-04-13 19:50:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:07,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603397172] [2025-04-13 19:50:07,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:07,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:50:07,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:50:07,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:07,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:08,064 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 19:50:08,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:08,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603397172] [2025-04-13 19:50:08,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603397172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:08,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195589341] [2025-04-13 19:50:08,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:08,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:08,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:08,066 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 19:50:08,068 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 19:50:08,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:50:08,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:50:08,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:08,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:08,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:50:08,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:51:12,721 WARN L286 SmtUtils]: Spent 11.22s on a formula simplification. DAG size of input: 34 DAG size of output: 32 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:51:20,789 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 19:51:20,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:51:30,851 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 19:51:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195589341] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:51:30,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:51:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 19:51:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045612261] [2025-04-13 19:51:30,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:51:30,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:51:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:30,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:51:30,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=168, Unknown=6, NotChecked=0, Total=240 [2025-04-13 19:51:30,852 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:51:30,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 152 transitions, 1634 flow. Second operand has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:51:30,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:30,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:51:30,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:39,013 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:41,748 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:42,899 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:49,772 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:59,105 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:03,058 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:07,896 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:22,529 WARN L286 SmtUtils]: Spent 10.61s on a formula simplification. DAG size of input: 43 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:52:25,890 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:31,718 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:32,765 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:40,470 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:44,289 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:48,908 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:54,039 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:11,013 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:15,020 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:17,641 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:22,480 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:26,484 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:27,935 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:31,970 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:36,008 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:36,063 INFO L116 PetriNetUnfolderBase]: 4462/6157 cut-off events. [2025-04-13 19:53:36,063 INFO L117 PetriNetUnfolderBase]: For 29430/29430 co-relation queries the response was YES. [2025-04-13 19:53:36,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35624 conditions, 6157 events. 4462/6157 cut-off events. For 29430/29430 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 30685 event pairs, 372 based on Foata normal form. 15/6155 useless extension candidates. Maximal degree in co-relation 33631. Up to 4423 conditions per place. [2025-04-13 19:53:36,101 INFO L140 encePairwiseOnDemand]: 16/31 looper letters, 279 selfloop transitions, 104 changer transitions 29/416 dead transitions. [2025-04-13 19:53:36,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 416 transitions, 4401 flow [2025-04-13 19:53:36,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:53:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 19:53:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 346 transitions. [2025-04-13 19:53:36,103 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6565464895635673 [2025-04-13 19:53:36,103 INFO L175 Difference]: Start difference. First operand has 93 places, 152 transitions, 1634 flow. Second operand 17 states and 346 transitions. [2025-04-13 19:53:36,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 416 transitions, 4401 flow [2025-04-13 19:53:36,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 416 transitions, 4202 flow, removed 97 selfloop flow, removed 1 redundant places. [2025-04-13 19:53:36,163 INFO L231 Difference]: Finished difference. Result has 120 places, 254 transitions, 2884 flow [2025-04-13 19:53:36,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2884, PETRI_PLACES=120, PETRI_TRANSITIONS=254} [2025-04-13 19:53:36,163 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 85 predicate places. [2025-04-13 19:53:36,163 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 254 transitions, 2884 flow [2025-04-13 19:53:36,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:36,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:36,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:53:36,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:53:36,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:36,364 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:53:36,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1506758718, now seen corresponding path program 2 times [2025-04-13 19:53:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:36,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806787473] [2025-04-13 19:53:36,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:53:36,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:36,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:53:36,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:53:36,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:36,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:36,554 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 19:53:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:36,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806787473] [2025-04-13 19:53:36,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806787473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:36,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127332325] [2025-04-13 19:53:36,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:53:36,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:36,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:36,556 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 19:53:36,557 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 19:53:36,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:53:36,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:53:36,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:36,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:36,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:53:36,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:37,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 19:53:37,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:38,133 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 19:53:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127332325] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:53:38,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:53:38,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5, 5] total 11 [2025-04-13 19:53:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369433706] [2025-04-13 19:53:38,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:53:38,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:53:38,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:38,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:53:38,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:53:38,134 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:53:38,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 254 transitions, 2884 flow. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:38,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:38,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:53:38,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:45,171 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:46,272 INFO L116 PetriNetUnfolderBase]: 6600/9112 cut-off events. [2025-04-13 19:53:46,272 INFO L117 PetriNetUnfolderBase]: For 67778/67778 co-relation queries the response was YES. [2025-04-13 19:53:46,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60892 conditions, 9112 events. 6600/9112 cut-off events. For 67778/67778 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 46928 event pairs, 453 based on Foata normal form. 27/9126 useless extension candidates. Maximal degree in co-relation 60181. Up to 6365 conditions per place. [2025-04-13 19:53:46,378 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 416 selfloop transitions, 147 changer transitions 13/580 dead transitions. [2025-04-13 19:53:46,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 580 transitions, 7339 flow [2025-04-13 19:53:46,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:53:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 19:53:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 380 transitions. [2025-04-13 19:53:46,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6810035842293907 [2025-04-13 19:53:46,380 INFO L175 Difference]: Start difference. First operand has 120 places, 254 transitions, 2884 flow. Second operand 18 states and 380 transitions. [2025-04-13 19:53:46,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 580 transitions, 7339 flow [2025-04-13 19:53:46,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 580 transitions, 6906 flow, removed 214 selfloop flow, removed 1 redundant places. [2025-04-13 19:53:46,550 INFO L231 Difference]: Finished difference. Result has 146 places, 387 transitions, 4659 flow [2025-04-13 19:53:46,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2483, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4659, PETRI_PLACES=146, PETRI_TRANSITIONS=387} [2025-04-13 19:53:46,552 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 111 predicate places. [2025-04-13 19:53:46,552 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 387 transitions, 4659 flow [2025-04-13 19:53:46,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:46,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:46,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:53:46,559 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 19:53:46,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:46,753 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:53:46,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash -332958782, now seen corresponding path program 2 times [2025-04-13 19:53:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:46,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041416026] [2025-04-13 19:53:46,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:53:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:46,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:53:46,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:53:46,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:46,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:46,922 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 19:53:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:46,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041416026] [2025-04-13 19:53:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041416026] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:46,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663008854] [2025-04-13 19:53:46,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:53:46,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:46,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:46,927 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 19:53:46,938 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 19:53:46,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:53:47,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:53:47,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:47,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:47,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:53:47,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:54:26,016 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:54:49,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 19:54:49,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:54:49,741 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 19:54:49,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663008854] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:54:49,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:54:49,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 6, 5] total 12 [2025-04-13 19:54:49,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089687142] [2025-04-13 19:54:49,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:54:49,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:54:49,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:54:49,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:54:49,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=116, Unknown=4, NotChecked=0, Total=182 [2025-04-13 19:54:49,742 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:54:49,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 387 transitions, 4659 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:54:49,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:54:49,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:54:49,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:54:58,449 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:02,452 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:11,036 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:13,673 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:17,716 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:22,024 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:26,027 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:30,226 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:38,397 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:42,402 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:48,128 INFO L116 PetriNetUnfolderBase]: 9496/13219 cut-off events. [2025-04-13 19:55:48,128 INFO L117 PetriNetUnfolderBase]: For 126058/126058 co-relation queries the response was YES. [2025-04-13 19:55:48,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91416 conditions, 13219 events. 9496/13219 cut-off events. For 126058/126058 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 73831 event pairs, 662 based on Foata normal form. 35/13241 useless extension candidates. Maximal degree in co-relation 90436. Up to 9127 conditions per place. [2025-04-13 19:55:48,249 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 576 selfloop transitions, 192 changer transitions 15/787 dead transitions. [2025-04-13 19:55:48,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 787 transitions, 9965 flow [2025-04-13 19:55:48,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:55:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 19:55:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 421 transitions. [2025-04-13 19:55:48,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7544802867383512 [2025-04-13 19:55:48,251 INFO L175 Difference]: Start difference. First operand has 146 places, 387 transitions, 4659 flow. Second operand 18 states and 421 transitions. [2025-04-13 19:55:48,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 787 transitions, 9965 flow [2025-04-13 19:55:48,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 787 transitions, 9206 flow, removed 377 selfloop flow, removed 1 redundant places. [2025-04-13 19:55:48,859 INFO L231 Difference]: Finished difference. Result has 173 places, 548 transitions, 6764 flow [2025-04-13 19:55:48,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3956, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6764, PETRI_PLACES=173, PETRI_TRANSITIONS=548} [2025-04-13 19:55:48,859 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 138 predicate places. [2025-04-13 19:55:48,860 INFO L485 AbstractCegarLoop]: Abstraction has has 173 places, 548 transitions, 6764 flow [2025-04-13 19:55:48,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:48,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:48,860 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:48,865 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 19:55:49,063 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,SelfDestructingSolverStorable12 [2025-04-13 19:55:49,064 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:55:49,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2057703261, now seen corresponding path program 3 times [2025-04-13 19:55:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:49,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893411371] [2025-04-13 19:55:49,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:49,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:55:49,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:55:49,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:55:49,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:49,155 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 19:55:49,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:49,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893411371] [2025-04-13 19:55:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893411371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:49,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104639013] [2025-04-13 19:55:49,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:49,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:49,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:49,158 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 19:55:49,159 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 19:55:49,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:55:49,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:55:49,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:55:49,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:49,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:55:49,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:50,225 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 19:55:50,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:50,521 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 19:55:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104639013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:55:50,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:55:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2025-04-13 19:55:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482983286] [2025-04-13 19:55:50,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:55:50,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 19:55:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:50,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 19:55:50,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 19:55:50,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:55:50,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 548 transitions, 6764 flow. Second operand has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:50,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:50,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:55:50,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:54,185 INFO L116 PetriNetUnfolderBase]: 11471/15956 cut-off events. [2025-04-13 19:55:54,186 INFO L117 PetriNetUnfolderBase]: For 202564/202564 co-relation queries the response was YES. [2025-04-13 19:55:54,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117071 conditions, 15956 events. 11471/15956 cut-off events. For 202564/202564 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 90744 event pairs, 756 based on Foata normal form. 351/16294 useless extension candidates. Maximal degree in co-relation 116394. Up to 5617 conditions per place. [2025-04-13 19:55:54,327 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 628 selfloop transitions, 203 changer transitions 4/839 dead transitions. [2025-04-13 19:55:54,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 839 transitions, 11897 flow [2025-04-13 19:55:54,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:55:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:55:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 275 transitions. [2025-04-13 19:55:54,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6823821339950372 [2025-04-13 19:55:54,329 INFO L175 Difference]: Start difference. First operand has 173 places, 548 transitions, 6764 flow. Second operand 13 states and 275 transitions. [2025-04-13 19:55:54,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 839 transitions, 11897 flow [2025-04-13 19:55:55,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 839 transitions, 11200 flow, removed 346 selfloop flow, removed 3 redundant places. [2025-04-13 19:55:55,109 INFO L231 Difference]: Finished difference. Result has 189 places, 569 transitions, 7506 flow [2025-04-13 19:55:55,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6039, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7506, PETRI_PLACES=189, PETRI_TRANSITIONS=569} [2025-04-13 19:55:55,111 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 154 predicate places. [2025-04-13 19:55:55,111 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 569 transitions, 7506 flow [2025-04-13 19:55:55,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:55,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:55,111 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:55,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 19:55:55,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 19:55:55,312 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:55:55,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1653591364, now seen corresponding path program 3 times [2025-04-13 19:55:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:55,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787068619] [2025-04-13 19:55:55,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:55,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:55:55,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:55:55,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:55:55,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:55,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:55,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787068619] [2025-04-13 19:55:55,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787068619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:55,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241028927] [2025-04-13 19:55:55,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:55,398 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 19:55:55,399 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 19:55:55,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:55:55,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:55:55,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:55:55,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:55,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:55:55,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:56,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241028927] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:55:56,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:55:56,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:55:56,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607548406] [2025-04-13 19:55:56,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:55:56,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:55:56,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:56,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:55:56,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:55:56,459 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:55:56,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 569 transitions, 7506 flow. Second operand has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:56,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:56,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:55:56,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:56:00,159 INFO L116 PetriNetUnfolderBase]: 14910/20695 cut-off events. [2025-04-13 19:56:00,159 INFO L117 PetriNetUnfolderBase]: For 342277/342277 co-relation queries the response was YES. [2025-04-13 19:56:00,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163333 conditions, 20695 events. 14910/20695 cut-off events. For 342277/342277 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 120779 event pairs, 667 based on Foata normal form. 277/20966 useless extension candidates. Maximal degree in co-relation 161815. Up to 6175 conditions per place. [2025-04-13 19:56:00,340 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 981 selfloop transitions, 187 changer transitions 20/1192 dead transitions. [2025-04-13 19:56:00,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 1192 transitions, 17789 flow [2025-04-13 19:56:00,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:56:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:56:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 270 transitions. [2025-04-13 19:56:00,342 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2025-04-13 19:56:00,342 INFO L175 Difference]: Start difference. First operand has 189 places, 569 transitions, 7506 flow. Second operand 12 states and 270 transitions. [2025-04-13 19:56:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 1192 transitions, 17789 flow [2025-04-13 19:56:01,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1192 transitions, 17378 flow, removed 189 selfloop flow, removed 3 redundant places. [2025-04-13 19:56:01,988 INFO L231 Difference]: Finished difference. Result has 202 places, 631 transitions, 8843 flow [2025-04-13 19:56:01,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=7342, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8843, PETRI_PLACES=202, PETRI_TRANSITIONS=631} [2025-04-13 19:56:01,989 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 167 predicate places. [2025-04-13 19:56:01,989 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 631 transitions, 8843 flow [2025-04-13 19:56:01,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:56:01,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:56:01,992 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:56:01,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 19:56:02,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 19:56:02,192 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:56:02,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:56:02,193 INFO L85 PathProgramCache]: Analyzing trace with hash 30231078, now seen corresponding path program 4 times [2025-04-13 19:56:02,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:56:02,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664237060] [2025-04-13 19:56:02,193 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:56:02,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:56:02,198 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:56:02,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:56:02,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:56:02,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:56:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:56:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:56:02,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664237060] [2025-04-13 19:56:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664237060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:56:02,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340167390] [2025-04-13 19:56:02,293 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:56:02,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:56:02,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:56:02,295 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 19:56:02,297 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 19:56:02,325 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:56:02,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:56:02,406 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:56:02,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:56:02,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:56:02,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:56:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:56:23,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:56:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:56:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340167390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:56:53,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:56:53,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:56:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962790863] [2025-04-13 19:56:53,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:56:53,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:56:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:56:53,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:56:53,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=180, Unknown=12, NotChecked=0, Total=240 [2025-04-13 19:56:53,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:56:53,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 631 transitions, 8843 flow. Second operand has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:56:53,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:56:53,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:56:53,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:57:01,531 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:09,580 INFO L116 PetriNetUnfolderBase]: 14332/19872 cut-off events. [2025-04-13 19:57:09,580 INFO L117 PetriNetUnfolderBase]: For 375941/375941 co-relation queries the response was YES. [2025-04-13 19:57:09,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162239 conditions, 19872 events. 14332/19872 cut-off events. For 375941/375941 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 112574 event pairs, 434 based on Foata normal form. 202/20061 useless extension candidates. Maximal degree in co-relation 160849. Up to 6845 conditions per place. [2025-04-13 19:57:09,783 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 890 selfloop transitions, 190 changer transitions 33/1117 dead transitions. [2025-04-13 19:57:09,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 1117 transitions, 17495 flow [2025-04-13 19:57:09,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:57:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:57:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions. [2025-04-13 19:57:09,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2025-04-13 19:57:09,784 INFO L175 Difference]: Start difference. First operand has 202 places, 631 transitions, 8843 flow. Second operand 11 states and 231 transitions. [2025-04-13 19:57:09,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 1117 transitions, 17495 flow [2025-04-13 19:57:11,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 1117 transitions, 16988 flow, removed 243 selfloop flow, removed 2 redundant places. [2025-04-13 19:57:11,484 INFO L231 Difference]: Finished difference. Result has 212 places, 646 transitions, 9544 flow [2025-04-13 19:57:11,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=8640, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9544, PETRI_PLACES=212, PETRI_TRANSITIONS=646} [2025-04-13 19:57:11,485 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 177 predicate places. [2025-04-13 19:57:11,485 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 646 transitions, 9544 flow [2025-04-13 19:57:11,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:11,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:57:11,485 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:57:11,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 19:57:11,686 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,SelfDestructingSolverStorable15 [2025-04-13 19:57:11,686 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:57:11,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:57:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash -951088126, now seen corresponding path program 4 times [2025-04-13 19:57:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:57:11,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043945415] [2025-04-13 19:57:11,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:57:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:57:11,690 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:57:11,694 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:57:11,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:57:11,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:11,764 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 19:57:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:57:11,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043945415] [2025-04-13 19:57:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043945415] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:57:11,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64863449] [2025-04-13 19:57:11,764 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:57:11,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:57:11,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:57:11,766 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 19:57:11,768 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 19:57:11,798 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:57:12,067 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:57:12,067 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:57:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:12,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:57:12,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:57:14,083 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 19:57:14,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:57:15,009 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 19:57:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64863449] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:57:15,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:57:15,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:57:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481569671] [2025-04-13 19:57:15,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:57:15,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:57:15,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:57:15,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:57:15,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:57:15,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:57:15,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 646 transitions, 9544 flow. Second operand has 16 states, 16 states have (on average 11.4375) internal successors, (183), 16 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:15,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:57:15,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:57:15,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:57:23,044 INFO L116 PetriNetUnfolderBase]: 15204/21081 cut-off events. [2025-04-13 19:57:23,044 INFO L117 PetriNetUnfolderBase]: For 392336/392336 co-relation queries the response was YES. [2025-04-13 19:57:23,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176403 conditions, 21081 events. 15204/21081 cut-off events. For 392336/392336 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 122733 event pairs, 1095 based on Foata normal form. 184/21252 useless extension candidates. Maximal degree in co-relation 174926. Up to 8571 conditions per place. [2025-04-13 19:57:23,269 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 789 selfloop transitions, 221 changer transitions 4/1018 dead transitions. [2025-04-13 19:57:23,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1018 transitions, 16451 flow [2025-04-13 19:57:23,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:57:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:57:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 251 transitions. [2025-04-13 19:57:23,270 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7360703812316716 [2025-04-13 19:57:23,270 INFO L175 Difference]: Start difference. First operand has 212 places, 646 transitions, 9544 flow. Second operand 11 states and 251 transitions. [2025-04-13 19:57:23,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1018 transitions, 16451 flow [2025-04-13 19:57:25,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 1018 transitions, 15627 flow, removed 230 selfloop flow, removed 4 redundant places. [2025-04-13 19:57:25,565 INFO L231 Difference]: Finished difference. Result has 222 places, 655 transitions, 9850 flow [2025-04-13 19:57:25,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=9028, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9850, PETRI_PLACES=222, PETRI_TRANSITIONS=655} [2025-04-13 19:57:25,566 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 187 predicate places. [2025-04-13 19:57:25,566 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 655 transitions, 9850 flow [2025-04-13 19:57:25,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.4375) internal successors, (183), 16 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:25,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:57:25,566 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:57:25,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 19:57:25,766 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,SelfDestructingSolverStorable16 [2025-04-13 19:57:25,767 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:57:25,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:57:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1460114436, now seen corresponding path program 5 times [2025-04-13 19:57:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:57:25,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475138145] [2025-04-13 19:57:25,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:57:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:57:25,772 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:57:25,775 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:57:25,775 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:57:25,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:25,838 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 19:57:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:57:25,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475138145] [2025-04-13 19:57:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475138145] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:57:25,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520578829] [2025-04-13 19:57:25,838 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:57:25,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:57:25,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:57:25,840 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 19:57:25,842 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 19:57:25,873 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:57:25,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:57:25,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:57:25,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:25,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:57:25,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:57:27,358 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 19:57:27,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:57:28,110 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 19:57:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520578829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:57:28,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:57:28,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-04-13 19:57:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222983323] [2025-04-13 19:57:28,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:57:28,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:57:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:57:28,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:57:28,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-04-13 19:57:28,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:57:28,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 655 transitions, 9850 flow. Second operand has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:28,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:57:28,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:57:28,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:57:30,827 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:35,058 INFO L116 PetriNetUnfolderBase]: 15926/22082 cut-off events. [2025-04-13 19:57:35,058 INFO L117 PetriNetUnfolderBase]: For 436293/436293 co-relation queries the response was YES. [2025-04-13 19:57:35,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187806 conditions, 22082 events. 15926/22082 cut-off events. For 436293/436293 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 128208 event pairs, 1888 based on Foata normal form. 188/22257 useless extension candidates. Maximal degree in co-relation 186474. Up to 8888 conditions per place. [2025-04-13 19:57:35,288 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 752 selfloop transitions, 240 changer transitions 5/1001 dead transitions. [2025-04-13 19:57:35,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 1001 transitions, 16694 flow [2025-04-13 19:57:35,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:57:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:57:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2025-04-13 19:57:35,289 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6686217008797654 [2025-04-13 19:57:35,289 INFO L175 Difference]: Start difference. First operand has 222 places, 655 transitions, 9850 flow. Second operand 11 states and 228 transitions. [2025-04-13 19:57:35,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 1001 transitions, 16694 flow [2025-04-13 19:57:37,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1001 transitions, 16130 flow, removed 85 selfloop flow, removed 5 redundant places. [2025-04-13 19:57:37,551 INFO L231 Difference]: Finished difference. Result has 230 places, 662 transitions, 10321 flow [2025-04-13 19:57:37,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=9402, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10321, PETRI_PLACES=230, PETRI_TRANSITIONS=662} [2025-04-13 19:57:37,551 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 195 predicate places. [2025-04-13 19:57:37,551 INFO L485 AbstractCegarLoop]: Abstraction has has 230 places, 662 transitions, 10321 flow [2025-04-13 19:57:37,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:37,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:57:37,552 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:57:37,558 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 19:57:37,752 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,SelfDestructingSolverStorable17 [2025-04-13 19:57:37,752 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:57:37,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:57:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash 477504953, now seen corresponding path program 6 times [2025-04-13 19:57:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:57:37,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138400692] [2025-04-13 19:57:37,753 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:57:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:57:37,763 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:57:37,772 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:57:37,772 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:57:37,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:37,855 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 19:57:37,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:57:37,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138400692] [2025-04-13 19:57:37,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138400692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:57:37,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337984061] [2025-04-13 19:57:37,855 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:57:37,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:57:37,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:57:37,857 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 19:57:37,860 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 19:57:37,887 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:57:38,203 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:57:38,203 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:57:38,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:38,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:57:38,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:57:38,702 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 19:57:38,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:57:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:57:39,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337984061] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:57:39,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:57:39,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-04-13 19:57:39,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480840762] [2025-04-13 19:57:39,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:57:39,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:57:39,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:57:39,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:57:39,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-04-13 19:57:39,063 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:57:39,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 662 transitions, 10321 flow. Second operand has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:39,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:57:39,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:57:39,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:57:44,736 INFO L116 PetriNetUnfolderBase]: 20588/28749 cut-off events. [2025-04-13 19:57:44,736 INFO L117 PetriNetUnfolderBase]: For 675855/675855 co-relation queries the response was YES. [2025-04-13 19:57:44,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259556 conditions, 28749 events. 20588/28749 cut-off events. For 675855/675855 co-relation queries the response was YES. Maximal size of possible extension queue 1500. Compared 175560 event pairs, 1665 based on Foata normal form. 264/29000 useless extension candidates. Maximal degree in co-relation 257672. Up to 11062 conditions per place. [2025-04-13 19:57:45,057 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 801 selfloop transitions, 352 changer transitions 10/1167 dead transitions. [2025-04-13 19:57:45,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1167 transitions, 19909 flow [2025-04-13 19:57:45,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 19:57:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 19:57:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 287 transitions. [2025-04-13 19:57:45,058 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2025-04-13 19:57:45,058 INFO L175 Difference]: Start difference. First operand has 230 places, 662 transitions, 10321 flow. Second operand 14 states and 287 transitions. [2025-04-13 19:57:45,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1167 transitions, 19909 flow [2025-04-13 19:57:48,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 1167 transitions, 19489 flow, removed 62 selfloop flow, removed 5 redundant places. [2025-04-13 19:57:48,525 INFO L231 Difference]: Finished difference. Result has 245 places, 775 transitions, 13315 flow [2025-04-13 19:57:48,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=9899, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13315, PETRI_PLACES=245, PETRI_TRANSITIONS=775} [2025-04-13 19:57:48,526 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 210 predicate places. [2025-04-13 19:57:48,526 INFO L485 AbstractCegarLoop]: Abstraction has has 245 places, 775 transitions, 13315 flow [2025-04-13 19:57:48,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:48,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:57:48,526 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:57:48,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 19:57:48,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:57:48,727 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:57:48,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:57:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1379605783, now seen corresponding path program 7 times [2025-04-13 19:57:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:57:48,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288971905] [2025-04-13 19:57:48,728 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:57:48,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:57:48,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 19:57:48,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:57:48,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:57:48,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:57:48,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:57:48,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288971905] [2025-04-13 19:57:48,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288971905] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:57:48,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113952620] [2025-04-13 19:57:48,810 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:57:48,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:57:48,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:57:48,812 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 19:57:48,813 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 19:57:48,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 19:57:49,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:57:49,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:57:49,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:49,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:57:49,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:58:01,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:58:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113952620] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:58:15,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:58:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:58:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786730060] [2025-04-13 19:58:15,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:58:15,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:58:15,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:15,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:58:15,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=188, Unknown=6, NotChecked=0, Total=240 [2025-04-13 19:58:15,196 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:58:15,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 775 transitions, 13315 flow. Second operand has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:15,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:15,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:58:15,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:22,812 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:28,132 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:32,799 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:42,478 INFO L116 PetriNetUnfolderBase]: 19541/27245 cut-off events. [2025-04-13 19:58:42,479 INFO L117 PetriNetUnfolderBase]: For 714379/714379 co-relation queries the response was YES. [2025-04-13 19:58:42,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259084 conditions, 27245 events. 19541/27245 cut-off events. For 714379/714379 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 163062 event pairs, 539 based on Foata normal form. 190/27422 useless extension candidates. Maximal degree in co-relation 257407. Up to 9882 conditions per place. [2025-04-13 19:58:42,837 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 1121 selfloop transitions, 217 changer transitions 57/1399 dead transitions. [2025-04-13 19:58:42,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1399 transitions, 24805 flow [2025-04-13 19:58:42,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:58:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:58:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 311 transitions. [2025-04-13 19:58:42,838 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6270161290322581 [2025-04-13 19:58:42,838 INFO L175 Difference]: Start difference. First operand has 245 places, 775 transitions, 13315 flow. Second operand 16 states and 311 transitions. [2025-04-13 19:58:42,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 1399 transitions, 24805 flow [2025-04-13 19:58:47,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1399 transitions, 24216 flow, removed 258 selfloop flow, removed 5 redundant places. [2025-04-13 19:58:47,152 INFO L231 Difference]: Finished difference. Result has 259 places, 795 transitions, 13899 flow [2025-04-13 19:58:47,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=12784, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=13899, PETRI_PLACES=259, PETRI_TRANSITIONS=795} [2025-04-13 19:58:47,153 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 224 predicate places. [2025-04-13 19:58:47,153 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 795 transitions, 13899 flow [2025-04-13 19:58:47,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:47,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:47,153 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:47,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 19:58:47,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:47,353 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:58:47,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1210638198, now seen corresponding path program 8 times [2025-04-13 19:58:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:47,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639958565] [2025-04-13 19:58:47,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:47,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:58:47,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:58:47,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:47,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:47,430 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 19:58:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:47,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639958565] [2025-04-13 19:58:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639958565] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:47,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009687497] [2025-04-13 19:58:47,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:47,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:47,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:47,433 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 19:58:47,434 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 19:58:47,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:58:47,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:58:47,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:47,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:47,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:58:47,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:48,342 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 19:58:48,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:49,032 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 19:58:49,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009687497] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:58:49,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:58:49,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-13 19:58:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730536191] [2025-04-13 19:58:49,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:58:49,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:58:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:49,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:58:49,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:58:49,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:58:49,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 795 transitions, 13899 flow. Second operand has 16 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:49,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:49,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:58:49,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:53,811 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:59:00,303 INFO L116 PetriNetUnfolderBase]: 18750/26009 cut-off events. [2025-04-13 19:59:00,303 INFO L117 PetriNetUnfolderBase]: For 724863/724863 co-relation queries the response was YES. [2025-04-13 19:59:00,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252104 conditions, 26009 events. 18750/26009 cut-off events. For 724863/724863 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 154757 event pairs, 1975 based on Foata normal form. 612/26608 useless extension candidates. Maximal degree in co-relation 251292. Up to 14347 conditions per place. [2025-04-13 19:59:00,609 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 802 selfloop transitions, 230 changer transitions 4/1040 dead transitions. [2025-04-13 19:59:00,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 1040 transitions, 19639 flow [2025-04-13 19:59:00,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:59:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 19:59:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 291 transitions. [2025-04-13 19:59:00,610 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6258064516129033 [2025-04-13 19:59:00,610 INFO L175 Difference]: Start difference. First operand has 259 places, 795 transitions, 13899 flow. Second operand 15 states and 291 transitions. [2025-04-13 19:59:00,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 1040 transitions, 19639 flow [2025-04-13 19:59:04,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1040 transitions, 18819 flow, removed 324 selfloop flow, removed 9 redundant places. [2025-04-13 19:59:04,355 INFO L231 Difference]: Finished difference. Result has 265 places, 726 transitions, 13043 flow [2025-04-13 19:59:04,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=11716, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13043, PETRI_PLACES=265, PETRI_TRANSITIONS=726} [2025-04-13 19:59:04,355 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 230 predicate places. [2025-04-13 19:59:04,356 INFO L485 AbstractCegarLoop]: Abstraction has has 265 places, 726 transitions, 13043 flow [2025-04-13 19:59:04,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:04,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:04,356 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:04,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 19:59:04,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:04,556 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:59:04,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash 755707873, now seen corresponding path program 5 times [2025-04-13 19:59:04,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:04,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897096414] [2025-04-13 19:59:04,557 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:04,560 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:59:04,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:59:04,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:59:04,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:04,626 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 19:59:04,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:04,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897096414] [2025-04-13 19:59:04,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897096414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:04,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801624972] [2025-04-13 19:59:04,626 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:04,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:04,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:04,630 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 19:59:04,630 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 19:59:04,660 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:59:04,735 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:59:04,735 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:59:04,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:04,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:59:04,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:34,378 WARN L286 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:59:43,430 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:59:53,361 WARN L286 SmtUtils]: Spent 9.93s on a formula simplification. DAG size of input: 10 DAG size of output: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:59:53,947 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 19:59:53,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:00:42,134 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:00:42,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801624972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:00:42,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:00:42,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-04-13 20:00:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721994654] [2025-04-13 20:00:42,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:00:42,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:00:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:42,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:00:42,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=189, Unknown=12, NotChecked=0, Total=272 [2025-04-13 20:00:42,136 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:00:42,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 726 transitions, 13043 flow. Second operand has 17 states, 17 states have (on average 11.352941176470589) internal successors, (193), 17 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:00:42,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:42,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:00:42,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:01:37,181 WARN L286 SmtUtils]: Spent 54.53s on a formula simplification. DAG size of input: 52 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:01:45,279 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:01:57,763 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:00,025 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:04,028 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:08,288 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:30,614 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:02:31,813 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:35,814 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:37,407 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:42,929 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:45,727 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:48,007 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:59,719 WARN L286 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 61 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2025-04-13 20:04:17,559 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:04:17,570 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:04:18,566 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:04:18,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 20:04:18,677 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 20:04:18,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 20:04:18,678 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-13 20:04:18,691 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 20:04:18,691 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 20:04:18,691 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 20:04:18,691 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 20:04:18,691 INFO L422 BasicCegarLoop]: Path program histogram: [8, 5, 2, 2, 2, 2, 1] [2025-04-13 20:04:18,695 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:04:18,695 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:04:18,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 [2025-04-13 20:04:18,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:04:18 BasicIcfg [2025-04-13 20:04:18,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:04:18,707 INFO L158 Benchmark]: Toolchain (without parser) took 866451.74ms. Allocated memory was 125.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 87.5MB in the beginning and 319.0MB in the end (delta: -231.5MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-13 20:04:18,707 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:04:18,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.07ms. Allocated memory is still 125.8MB. Free memory was 87.5MB in the beginning and 72.6MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:04:18,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.06ms. Allocated memory is still 125.8MB. Free memory was 72.6MB in the beginning and 71.3MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:04:18,707 INFO L158 Benchmark]: Boogie Preprocessor took 43.95ms. Allocated memory is still 125.8MB. Free memory was 71.3MB in the beginning and 69.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:04:18,710 INFO L158 Benchmark]: RCFGBuilder took 373.34ms. Allocated memory is still 125.8MB. Free memory was 69.5MB in the beginning and 38.7MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 20:04:18,711 INFO L158 Benchmark]: TraceAbstraction took 865778.19ms. Allocated memory was 125.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 37.8MB in the beginning and 319.0MB in the end (delta: -281.2MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 20:04:18,712 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.16ms. Allocated memory is still 167.8MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.07ms. Allocated memory is still 125.8MB. Free memory was 87.5MB in the beginning and 72.6MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.06ms. Allocated memory is still 125.8MB. Free memory was 72.6MB in the beginning and 71.3MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.95ms. Allocated memory is still 125.8MB. Free memory was 71.3MB in the beginning and 69.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 373.34ms. Allocated memory is still 125.8MB. Free memory was 69.5MB in the beginning and 38.7MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 865778.19ms. Allocated memory was 125.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 37.8MB in the beginning and 319.0MB in the end (delta: -281.2MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 44 locations, 51 edges, 5 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: 865.7s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 519.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 2142 SdHoareTripleChecker+Valid, 210.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2142 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 209.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9172 IncrementalHoareTripleChecker+Invalid, 9428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 0 mSDtfsCounter, 9172 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 972 GetRequests, 668 SyntacticMatches, 13 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 421.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13899occurred in iteration=20, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 339.9s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1297 ConstructedInterpolants, 0 QuantifiedInterpolants, 21254 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2701 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 56 InterpolantComputations, 5 PerfectInterpolantSequences, 18/139 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