/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:16:36,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:16:36,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:16:36,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:16:36,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:16:36,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:16:36,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:16:36,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:16:36,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:16:36,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:16:36,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:16:36,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:16:36,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:16:36,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:16:36,622 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:16:36,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:16:36,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:16:36,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:36,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:36,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:16:36,624 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:16:36,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:16:36,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:16:36,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:16:36,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:16:36,868 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:16:36,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2025-04-13 20:16:38,202 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d731c7f/305d3768a3d64b98abf234a01a1b759c/FLAGee29263d0 [2025-04-13 20:16:38,379 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:16:38,379 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2025-04-13 20:16:38,384 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d731c7f/305d3768a3d64b98abf234a01a1b759c/FLAGee29263d0 [2025-04-13 20:16:39,252 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d731c7f/305d3768a3d64b98abf234a01a1b759c [2025-04-13 20:16:39,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:16:39,255 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:16:39,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:16:39,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:16:39,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:16:39,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30101243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39, skipping insertion in model container [2025-04-13 20:16:39,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:16:39,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c[2257,2270] [2025-04-13 20:16:39,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:16:39,461 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:16:39,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c[2257,2270] [2025-04-13 20:16:39,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:16:39,502 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:16:39,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39 WrapperNode [2025-04-13 20:16:39,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:16:39,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:16:39,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:16:39,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:16:39,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,528 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-04-13 20:16:39,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:16:39,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:16:39,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:16:39,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:16:39,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,555 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:16:39,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:16:39,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:16:39,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:16:39,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:16:39,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (1/1) ... [2025-04-13 20:16:39,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:39,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:16:39,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:16:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:16:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:16:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:16:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:16:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:16:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:16:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:16:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:16:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:16:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:16:39,612 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:16:39,680 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:16:39,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:16:39,818 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:16:39,818 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:16:39,818 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:16:39,909 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:39,915 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:39,927 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:16:39,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:16:39 BoogieIcfgContainer [2025-04-13 20:16:39,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:16:39,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:16:39,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:16:39,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:16:39,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:16:39" (1/3) ... [2025-04-13 20:16:39,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486eb04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:16:39, skipping insertion in model container [2025-04-13 20:16:39,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:39" (2/3) ... [2025-04-13 20:16:39,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486eb04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:16:39, skipping insertion in model container [2025-04-13 20:16:39,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:16:39" (3/3) ... [2025-04-13 20:16:39,938 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2025-04-13 20:16:39,947 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:16:39,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 32 locations, 38 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 20:16:39,948 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:16:39,991 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:16:40,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 103 flow [2025-04-13 20:16:40,043 INFO L116 PetriNetUnfolderBase]: 10/38 cut-off events. [2025-04-13 20:16:40,045 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:16:40,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 10/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 47 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2025-04-13 20:16:40,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 103 flow [2025-04-13 20:16:40,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 37 transitions, 92 flow [2025-04-13 20:16:40,060 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:16:40,068 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;@71a2f4f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:16:40,069 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:16:40,084 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:16:40,084 INFO L116 PetriNetUnfolderBase]: 10/36 cut-off events. [2025-04-13 20:16:40,084 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:16:40,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:40,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:40,085 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:40,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash -704103349, now seen corresponding path program 1 times [2025-04-13 20:16:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:40,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780083799] [2025-04-13 20:16:40,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:40,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:40,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:40,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:40,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:40,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780083799] [2025-04-13 20:16:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780083799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:40,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975799121] [2025-04-13 20:16:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:40,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:40,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:40,550 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-04-13 20:16:40,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 20:16:40,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:40,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-04-13 20:16:40,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:40,918 INFO L116 PetriNetUnfolderBase]: 1690/2279 cut-off events. [2025-04-13 20:16:40,918 INFO L117 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-04-13 20:16:40,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 2279 events. 1690/2279 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8295 event pairs, 206 based on Foata normal form. 0/1467 useless extension candidates. Maximal degree in co-relation 4377. Up to 1158 conditions per place. [2025-04-13 20:16:40,931 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 56 selfloop transitions, 6 changer transitions 27/92 dead transitions. [2025-04-13 20:16:40,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 92 transitions, 404 flow [2025-04-13 20:16:40,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-04-13 20:16:40,941 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.624390243902439 [2025-04-13 20:16:40,942 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 92 flow. Second operand 5 states and 128 transitions. [2025-04-13 20:16:40,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 92 transitions, 404 flow [2025-04-13 20:16:40,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 92 transitions, 376 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:16:40,952 INFO L231 Difference]: Finished difference. Result has 38 places, 40 transitions, 133 flow [2025-04-13 20:16:40,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=38, PETRI_TRANSITIONS=40} [2025-04-13 20:16:40,956 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-04-13 20:16:40,957 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 40 transitions, 133 flow [2025-04-13 20:16:40,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 20:16:40,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:40,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:40,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:16:40,957 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:40,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1775557869, now seen corresponding path program 2 times [2025-04-13 20:16:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:40,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550649768] [2025-04-13 20:16:40,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:40,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:40,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:40,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:40,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:41,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:41,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550649768] [2025-04-13 20:16:41,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550649768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:41,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:41,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745921663] [2025-04-13 20:16:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:41,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:41,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:41,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:41,027 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-13 20:16:41,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:41,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:41,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-13 20:16:41,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:41,216 INFO L116 PetriNetUnfolderBase]: 1300/1812 cut-off events. [2025-04-13 20:16:41,216 INFO L117 PetriNetUnfolderBase]: For 1145/1153 co-relation queries the response was YES. [2025-04-13 20:16:41,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4107 conditions, 1812 events. 1300/1812 cut-off events. For 1145/1153 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7033 event pairs, 301 based on Foata normal form. 231/1535 useless extension candidates. Maximal degree in co-relation 3196. Up to 1293 conditions per place. [2025-04-13 20:16:41,224 INFO L140 encePairwiseOnDemand]: 24/41 looper letters, 34 selfloop transitions, 6 changer transitions 9/55 dead transitions. [2025-04-13 20:16:41,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 266 flow [2025-04-13 20:16:41,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-04-13 20:16:41,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6178861788617886 [2025-04-13 20:16:41,226 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 133 flow. Second operand 3 states and 76 transitions. [2025-04-13 20:16:41,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 266 flow [2025-04-13 20:16:41,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:41,230 INFO L231 Difference]: Finished difference. Result has 40 places, 43 transitions, 184 flow [2025-04-13 20:16:41,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=40, PETRI_TRANSITIONS=43} [2025-04-13 20:16:41,231 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-04-13 20:16:41,231 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 43 transitions, 184 flow [2025-04-13 20:16:41,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:41,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:41,232 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 20:16:41,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:16:41,232 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:41,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash -313119985, now seen corresponding path program 1 times [2025-04-13 20:16:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:41,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104030980] [2025-04-13 20:16:41,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:41,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:16:41,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:16:41,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:41,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:41,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:41,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104030980] [2025-04-13 20:16:41,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104030980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:41,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:41,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462358738] [2025-04-13 20:16:41,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:41,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:41,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:41,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:41,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-04-13 20:16:41,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 43 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:16:41,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:41,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-04-13 20:16:41,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:41,381 INFO L116 PetriNetUnfolderBase]: 710/1103 cut-off events. [2025-04-13 20:16:41,382 INFO L117 PetriNetUnfolderBase]: For 1031/1044 co-relation queries the response was YES. [2025-04-13 20:16:41,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 1103 events. 710/1103 cut-off events. For 1031/1044 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4542 event pairs, 225 based on Foata normal form. 2/913 useless extension candidates. Maximal degree in co-relation 2304. Up to 523 conditions per place. [2025-04-13 20:16:41,391 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 41 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-04-13 20:16:41,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 311 flow [2025-04-13 20:16:41,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-04-13 20:16:41,392 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-04-13 20:16:41,392 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 184 flow. Second operand 3 states and 75 transitions. [2025-04-13 20:16:41,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 311 flow [2025-04-13 20:16:41,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 289 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-13 20:16:41,395 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 156 flow [2025-04-13 20:16:41,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=38, PETRI_TRANSITIONS=39} [2025-04-13 20:16:41,396 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-04-13 20:16:41,396 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 156 flow [2025-04-13 20:16:41,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:16:41,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:41,396 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 20:16:41,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:16:41,396 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:41,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1159594410, now seen corresponding path program 1 times [2025-04-13 20:16:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:41,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366892375] [2025-04-13 20:16:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:41,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:16:41,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:16:41,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:41,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:41,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366892375] [2025-04-13 20:16:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366892375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:41,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:41,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116460909] [2025-04-13 20:16:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:41,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:41,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:41,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:41,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:41,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-04-13 20:16:41,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:16:41,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:41,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-04-13 20:16:41,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:41,583 INFO L116 PetriNetUnfolderBase]: 703/1142 cut-off events. [2025-04-13 20:16:41,584 INFO L117 PetriNetUnfolderBase]: For 902/915 co-relation queries the response was YES. [2025-04-13 20:16:41,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 1142 events. 703/1142 cut-off events. For 902/915 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4982 event pairs, 274 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 1624. Up to 521 conditions per place. [2025-04-13 20:16:41,590 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 47 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-04-13 20:16:41,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 342 flow [2025-04-13 20:16:41,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-04-13 20:16:41,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6260162601626016 [2025-04-13 20:16:41,591 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 156 flow. Second operand 3 states and 77 transitions. [2025-04-13 20:16:41,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 342 flow [2025-04-13 20:16:41,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:41,594 INFO L231 Difference]: Finished difference. Result has 39 places, 40 transitions, 168 flow [2025-04-13 20:16:41,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=39, PETRI_TRANSITIONS=40} [2025-04-13 20:16:41,594 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2025-04-13 20:16:41,594 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 40 transitions, 168 flow [2025-04-13 20:16:41,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:16:41,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:41,594 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 20:16:41,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:16:41,595 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:41,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1161223242, now seen corresponding path program 1 times [2025-04-13 20:16:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:41,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085049700] [2025-04-13 20:16:41,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:41,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:16:41,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:16:41,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:41,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:41,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085049700] [2025-04-13 20:16:41,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085049700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:41,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243496102] [2025-04-13 20:16:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:41,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:16:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:41,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:16:41,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:16:41,777 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-13 20:16:41,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 40 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:16:41,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:41,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-13 20:16:41,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:42,072 INFO L116 PetriNetUnfolderBase]: 1742/2635 cut-off events. [2025-04-13 20:16:42,073 INFO L117 PetriNetUnfolderBase]: For 2031/2031 co-relation queries the response was YES. [2025-04-13 20:16:42,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7810 conditions, 2635 events. 1742/2635 cut-off events. For 2031/2031 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11754 event pairs, 292 based on Foata normal form. 136/2647 useless extension candidates. Maximal degree in co-relation 3221. Up to 1279 conditions per place. [2025-04-13 20:16:42,083 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 54 selfloop transitions, 11 changer transitions 40/107 dead transitions. [2025-04-13 20:16:42,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 107 transitions, 642 flow [2025-04-13 20:16:42,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:16:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:16:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-04-13 20:16:42,084 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49477351916376305 [2025-04-13 20:16:42,084 INFO L175 Difference]: Start difference. First operand has 39 places, 40 transitions, 168 flow. Second operand 7 states and 142 transitions. [2025-04-13 20:16:42,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 107 transitions, 642 flow [2025-04-13 20:16:42,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 107 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:42,087 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 261 flow [2025-04-13 20:16:42,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2025-04-13 20:16:42,088 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2025-04-13 20:16:42,088 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 261 flow [2025-04-13 20:16:42,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:16:42,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:42,088 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 20:16:42,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:16:42,088 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:42,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1808701893, now seen corresponding path program 1 times [2025-04-13 20:16:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:42,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086577336] [2025-04-13 20:16:42,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:42,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:16:42,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:16:42,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:42,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:42,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:42,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086577336] [2025-04-13 20:16:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086577336] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:42,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741538569] [2025-04-13 20:16:42,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:42,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:42,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:42,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:42,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:16:42,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:16:42,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:16:42,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:42,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:42,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:16:42,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:42,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:42,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741538569] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:42,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:42,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 6] total 12 [2025-04-13 20:16:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161003985] [2025-04-13 20:16:42,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:42,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:16:42,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:42,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:16:42,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:16:42,513 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-13 20:16:42,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 261 flow. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:42,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:42,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-13 20:16:42,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:42,915 INFO L116 PetriNetUnfolderBase]: 1388/2183 cut-off events. [2025-04-13 20:16:42,916 INFO L117 PetriNetUnfolderBase]: For 5467/5467 co-relation queries the response was YES. [2025-04-13 20:16:42,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8262 conditions, 2183 events. 1388/2183 cut-off events. For 5467/5467 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10287 event pairs, 136 based on Foata normal form. 148/2231 useless extension candidates. Maximal degree in co-relation 7091. Up to 798 conditions per place. [2025-04-13 20:16:42,926 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 74 selfloop transitions, 27 changer transitions 5/108 dead transitions. [2025-04-13 20:16:42,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 830 flow [2025-04-13 20:16:42,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:16:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:16:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-04-13 20:16:42,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36341463414634145 [2025-04-13 20:16:42,927 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 261 flow. Second operand 10 states and 149 transitions. [2025-04-13 20:16:42,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 830 flow [2025-04-13 20:16:42,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 778 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:42,936 INFO L231 Difference]: Finished difference. Result has 58 places, 66 transitions, 552 flow [2025-04-13 20:16:42,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=552, PETRI_PLACES=58, PETRI_TRANSITIONS=66} [2025-04-13 20:16:42,937 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2025-04-13 20:16:42,937 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 66 transitions, 552 flow [2025-04-13 20:16:42,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:42,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:42,937 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:42,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:16:43,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:16:43,138 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:43,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash 900194576, now seen corresponding path program 1 times [2025-04-13 20:16:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:43,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043696737] [2025-04-13 20:16:43,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:43,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:16:43,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:43,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:43,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:43,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043696737] [2025-04-13 20:16:43,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043696737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:43,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:43,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:43,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029278751] [2025-04-13 20:16:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:43,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:43,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:43,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:43,202 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-04-13 20:16:43,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 20:16:43,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:43,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-04-13 20:16:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:43,315 INFO L116 PetriNetUnfolderBase]: 810/1323 cut-off events. [2025-04-13 20:16:43,316 INFO L117 PetriNetUnfolderBase]: For 5673/5849 co-relation queries the response was YES. [2025-04-13 20:16:43,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 1323 events. 810/1323 cut-off events. For 5673/5849 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6147 event pairs, 257 based on Foata normal form. 32/1227 useless extension candidates. Maximal degree in co-relation 3839. Up to 709 conditions per place. [2025-04-13 20:16:43,324 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 49 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2025-04-13 20:16:43,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 696 flow [2025-04-13 20:16:43,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-13 20:16:43,325 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2025-04-13 20:16:43,325 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 552 flow. Second operand 3 states and 66 transitions. [2025-04-13 20:16:43,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 696 flow [2025-04-13 20:16:43,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 602 flow, removed 38 selfloop flow, removed 5 redundant places. [2025-04-13 20:16:43,334 INFO L231 Difference]: Finished difference. Result has 55 places, 61 transitions, 435 flow [2025-04-13 20:16:43,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=55, PETRI_TRANSITIONS=61} [2025-04-13 20:16:43,335 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2025-04-13 20:16:43,335 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 61 transitions, 435 flow [2025-04-13 20:16:43,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 20:16:43,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:43,335 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:43,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:16:43,335 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:43,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash -759361026, now seen corresponding path program 2 times [2025-04-13 20:16:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:43,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194759769] [2025-04-13 20:16:43,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:43,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:16:43,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:43,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:16:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:43,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194759769] [2025-04-13 20:16:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194759769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457908746] [2025-04-13 20:16:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:43,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:43,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:43,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:43,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:43,429 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-04-13 20:16:43,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 61 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:16:43,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:43,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-04-13 20:16:43,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:43,529 INFO L116 PetriNetUnfolderBase]: 705/1183 cut-off events. [2025-04-13 20:16:43,529 INFO L117 PetriNetUnfolderBase]: For 3757/3839 co-relation queries the response was YES. [2025-04-13 20:16:43,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4767 conditions, 1183 events. 705/1183 cut-off events. For 3757/3839 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5258 event pairs, 237 based on Foata normal form. 5/1134 useless extension candidates. Maximal degree in co-relation 3780. Up to 586 conditions per place. [2025-04-13 20:16:43,536 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 53 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2025-04-13 20:16:43,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 78 transitions, 670 flow [2025-04-13 20:16:43,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-13 20:16:43,537 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2025-04-13 20:16:43,537 INFO L175 Difference]: Start difference. First operand has 55 places, 61 transitions, 435 flow. Second operand 3 states and 68 transitions. [2025-04-13 20:16:43,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 78 transitions, 670 flow [2025-04-13 20:16:43,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 636 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-13 20:16:43,541 INFO L231 Difference]: Finished difference. Result has 54 places, 58 transitions, 404 flow [2025-04-13 20:16:43,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=54, PETRI_TRANSITIONS=58} [2025-04-13 20:16:43,542 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2025-04-13 20:16:43,542 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 404 flow [2025-04-13 20:16:43,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:16:43,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:43,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:43,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:16:43,542 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:43,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -252613704, now seen corresponding path program 1 times [2025-04-13 20:16:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:43,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343381557] [2025-04-13 20:16:43,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:43,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:16:43,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:16:43,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:43,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:43,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343381557] [2025-04-13 20:16:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343381557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:43,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775398960] [2025-04-13 20:16:43,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:43,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:43,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:16:43,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:16:43,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:16:43,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:43,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:43,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:16:43,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:43,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:43,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775398960] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:43,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:43,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2025-04-13 20:16:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807647557] [2025-04-13 20:16:43,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:43,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:16:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:43,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:16:43,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:16:43,894 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-13 20:16:43,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 404 flow. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:43,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:43,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-13 20:16:43,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:44,293 INFO L116 PetriNetUnfolderBase]: 1314/2127 cut-off events. [2025-04-13 20:16:44,294 INFO L117 PetriNetUnfolderBase]: For 6187/6187 co-relation queries the response was YES. [2025-04-13 20:16:44,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8289 conditions, 2127 events. 1314/2127 cut-off events. For 6187/6187 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9687 event pairs, 110 based on Foata normal form. 184/2311 useless extension candidates. Maximal degree in co-relation 6552. Up to 465 conditions per place. [2025-04-13 20:16:44,305 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 78 selfloop transitions, 43 changer transitions 25/148 dead transitions. [2025-04-13 20:16:44,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 148 transitions, 1188 flow [2025-04-13 20:16:44,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:16:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:16:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 201 transitions. [2025-04-13 20:16:44,306 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32682926829268294 [2025-04-13 20:16:44,306 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 404 flow. Second operand 15 states and 201 transitions. [2025-04-13 20:16:44,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 148 transitions, 1188 flow [2025-04-13 20:16:44,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 148 transitions, 1157 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:44,312 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 776 flow [2025-04-13 20:16:44,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=776, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2025-04-13 20:16:44,312 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2025-04-13 20:16:44,313 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 776 flow [2025-04-13 20:16:44,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:44,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:44,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:44,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:16:44,513 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,SelfDestructingSolverStorable8 [2025-04-13 20:16:44,513 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:44,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 344180822, now seen corresponding path program 2 times [2025-04-13 20:16:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:44,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783246790] [2025-04-13 20:16:44,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:44,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:16:44,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:16:44,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:16:44,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:44,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783246790] [2025-04-13 20:16:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783246790] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:44,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880346861] [2025-04-13 20:16:44,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:44,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:44,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:44,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:44,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:16:44,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:16:44,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:16:44,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:16:44,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:44,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:16:44,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:44,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880346861] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:44,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:44,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2025-04-13 20:16:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716135593] [2025-04-13 20:16:44,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:44,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:16:44,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:44,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:16:44,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:16:44,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-13 20:16:44,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 776 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:16:44,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:44,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-13 20:16:44,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:45,122 INFO L116 PetriNetUnfolderBase]: 1906/3047 cut-off events. [2025-04-13 20:16:45,122 INFO L117 PetriNetUnfolderBase]: For 19224/19224 co-relation queries the response was YES. [2025-04-13 20:16:45,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14574 conditions, 3047 events. 1906/3047 cut-off events. For 19224/19224 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14884 event pairs, 220 based on Foata normal form. 176/3223 useless extension candidates. Maximal degree in co-relation 14160. Up to 928 conditions per place. [2025-04-13 20:16:45,138 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 94 selfloop transitions, 56 changer transitions 31/183 dead transitions. [2025-04-13 20:16:45,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 183 transitions, 2030 flow [2025-04-13 20:16:45,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:16:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:16:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2025-04-13 20:16:45,140 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33739837398373984 [2025-04-13 20:16:45,140 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 776 flow. Second operand 12 states and 166 transitions. [2025-04-13 20:16:45,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 183 transitions, 2030 flow [2025-04-13 20:16:45,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 183 transitions, 1813 flow, removed 89 selfloop flow, removed 8 redundant places. [2025-04-13 20:16:45,158 INFO L231 Difference]: Finished difference. Result has 80 places, 116 transitions, 1348 flow [2025-04-13 20:16:45,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1348, PETRI_PLACES=80, PETRI_TRANSITIONS=116} [2025-04-13 20:16:45,158 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2025-04-13 20:16:45,158 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 116 transitions, 1348 flow [2025-04-13 20:16:45,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:16:45,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:45,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:45,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:16:45,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:45,363 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:45,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash -65372094, now seen corresponding path program 3 times [2025-04-13 20:16:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:45,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931604499] [2025-04-13 20:16:45,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:16:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:45,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:16:45,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:16:45,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:16:45,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:45,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:45,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931604499] [2025-04-13 20:16:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931604499] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:45,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474221455] [2025-04-13 20:16:45,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:16:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:45,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:45,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:16:45,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:16:45,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:16:45,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:16:45,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:45,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:16:45,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:45,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474221455] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:45,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:45,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 10 [2025-04-13 20:16:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416752432] [2025-04-13 20:16:45,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:45,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:16:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:45,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:16:45,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:16:45,619 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-13 20:16:45,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 116 transitions, 1348 flow. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:45,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:45,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-13 20:16:45,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:45,926 INFO L116 PetriNetUnfolderBase]: 1533/2450 cut-off events. [2025-04-13 20:16:45,926 INFO L117 PetriNetUnfolderBase]: For 19465/19465 co-relation queries the response was YES. [2025-04-13 20:16:45,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12124 conditions, 2450 events. 1533/2450 cut-off events. For 19465/19465 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 11437 event pairs, 111 based on Foata normal form. 112/2562 useless extension candidates. Maximal degree in co-relation 12101. Up to 777 conditions per place. [2025-04-13 20:16:45,935 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 0 selfloop transitions, 0 changer transitions 161/161 dead transitions. [2025-04-13 20:16:45,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 161 transitions, 1972 flow [2025-04-13 20:16:45,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:16:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:16:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2025-04-13 20:16:45,936 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28252032520325204 [2025-04-13 20:16:45,936 INFO L175 Difference]: Start difference. First operand has 80 places, 116 transitions, 1348 flow. Second operand 12 states and 139 transitions. [2025-04-13 20:16:45,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 161 transitions, 1972 flow [2025-04-13 20:16:45,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 161 transitions, 1816 flow, removed 63 selfloop flow, removed 8 redundant places. [2025-04-13 20:16:45,948 INFO L231 Difference]: Finished difference. Result has 73 places, 0 transitions, 0 flow [2025-04-13 20:16:45,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=73, PETRI_TRANSITIONS=0} [2025-04-13 20:16:45,949 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 36 predicate places. [2025-04-13 20:16:45,949 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 0 transitions, 0 flow [2025-04-13 20:16:45,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:45,951 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:16:45,951 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:16:45,951 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:16:45,951 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:16:45,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:16:46,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:46,152 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2025-04-13 20:16:46,154 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:16:46,154 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:16:46,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:16:46 BasicIcfg [2025-04-13 20:16:46,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:16:46,158 INFO L158 Benchmark]: Toolchain (without parser) took 6902.72ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 107.2MB in the beginning and 203.5MB in the end (delta: -96.3MB). Peak memory consumption was 118.7MB. Max. memory is 8.0GB. [2025-04-13 20:16:46,158 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 83.6MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:16:46,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.83ms. Allocated memory is still 155.2MB. Free memory was 107.2MB in the beginning and 92.8MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:16:46,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.48ms. Allocated memory is still 155.2MB. Free memory was 92.8MB in the beginning and 91.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:16:46,160 INFO L158 Benchmark]: Boogie Preprocessor took 34.02ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 89.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:16:46,160 INFO L158 Benchmark]: RCFGBuilder took 367.92ms. Allocated memory is still 155.2MB. Free memory was 89.2MB in the beginning and 63.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 20:16:46,161 INFO L158 Benchmark]: TraceAbstraction took 6224.51ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 62.6MB in the beginning and 203.5MB in the end (delta: -140.9MB). Peak memory consumption was 72.6MB. Max. memory is 8.0GB. [2025-04-13 20:16:46,162 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.25ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 83.6MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.83ms. Allocated memory is still 155.2MB. Free memory was 107.2MB in the beginning and 92.8MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.48ms. Allocated memory is still 155.2MB. Free memory was 92.8MB in the beginning and 91.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.02ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 89.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 367.92ms. Allocated memory is still 155.2MB. Free memory was 89.2MB in the beginning and 63.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 6224.51ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 62.6MB in the beginning and 203.5MB in the end (delta: -140.9MB). Peak memory consumption was 72.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 50 locations, 69 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 598 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1796 IncrementalHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 7 mSDtfsCounter, 1796 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 208 SyntacticMatches, 18 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1348occurred in iteration=10, InterpolantAutomatonStates: 76, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1121 SizeOfPredicates, 23 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 13/25 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 20:16:46,175 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 Received shutdown request...