/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:47:28,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:47:28,972 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:47:28,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:47:28,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:47:28,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:47:28,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:47:28,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:47:28,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:47:28,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:47:28,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:47:28,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:47:28,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:47:28,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:47:28,992 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:47:28,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:47:28,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:47:28,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:47:28,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:47:28,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:47:28,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:47:28,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:47:28,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:47:28,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:47:28,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:47:28,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:47:28,995 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:47:29,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:47:29,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:47:29,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:47:29,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:47:29,227 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:47:29,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2025-04-13 20:47:30,555 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c084408bb/23bbb9eca7e3456ca01b9fe399c5b040/FLAGe9984462a [2025-04-13 20:47:30,747 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:47:30,748 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2025-04-13 20:47:30,753 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c084408bb/23bbb9eca7e3456ca01b9fe399c5b040/FLAGe9984462a [2025-04-13 20:47:31,557 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c084408bb/23bbb9eca7e3456ca01b9fe399c5b040 [2025-04-13 20:47:31,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:47:31,560 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:47:31,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:47:31,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:47:31,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:47:31,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67278965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31, skipping insertion in model container [2025-04-13 20:47:31,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:47:31,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-04-13 20:47:31,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:47:31,777 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:47:31,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-04-13 20:47:31,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:47:31,822 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:47:31,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31 WrapperNode [2025-04-13 20:47:31,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:47:31,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:47:31,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:47:31,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:47:31,829 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:47:31" (1/1) ... [2025-04-13 20:47:31,834 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:47:31" (1/1) ... [2025-04-13 20:47:31,850 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2025-04-13 20:47:31,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:47:31,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:47:31,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:47:31,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:47:31,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,879 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:47:31,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,882 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:47:31,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:47:31,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:47:31,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:47:31,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (1/1) ... [2025-04-13 20:47:31,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:47:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:31,923 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:47:31,925 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:47:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:47:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:47:31,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:47:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:47:31,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:47:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:47:31,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:47:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:47:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:47:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:47:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:47:31,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:47:31,944 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:47:32,004 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:47:32,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:47:32,141 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:47:32,142 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:47:32,142 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:47:32,256 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:47:32,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:47:32 BoogieIcfgContainer [2025-04-13 20:47:32,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:47:32,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:47:32,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:47:32,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:47:32,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:47:31" (1/3) ... [2025-04-13 20:47:32,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1693c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:47:32, skipping insertion in model container [2025-04-13 20:47:32,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:47:31" (2/3) ... [2025-04-13 20:47:32,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1693c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:47:32, skipping insertion in model container [2025-04-13 20:47:32,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:47:32" (3/3) ... [2025-04-13 20:47:32,264 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2025-04-13 20:47:32,274 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:47:32,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-equiv.wvr.c that has 4 procedures, 29 locations, 28 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:47:32,276 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:47:32,332 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:47:32,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 83 flow [2025-04-13 20:47:32,396 INFO L116 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-04-13 20:47:32,397 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:47:32,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-13 20:47:32,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 83 flow [2025-04-13 20:47:32,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 27 transitions, 72 flow [2025-04-13 20:47:32,407 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:47:32,418 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;@f8de63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:47:32,419 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:47:32,436 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:47:32,436 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-13 20:47:32,436 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:47:32,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:32,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:47:32,437 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:47:32,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:32,442 INFO L85 PathProgramCache]: Analyzing trace with hash -514475794, now seen corresponding path program 1 times [2025-04-13 20:47:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:32,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356919203] [2025-04-13 20:47:32,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:47:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:32,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:47:32,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:47:32,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:32,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:32,922 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:47:32,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:32,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356919203] [2025-04-13 20:47:32,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356919203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:32,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:47:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464910523] [2025-04-13 20:47:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:32,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:47:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:32,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:47:32,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:47:32,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31 [2025-04-13 20:47:32,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:47:32,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:32,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31 [2025-04-13 20:47:32,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:33,122 INFO L116 PetriNetUnfolderBase]: 321/551 cut-off events. [2025-04-13 20:47:33,122 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-13 20:47:33,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 551 events. 321/551 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2456 event pairs, 34 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 896. Up to 376 conditions per place. [2025-04-13 20:47:33,130 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 26 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2025-04-13 20:47:33,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 177 flow [2025-04-13 20:47:33,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:47:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:47:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 20:47:33,140 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7634408602150538 [2025-04-13 20:47:33,142 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 72 flow. Second operand 3 states and 71 transitions. [2025-04-13 20:47:33,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 177 flow [2025-04-13 20:47:33,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 155 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:47:33,151 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 86 flow [2025-04-13 20:47:33,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2025-04-13 20:47:33,155 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-04-13 20:47:33,155 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 86 flow [2025-04-13 20:47:33,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:47:33,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:33,155 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] [2025-04-13 20:47:33,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:47:33,159 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:47:33,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash -624494964, now seen corresponding path program 1 times [2025-04-13 20:47:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:33,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142595098] [2025-04-13 20:47:33,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:47:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:33,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:47:33,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:47:33,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:33,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:33,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:33,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142595098] [2025-04-13 20:47:33,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142595098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:33,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:33,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:47:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76703505] [2025-04-13 20:47:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:33,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:47:33,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:33,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:47:33,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:47:33,468 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2025-04-13 20:47:33,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:33,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:33,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2025-04-13 20:47:33,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:33,733 INFO L116 PetriNetUnfolderBase]: 577/918 cut-off events. [2025-04-13 20:47:33,733 INFO L117 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2025-04-13 20:47:33,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 918 events. 577/918 cut-off events. For 198/221 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4492 event pairs, 20 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 517. Up to 436 conditions per place. [2025-04-13 20:47:33,740 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 62 selfloop transitions, 14 changer transitions 0/83 dead transitions. [2025-04-13 20:47:33,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 83 transitions, 387 flow [2025-04-13 20:47:33,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:47:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:47:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2025-04-13 20:47:33,743 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6589861751152074 [2025-04-13 20:47:33,743 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 86 flow. Second operand 7 states and 143 transitions. [2025-04-13 20:47:33,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 83 transitions, 387 flow [2025-04-13 20:47:33,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 83 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:47:33,745 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 182 flow [2025-04-13 20:47:33,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2025-04-13 20:47:33,745 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2025-04-13 20:47:33,746 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 182 flow [2025-04-13 20:47:33,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:33,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:33,746 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] [2025-04-13 20:47:33,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:47:33,746 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:47:33,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash 604780814, now seen corresponding path program 2 times [2025-04-13 20:47:33,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:33,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845398641] [2025-04-13 20:47:33,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:47:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:33,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:47:33,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:47:33,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:47:33,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:33,912 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:47:33,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:33,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845398641] [2025-04-13 20:47:33,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845398641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:47:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81160412] [2025-04-13 20:47:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:33,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:47:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:33,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:47:33,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:47:33,943 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2025-04-13 20:47:33,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:47:33,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:33,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2025-04-13 20:47:33,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:34,104 INFO L116 PetriNetUnfolderBase]: 689/1082 cut-off events. [2025-04-13 20:47:34,105 INFO L117 PetriNetUnfolderBase]: For 711/766 co-relation queries the response was YES. [2025-04-13 20:47:34,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 1082 events. 689/1082 cut-off events. For 711/766 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5335 event pairs, 78 based on Foata normal form. 25/1075 useless extension candidates. Maximal degree in co-relation 2735. Up to 713 conditions per place. [2025-04-13 20:47:34,110 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 50 selfloop transitions, 19 changer transitions 2/78 dead transitions. [2025-04-13 20:47:34,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 469 flow [2025-04-13 20:47:34,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:47:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:47:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-04-13 20:47:34,112 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6397849462365591 [2025-04-13 20:47:34,112 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 182 flow. Second operand 6 states and 119 transitions. [2025-04-13 20:47:34,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 78 transitions, 469 flow [2025-04-13 20:47:34,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:47:34,116 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 316 flow [2025-04-13 20:47:34,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2025-04-13 20:47:34,116 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2025-04-13 20:47:34,116 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 316 flow [2025-04-13 20:47:34,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:47:34,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:34,117 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] [2025-04-13 20:47:34,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:47:34,117 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:47:34,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1076799432, now seen corresponding path program 3 times [2025-04-13 20:47:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:34,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068864208] [2025-04-13 20:47:34,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:47:34,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:34,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:47:34,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:47:34,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:47:34,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:34,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068864208] [2025-04-13 20:47:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068864208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:34,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:34,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:47:34,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556670272] [2025-04-13 20:47:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:34,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:47:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:34,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:47:34,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:47:34,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-13 20:47:34,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:34,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:34,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-13 20:47:34,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:34,592 INFO L116 PetriNetUnfolderBase]: 1427/2123 cut-off events. [2025-04-13 20:47:34,593 INFO L117 PetriNetUnfolderBase]: For 1643/1681 co-relation queries the response was YES. [2025-04-13 20:47:34,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6186 conditions, 2123 events. 1427/2123 cut-off events. For 1643/1681 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 11076 event pairs, 123 based on Foata normal form. 31/2124 useless extension candidates. Maximal degree in co-relation 4661. Up to 895 conditions per place. [2025-04-13 20:47:34,608 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 78 selfloop transitions, 34 changer transitions 2/120 dead transitions. [2025-04-13 20:47:34,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 120 transitions, 792 flow [2025-04-13 20:47:34,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:47:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:47:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-04-13 20:47:34,612 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6895161290322581 [2025-04-13 20:47:34,612 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 316 flow. Second operand 8 states and 171 transitions. [2025-04-13 20:47:34,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 120 transitions, 792 flow [2025-04-13 20:47:34,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 120 transitions, 750 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 20:47:34,623 INFO L231 Difference]: Finished difference. Result has 59 places, 65 transitions, 506 flow [2025-04-13 20:47:34,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=506, PETRI_PLACES=59, PETRI_TRANSITIONS=65} [2025-04-13 20:47:34,623 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2025-04-13 20:47:34,623 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 65 transitions, 506 flow [2025-04-13 20:47:34,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:34,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:34,624 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] [2025-04-13 20:47:34,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:47:34,624 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:47:34,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:34,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2116875622, now seen corresponding path program 4 times [2025-04-13 20:47:34,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:34,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264125117] [2025-04-13 20:47:34,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:47:34,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:34,633 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:47:34,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:47:34,643 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:47:34,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:34,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:34,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264125117] [2025-04-13 20:47:34,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264125117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:34,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:34,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:47:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560240830] [2025-04-13 20:47:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:34,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:47:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:34,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:47:34,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:47:34,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2025-04-13 20:47:34,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 65 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:34,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:34,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2025-04-13 20:47:34,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:35,269 INFO L116 PetriNetUnfolderBase]: 1567/2474 cut-off events. [2025-04-13 20:47:35,269 INFO L117 PetriNetUnfolderBase]: For 4097/4183 co-relation queries the response was YES. [2025-04-13 20:47:35,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 2474 events. 1567/2474 cut-off events. For 4097/4183 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 14210 event pairs, 155 based on Foata normal form. 20/2451 useless extension candidates. Maximal degree in co-relation 6394. Up to 1542 conditions per place. [2025-04-13 20:47:35,286 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 81 selfloop transitions, 38 changer transitions 2/129 dead transitions. [2025-04-13 20:47:35,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 129 transitions, 1046 flow [2025-04-13 20:47:35,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:47:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:47:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2025-04-13 20:47:35,288 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6653225806451613 [2025-04-13 20:47:35,288 INFO L175 Difference]: Start difference. First operand has 59 places, 65 transitions, 506 flow. Second operand 8 states and 165 transitions. [2025-04-13 20:47:35,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 129 transitions, 1046 flow [2025-04-13 20:47:35,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 1025 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 20:47:35,299 INFO L231 Difference]: Finished difference. Result has 70 places, 83 transitions, 753 flow [2025-04-13 20:47:35,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=753, PETRI_PLACES=70, PETRI_TRANSITIONS=83} [2025-04-13 20:47:35,299 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2025-04-13 20:47:35,299 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 83 transitions, 753 flow [2025-04-13 20:47:35,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:35,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:35,300 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] [2025-04-13 20:47:35,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:47:35,300 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:47:35,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:35,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1051027638, now seen corresponding path program 5 times [2025-04-13 20:47:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:35,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946450099] [2025-04-13 20:47:35,301 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:47:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:35,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:47:35,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:47:35,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:47:35,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:35,446 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:47:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:35,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946450099] [2025-04-13 20:47:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946450099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:35,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485150875] [2025-04-13 20:47:35,447 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:47:35,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:35,449 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:47:35,457 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:47:35,490 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:47:35,504 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:47:35,505 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:47:35,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:35,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:47:35,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:35,610 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:47:35,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:35,782 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:47:35,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485150875] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:35,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:35,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 20:47:35,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53656000] [2025-04-13 20:47:35,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:35,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:47:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:35,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:47:35,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:47:35,832 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-13 20:47:35,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 83 transitions, 753 flow. Second operand has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:47:35,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:35,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-13 20:47:35,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:37,782 INFO L116 PetriNetUnfolderBase]: 6517/10005 cut-off events. [2025-04-13 20:47:37,782 INFO L117 PetriNetUnfolderBase]: For 36798/37386 co-relation queries the response was YES. [2025-04-13 20:47:37,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40547 conditions, 10005 events. 6517/10005 cut-off events. For 36798/37386 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 66606 event pairs, 191 based on Foata normal form. 249/10197 useless extension candidates. Maximal degree in co-relation 31788. Up to 2965 conditions per place. [2025-04-13 20:47:37,848 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 308 selfloop transitions, 305 changer transitions 0/619 dead transitions. [2025-04-13 20:47:37,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 619 transitions, 5478 flow [2025-04-13 20:47:37,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 20:47:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 20:47:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 844 transitions. [2025-04-13 20:47:37,851 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6331582895723931 [2025-04-13 20:47:37,851 INFO L175 Difference]: Start difference. First operand has 70 places, 83 transitions, 753 flow. Second operand 43 states and 844 transitions. [2025-04-13 20:47:37,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 619 transitions, 5478 flow [2025-04-13 20:47:37,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 619 transitions, 5388 flow, removed 39 selfloop flow, removed 2 redundant places. [2025-04-13 20:47:37,901 INFO L231 Difference]: Finished difference. Result has 130 places, 419 transitions, 4672 flow [2025-04-13 20:47:37,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=4672, PETRI_PLACES=130, PETRI_TRANSITIONS=419} [2025-04-13 20:47:37,901 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 96 predicate places. [2025-04-13 20:47:37,901 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 419 transitions, 4672 flow [2025-04-13 20:47:37,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:47:37,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:37,902 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:47:37,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:47:38,102 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:47:38,103 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:47:38,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2012698882, now seen corresponding path program 1 times [2025-04-13 20:47:38,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:38,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917532861] [2025-04-13 20:47:38,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:47:38,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:38,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:47:38,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:47:38,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:38,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:38,381 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:47:38,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:38,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917532861] [2025-04-13 20:47:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917532861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:38,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135432282] [2025-04-13 20:47:38,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:47:38,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:38,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:38,384 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:47:38,385 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:47:38,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:47:38,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:47:38,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:38,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:38,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:47:38,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:38,582 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:47:38,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:38,810 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:47:38,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135432282] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:38,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:38,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 12 [2025-04-13 20:47:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244171232] [2025-04-13 20:47:38,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:38,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:47:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:38,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:47:38,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:47:38,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-04-13 20:47:38,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 419 transitions, 4672 flow. Second operand has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 13 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:47:38,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:38,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-04-13 20:47:38,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:41,110 INFO L116 PetriNetUnfolderBase]: 13489/19514 cut-off events. [2025-04-13 20:47:41,110 INFO L117 PetriNetUnfolderBase]: For 211281/211281 co-relation queries the response was YES. [2025-04-13 20:47:41,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101996 conditions, 19514 events. 13489/19514 cut-off events. For 211281/211281 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 118444 event pairs, 788 based on Foata normal form. 178/18281 useless extension candidates. Maximal degree in co-relation 92957. Up to 10018 conditions per place. [2025-04-13 20:47:41,298 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 556 selfloop transitions, 167 changer transitions 6/732 dead transitions. [2025-04-13 20:47:41,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 732 transitions, 9244 flow [2025-04-13 20:47:41,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:47:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:47:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 232 transitions. [2025-04-13 20:47:41,300 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2025-04-13 20:47:41,300 INFO L175 Difference]: Start difference. First operand has 130 places, 419 transitions, 4672 flow. Second operand 12 states and 232 transitions. [2025-04-13 20:47:41,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 732 transitions, 9244 flow [2025-04-13 20:47:43,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 732 transitions, 7792 flow, removed 726 selfloop flow, removed 1 redundant places. [2025-04-13 20:47:43,955 INFO L231 Difference]: Finished difference. Result has 147 places, 474 transitions, 4967 flow [2025-04-13 20:47:43,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3808, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4967, PETRI_PLACES=147, PETRI_TRANSITIONS=474} [2025-04-13 20:47:43,955 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 113 predicate places. [2025-04-13 20:47:43,955 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 474 transitions, 4967 flow [2025-04-13 20:47:43,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 13 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:47:43,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:43,956 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:47:43,962 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:47:44,156 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,SelfDestructingSolverStorable6 [2025-04-13 20:47:44,156 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:47:44,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash -636446188, now seen corresponding path program 1 times [2025-04-13 20:47:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:44,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213887268] [2025-04-13 20:47:44,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:47:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:44,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:47:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:47:44,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:44,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:44,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213887268] [2025-04-13 20:47:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213887268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:44,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:44,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:47:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499043206] [2025-04-13 20:47:44,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:44,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:47:44,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:44,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:47:44,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:47:44,281 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:47:44,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 474 transitions, 4967 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:44,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:44,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:47:44,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:46,398 INFO L116 PetriNetUnfolderBase]: 12317/18961 cut-off events. [2025-04-13 20:47:46,398 INFO L117 PetriNetUnfolderBase]: For 250714/251889 co-relation queries the response was YES. [2025-04-13 20:47:46,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95904 conditions, 18961 events. 12317/18961 cut-off events. For 250714/251889 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 131090 event pairs, 3337 based on Foata normal form. 463/19036 useless extension candidates. Maximal degree in co-relation 87888. Up to 10646 conditions per place. [2025-04-13 20:47:46,577 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 375 selfloop transitions, 197 changer transitions 6/671 dead transitions. [2025-04-13 20:47:46,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 671 transitions, 7980 flow [2025-04-13 20:47:46,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:47:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:47:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-13 20:47:46,578 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2025-04-13 20:47:46,578 INFO L175 Difference]: Start difference. First operand has 147 places, 474 transitions, 4967 flow. Second operand 5 states and 103 transitions. [2025-04-13 20:47:46,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 671 transitions, 7980 flow [2025-04-13 20:47:48,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 671 transitions, 7904 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-04-13 20:47:48,085 INFO L231 Difference]: Finished difference. Result has 152 places, 518 transitions, 6026 flow [2025-04-13 20:47:48,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4890, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6026, PETRI_PLACES=152, PETRI_TRANSITIONS=518} [2025-04-13 20:47:48,086 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 118 predicate places. [2025-04-13 20:47:48,086 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 518 transitions, 6026 flow [2025-04-13 20:47:48,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:48,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:48,087 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:47:48,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:47:48,087 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:47:48,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash -875348004, now seen corresponding path program 2 times [2025-04-13 20:47:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:48,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299116667] [2025-04-13 20:47:48,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:47:48,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:48,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:47:48,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:47:48,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:47:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:48,266 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:47:48,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:48,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299116667] [2025-04-13 20:47:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299116667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:48,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:47:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493414422] [2025-04-13 20:47:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:48,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:47:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:48,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:47:48,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:47:48,289 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:47:48,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 518 transitions, 6026 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:48,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:48,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:47:48,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:51,041 INFO L116 PetriNetUnfolderBase]: 15390/23811 cut-off events. [2025-04-13 20:47:51,041 INFO L117 PetriNetUnfolderBase]: For 399345/401557 co-relation queries the response was YES. [2025-04-13 20:47:51,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133949 conditions, 23811 events. 15390/23811 cut-off events. For 399345/401557 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 172478 event pairs, 3810 based on Foata normal form. 582/23820 useless extension candidates. Maximal degree in co-relation 122175. Up to 12108 conditions per place. [2025-04-13 20:47:51,230 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 516 selfloop transitions, 383 changer transitions 3/995 dead transitions. [2025-04-13 20:47:51,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 995 transitions, 13229 flow [2025-04-13 20:47:51,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:47:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:47:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-04-13 20:47:51,231 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2025-04-13 20:47:51,231 INFO L175 Difference]: Start difference. First operand has 152 places, 518 transitions, 6026 flow. Second operand 6 states and 120 transitions. [2025-04-13 20:47:51,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 995 transitions, 13229 flow [2025-04-13 20:47:54,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 995 transitions, 12705 flow, removed 84 selfloop flow, removed 1 redundant places. [2025-04-13 20:47:54,411 INFO L231 Difference]: Finished difference. Result has 159 places, 703 transitions, 9122 flow [2025-04-13 20:47:54,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=5739, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9122, PETRI_PLACES=159, PETRI_TRANSITIONS=703} [2025-04-13 20:47:54,413 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 125 predicate places. [2025-04-13 20:47:54,413 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 703 transitions, 9122 flow [2025-04-13 20:47:54,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:54,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:54,414 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:47:54,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:47:54,414 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:47:54,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 615339716, now seen corresponding path program 3 times [2025-04-13 20:47:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:54,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885407083] [2025-04-13 20:47:54,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:47:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:54,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:47:54,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:47:54,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:47:54,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:54,571 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:47:54,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:54,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885407083] [2025-04-13 20:47:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885407083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:54,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:47:54,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560445116] [2025-04-13 20:47:54,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:54,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:47:54,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:54,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:47:54,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:47:54,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-13 20:47:54,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 703 transitions, 9122 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:47:54,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:54,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-13 20:47:54,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:59,164 INFO L116 PetriNetUnfolderBase]: 20656/31200 cut-off events. [2025-04-13 20:47:59,164 INFO L117 PetriNetUnfolderBase]: For 358399/360328 co-relation queries the response was YES. [2025-04-13 20:47:59,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169538 conditions, 31200 events. 20656/31200 cut-off events. For 358399/360328 co-relation queries the response was YES. Maximal size of possible extension queue 1677. Compared 222602 event pairs, 3421 based on Foata normal form. 847/31686 useless extension candidates. Maximal degree in co-relation 157964. Up to 10030 conditions per place. [2025-04-13 20:47:59,457 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 578 selfloop transitions, 485 changer transitions 2/1121 dead transitions. [2025-04-13 20:47:59,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 1121 transitions, 15340 flow [2025-04-13 20:47:59,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:47:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:47:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2025-04-13 20:47:59,458 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6589861751152074 [2025-04-13 20:47:59,458 INFO L175 Difference]: Start difference. First operand has 159 places, 703 transitions, 9122 flow. Second operand 7 states and 143 transitions. [2025-04-13 20:47:59,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 1121 transitions, 15340 flow [2025-04-13 20:48:02,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 1121 transitions, 15332 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-13 20:48:02,787 INFO L231 Difference]: Finished difference. Result has 169 places, 795 transitions, 11903 flow [2025-04-13 20:48:02,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=9026, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=399, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11903, PETRI_PLACES=169, PETRI_TRANSITIONS=795} [2025-04-13 20:48:02,788 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 135 predicate places. [2025-04-13 20:48:02,788 INFO L485 AbstractCegarLoop]: Abstraction has has 169 places, 795 transitions, 11903 flow [2025-04-13 20:48:02,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:48:02,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:02,789 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:48:02,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:48:02,789 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:48:02,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1303915638, now seen corresponding path program 2 times [2025-04-13 20:48:02,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:02,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663008854] [2025-04-13 20:48:02,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:48:02,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:02,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:48:02,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:48:02,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:02,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:02,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663008854] [2025-04-13 20:48:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663008854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:48:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:48:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:48:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559191534] [2025-04-13 20:48:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:48:02,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:48:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:02,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:48:02,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:48:02,992 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:48:02,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 795 transitions, 11903 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:48:02,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:02,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:48:02,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:48:06,797 INFO L116 PetriNetUnfolderBase]: 17828/27787 cut-off events. [2025-04-13 20:48:06,798 INFO L117 PetriNetUnfolderBase]: For 323627/325474 co-relation queries the response was YES. [2025-04-13 20:48:07,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163737 conditions, 27787 events. 17828/27787 cut-off events. For 323627/325474 co-relation queries the response was YES. Maximal size of possible extension queue 1653. Compared 206827 event pairs, 2471 based on Foata normal form. 464/27935 useless extension candidates. Maximal degree in co-relation 154286. Up to 24931 conditions per place. [2025-04-13 20:48:07,114 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 728 selfloop transitions, 63 changer transitions 16/866 dead transitions. [2025-04-13 20:48:07,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 866 transitions, 14374 flow [2025-04-13 20:48:07,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:48:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:48:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-04-13 20:48:07,115 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.592741935483871 [2025-04-13 20:48:07,116 INFO L175 Difference]: Start difference. First operand has 169 places, 795 transitions, 11903 flow. Second operand 8 states and 147 transitions. [2025-04-13 20:48:07,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 866 transitions, 14374 flow [2025-04-13 20:48:10,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 866 transitions, 14366 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-13 20:48:10,418 INFO L231 Difference]: Finished difference. Result has 181 places, 810 transitions, 12455 flow [2025-04-13 20:48:10,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=11895, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12455, PETRI_PLACES=181, PETRI_TRANSITIONS=810} [2025-04-13 20:48:10,419 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 147 predicate places. [2025-04-13 20:48:10,419 INFO L485 AbstractCegarLoop]: Abstraction has has 181 places, 810 transitions, 12455 flow [2025-04-13 20:48:10,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:48:10,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:10,420 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:48:10,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:48:10,420 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:10,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1467951394, now seen corresponding path program 3 times [2025-04-13 20:48:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:10,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025367396] [2025-04-13 20:48:10,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:48:10,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:10,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:48:10,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:48:10,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:48:10,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:10,560 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:48:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:10,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025367396] [2025-04-13 20:48:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025367396] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:48:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:48:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:48:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425512227] [2025-04-13 20:48:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:48:10,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:48:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:10,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:48:10,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:48:10,582 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:48:10,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 810 transitions, 12455 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:10,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:10,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:48:10,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:48:14,875 INFO L116 PetriNetUnfolderBase]: 17350/26993 cut-off events. [2025-04-13 20:48:14,875 INFO L117 PetriNetUnfolderBase]: For 333621/335500 co-relation queries the response was YES. [2025-04-13 20:48:15,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160121 conditions, 26993 events. 17350/26993 cut-off events. For 333621/335500 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 199663 event pairs, 2462 based on Foata normal form. 508/27135 useless extension candidates. Maximal degree in co-relation 150883. Up to 23954 conditions per place. [2025-04-13 20:48:15,137 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 742 selfloop transitions, 46 changer transitions 9/856 dead transitions. [2025-04-13 20:48:15,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 856 transitions, 14531 flow [2025-04-13 20:48:15,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:48:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:48:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-13 20:48:15,138 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2025-04-13 20:48:15,138 INFO L175 Difference]: Start difference. First operand has 181 places, 810 transitions, 12455 flow. Second operand 5 states and 100 transitions. [2025-04-13 20:48:15,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 856 transitions, 14531 flow [2025-04-13 20:48:17,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 856 transitions, 14437 flow, removed 25 selfloop flow, removed 2 redundant places. [2025-04-13 20:48:17,787 INFO L231 Difference]: Finished difference. Result has 184 places, 802 transitions, 12295 flow [2025-04-13 20:48:17,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=12190, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12295, PETRI_PLACES=184, PETRI_TRANSITIONS=802} [2025-04-13 20:48:17,788 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 150 predicate places. [2025-04-13 20:48:17,788 INFO L485 AbstractCegarLoop]: Abstraction has has 184 places, 802 transitions, 12295 flow [2025-04-13 20:48:17,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:17,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:17,788 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:48:17,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:48:17,788 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:17,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash -414431108, now seen corresponding path program 4 times [2025-04-13 20:48:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:17,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679321194] [2025-04-13 20:48:17,789 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:48:17,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:17,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:48:17,799 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:48:17,799 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:48:17,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:17,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:17,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679321194] [2025-04-13 20:48:17,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679321194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:48:17,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:48:17,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:48:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852307555] [2025-04-13 20:48:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:48:17,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:48:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:17,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:48:17,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:48:17,914 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:48:17,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 802 transitions, 12295 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:17,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:17,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:48:17,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:48:23,075 INFO L116 PetriNetUnfolderBase]: 22998/35048 cut-off events. [2025-04-13 20:48:23,076 INFO L117 PetriNetUnfolderBase]: For 506082/509673 co-relation queries the response was YES. [2025-04-13 20:48:23,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214338 conditions, 35048 events. 22998/35048 cut-off events. For 506082/509673 co-relation queries the response was YES. Maximal size of possible extension queue 2034. Compared 263259 event pairs, 2617 based on Foata normal form. 1277/35453 useless extension candidates. Maximal degree in co-relation 202473. Up to 13094 conditions per place. [2025-04-13 20:48:23,464 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 912 selfloop transitions, 606 changer transitions 9/1664 dead transitions. [2025-04-13 20:48:23,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1664 transitions, 27612 flow [2025-04-13 20:48:23,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:48:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:48:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-04-13 20:48:23,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6505376344086021 [2025-04-13 20:48:23,465 INFO L175 Difference]: Start difference. First operand has 184 places, 802 transitions, 12295 flow. Second operand 6 states and 121 transitions. [2025-04-13 20:48:23,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1664 transitions, 27612 flow [2025-04-13 20:48:27,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1664 transitions, 27332 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-13 20:48:27,736 INFO L231 Difference]: Finished difference. Result has 189 places, 1182 transitions, 21545 flow [2025-04-13 20:48:27,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=12144, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=21545, PETRI_PLACES=189, PETRI_TRANSITIONS=1182} [2025-04-13 20:48:27,737 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 155 predicate places. [2025-04-13 20:48:27,737 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 1182 transitions, 21545 flow [2025-04-13 20:48:27,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:27,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:27,737 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:48:27,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:48:27,738 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:27,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1748085726, now seen corresponding path program 5 times [2025-04-13 20:48:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:27,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349015669] [2025-04-13 20:48:27,738 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:48:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:27,742 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:48:27,745 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:48:27,745 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:48:27,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:27,823 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:48:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:27,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349015669] [2025-04-13 20:48:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349015669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:48:27,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:48:27,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:48:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089207099] [2025-04-13 20:48:27,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:48:27,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:48:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:27,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:48:27,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:48:27,835 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:48:27,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1182 transitions, 21545 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:48:27,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:27,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:48:27,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:48:37,596 INFO L116 PetriNetUnfolderBase]: 33987/51207 cut-off events. [2025-04-13 20:48:37,596 INFO L117 PetriNetUnfolderBase]: For 934154/940796 co-relation queries the response was YES. [2025-04-13 20:48:38,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349502 conditions, 51207 events. 33987/51207 cut-off events. For 934154/940796 co-relation queries the response was YES. Maximal size of possible extension queue 3048. Compared 396400 event pairs, 3327 based on Foata normal form. 2677/52664 useless extension candidates. Maximal degree in co-relation 336539. Up to 17932 conditions per place. [2025-04-13 20:48:38,381 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 1655 selfloop transitions, 1115 changer transitions 8/2915 dead transitions. [2025-04-13 20:48:38,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 2915 transitions, 56435 flow [2025-04-13 20:48:38,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:48:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:48:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2025-04-13 20:48:38,382 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-04-13 20:48:38,382 INFO L175 Difference]: Start difference. First operand has 189 places, 1182 transitions, 21545 flow. Second operand 9 states and 168 transitions. [2025-04-13 20:48:38,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 2915 transitions, 56435 flow [2025-04-13 20:48:45,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 2915 transitions, 56387 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-04-13 20:48:45,471 INFO L231 Difference]: Finished difference. Result has 204 places, 2024 transitions, 43948 flow [2025-04-13 20:48:45,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=21519, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=348, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=43948, PETRI_PLACES=204, PETRI_TRANSITIONS=2024} [2025-04-13 20:48:45,472 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 170 predicate places. [2025-04-13 20:48:45,472 INFO L485 AbstractCegarLoop]: Abstraction has has 204 places, 2024 transitions, 43948 flow [2025-04-13 20:48:45,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:48:45,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:45,472 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:48:45,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:48:45,472 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:45,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1423843376, now seen corresponding path program 6 times [2025-04-13 20:48:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:45,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520210212] [2025-04-13 20:48:45,473 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:48:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:45,477 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:48:45,480 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:48:45,481 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:48:45,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:45,590 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:48:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:45,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520210212] [2025-04-13 20:48:45,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520210212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:48:45,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:48:45,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:48:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96924519] [2025-04-13 20:48:45,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:48:45,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:48:45,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:45,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:48:45,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:48:45,604 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-13 20:48:45,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 2024 transitions, 43948 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:48:45,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:45,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-13 20:48:45,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:49:03,233 INFO L116 PetriNetUnfolderBase]: 45106/66557 cut-off events. [2025-04-13 20:49:03,233 INFO L117 PetriNetUnfolderBase]: For 1270555/1276700 co-relation queries the response was YES. [2025-04-13 20:49:03,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489946 conditions, 66557 events. 45106/66557 cut-off events. For 1270555/1276700 co-relation queries the response was YES. Maximal size of possible extension queue 3575. Compared 504751 event pairs, 4264 based on Foata normal form. 2285/67770 useless extension candidates. Maximal degree in co-relation 479874. Up to 22807 conditions per place. [2025-04-13 20:49:04,263 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 1366 selfloop transitions, 1797 changer transitions 9/3228 dead transitions. [2025-04-13 20:49:04,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 3228 transitions, 70878 flow [2025-04-13 20:49:04,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:49:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:49:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-04-13 20:49:04,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6405529953917051 [2025-04-13 20:49:04,264 INFO L175 Difference]: Start difference. First operand has 204 places, 2024 transitions, 43948 flow. Second operand 7 states and 139 transitions. [2025-04-13 20:49:04,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 3228 transitions, 70878 flow [2025-04-13 20:49:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 3228 transitions, 69831 flow, removed 223 selfloop flow, removed 2 redundant places. [2025-04-13 20:49:17,998 INFO L231 Difference]: Finished difference. Result has 213 places, 2663 transitions, 64481 flow [2025-04-13 20:49:17,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=42721, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=64481, PETRI_PLACES=213, PETRI_TRANSITIONS=2663} [2025-04-13 20:49:17,999 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 179 predicate places. [2025-04-13 20:49:17,999 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 2663 transitions, 64481 flow [2025-04-13 20:49:18,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:49:18,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:49:18,000 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:49:18,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:49:18,000 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:49:18,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:49:18,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1110212062, now seen corresponding path program 7 times [2025-04-13 20:49:18,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:49:18,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955829295] [2025-04-13 20:49:18,000 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:49:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:49:18,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:49:18,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:49:18,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:49:18,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:18,093 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:49:18,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:49:18,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955829295] [2025-04-13 20:49:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955829295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:49:18,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:49:18,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:49:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841063409] [2025-04-13 20:49:18,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:49:18,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:49:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:49:18,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:49:18,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:49:18,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:49:18,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 2663 transitions, 64481 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:18,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:49:18,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:49:18,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:49:38,876 INFO L116 PetriNetUnfolderBase]: 42157/62815 cut-off events. [2025-04-13 20:49:38,876 INFO L117 PetriNetUnfolderBase]: For 1338581/1346301 co-relation queries the response was YES. [2025-04-13 20:49:39,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501177 conditions, 62815 events. 42157/62815 cut-off events. For 1338581/1346301 co-relation queries the response was YES. Maximal size of possible extension queue 3571. Compared 478367 event pairs, 3523 based on Foata normal form. 1787/63096 useless extension candidates. Maximal degree in co-relation 490671. Up to 56539 conditions per place. [2025-04-13 20:49:39,847 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 2470 selfloop transitions, 63 changer transitions 2/2695 dead transitions. [2025-04-13 20:49:39,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 2695 transitions, 69947 flow [2025-04-13 20:49:39,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:49:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:49:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-04-13 20:49:39,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-13 20:49:39,848 INFO L175 Difference]: Start difference. First operand has 213 places, 2663 transitions, 64481 flow. Second operand 5 states and 93 transitions. [2025-04-13 20:49:39,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 2695 transitions, 69947 flow [2025-04-13 20:49:54,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 2695 transitions, 69386 flow, removed 150 selfloop flow, removed 7 redundant places. [2025-04-13 20:49:54,208 INFO L231 Difference]: Finished difference. Result has 211 places, 2666 transitions, 64144 flow [2025-04-13 20:49:54,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=63938, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64144, PETRI_PLACES=211, PETRI_TRANSITIONS=2666} [2025-04-13 20:49:54,210 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 177 predicate places. [2025-04-13 20:49:54,210 INFO L485 AbstractCegarLoop]: Abstraction has has 211 places, 2666 transitions, 64144 flow [2025-04-13 20:49:54,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:54,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:49:54,210 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:49:54,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:49:54,210 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:49:54,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:49:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -711220314, now seen corresponding path program 8 times [2025-04-13 20:49:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:49:54,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476257237] [2025-04-13 20:49:54,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:49:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:49:54,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:49:54,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:49:54,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:49:54,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:54,287 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:49:54,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:49:54,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476257237] [2025-04-13 20:49:54,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476257237] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:49:54,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:49:54,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:49:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903687452] [2025-04-13 20:49:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:49:54,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:49:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:49:54,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:49:54,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:49:54,302 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2025-04-13 20:49:54,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 2666 transitions, 64144 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:54,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:49:54,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2025-04-13 20:49:54,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:50:15,387 INFO L116 PetriNetUnfolderBase]: 40757/61365 cut-off events. [2025-04-13 20:50:15,388 INFO L117 PetriNetUnfolderBase]: For 1241264/1248668 co-relation queries the response was YES. [2025-04-13 20:50:16,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476239 conditions, 61365 events. 40757/61365 cut-off events. For 1241264/1248668 co-relation queries the response was YES. Maximal size of possible extension queue 3578. Compared 475907 event pairs, 3397 based on Foata normal form. 1806/61800 useless extension candidates. Maximal degree in co-relation 465742. Up to 46964 conditions per place. [2025-04-13 20:50:16,333 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 984 selfloop transitions, 77 changer transitions 1/2693 dead transitions. [2025-04-13 20:50:16,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 2693 transitions, 66562 flow [2025-04-13 20:50:16,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:50:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:50:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-04-13 20:50:16,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6064516129032258 [2025-04-13 20:50:16,334 INFO L175 Difference]: Start difference. First operand has 211 places, 2666 transitions, 64144 flow. Second operand 5 states and 94 transitions. [2025-04-13 20:50:16,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 2693 transitions, 66562 flow [2025-04-13 20:50:29,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 2693 transitions, 65650 flow, removed 373 selfloop flow, removed 3 redundant places. [2025-04-13 20:50:29,769 INFO L231 Difference]: Finished difference. Result has 214 places, 2678 transitions, 63703 flow [2025-04-13 20:50:29,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=63255, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63703, PETRI_PLACES=214, PETRI_TRANSITIONS=2678} [2025-04-13 20:50:29,771 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 180 predicate places. [2025-04-13 20:50:29,771 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 2678 transitions, 63703 flow [2025-04-13 20:50:29,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:29,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:50:29,771 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:50:29,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:50:29,771 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:50:29,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:50:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1275174664, now seen corresponding path program 9 times [2025-04-13 20:50:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:50:29,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170464549] [2025-04-13 20:50:29,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:50:29,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:50:29,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:50:29,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:50:29,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:50:29,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:50:29,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:50:29,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170464549] [2025-04-13 20:50:29,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170464549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:50:29,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:50:29,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:50:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794018321] [2025-04-13 20:50:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:50:29,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:50:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:50:29,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:50:29,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:50:29,880 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2025-04-13 20:50:29,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 2678 transitions, 63703 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:29,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:50:29,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2025-04-13 20:50:29,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:50:51,588 INFO L116 PetriNetUnfolderBase]: 42263/64067 cut-off events. [2025-04-13 20:50:51,589 INFO L117 PetriNetUnfolderBase]: For 1244585/1252165 co-relation queries the response was YES. [2025-04-13 20:50:52,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486944 conditions, 64067 events. 42263/64067 cut-off events. For 1244585/1252165 co-relation queries the response was YES. Maximal size of possible extension queue 3759. Compared 506031 event pairs, 3535 based on Foata normal form. 1828/64474 useless extension candidates. Maximal degree in co-relation 476487. Up to 46875 conditions per place. [2025-04-13 20:50:52,555 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 1118 selfloop transitions, 84 changer transitions 4/2834 dead transitions. [2025-04-13 20:50:52,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 2834 transitions, 68046 flow [2025-04-13 20:50:52,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:50:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:50:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-04-13 20:50:52,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6290322580645161 [2025-04-13 20:50:52,556 INFO L175 Difference]: Start difference. First operand has 214 places, 2678 transitions, 63703 flow. Second operand 6 states and 117 transitions. [2025-04-13 20:50:52,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 2834 transitions, 68046 flow [2025-04-13 20:51:07,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 2834 transitions, 67914 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-04-13 20:51:07,691 INFO L231 Difference]: Finished difference. Result has 214 places, 2682 transitions, 63853 flow [2025-04-13 20:51:07,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=63406, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63853, PETRI_PLACES=214, PETRI_TRANSITIONS=2682} [2025-04-13 20:51:07,693 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 180 predicate places. [2025-04-13 20:51:07,693 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 2682 transitions, 63853 flow [2025-04-13 20:51:07,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:51:07,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:51:07,693 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:51:07,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:51:07,694 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:51:07,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:51:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1807878622, now seen corresponding path program 1 times [2025-04-13 20:51:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:51:07,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076656591] [2025-04-13 20:51:07,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:51:07,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:51:07,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:51:07,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:51:07,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:51:07,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:07,803 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:51:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:51:07,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076656591] [2025-04-13 20:51:07,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076656591] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:51:07,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151757406] [2025-04-13 20:51:07,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:51:07,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:51:07,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:51:07,805 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:51:07,807 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:51:07,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:51:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:51:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:51:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:07,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:51:07,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:51:08,009 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:51:08,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:51:08,434 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:51:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151757406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:51:08,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:51:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-04-13 20:51:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606524369] [2025-04-13 20:51:08,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:51:08,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:51:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:51:08,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:51:08,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:51:08,483 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-04-13 20:51:08,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 2682 transitions, 63853 flow. Second operand has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 13 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:51:08,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:51:08,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-04-13 20:51:08,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:51:35,783 INFO L116 PetriNetUnfolderBase]: 48627/77025 cut-off events. [2025-04-13 20:51:35,783 INFO L117 PetriNetUnfolderBase]: For 1599225/1609242 co-relation queries the response was YES. [2025-04-13 20:51:36,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602730 conditions, 77025 events. 48627/77025 cut-off events. For 1599225/1609242 co-relation queries the response was YES. Maximal size of possible extension queue 5102. Compared 678399 event pairs, 1245 based on Foata normal form. 5608/81952 useless extension candidates. Maximal degree in co-relation 594620. Up to 29169 conditions per place. [2025-04-13 20:51:37,288 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 775 selfloop transitions, 1747 changer transitions 8/4130 dead transitions. [2025-04-13 20:51:37,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 4130 transitions, 96856 flow [2025-04-13 20:51:37,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:51:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:51:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 329 transitions. [2025-04-13 20:51:37,289 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7075268817204301 [2025-04-13 20:51:37,289 INFO L175 Difference]: Start difference. First operand has 214 places, 2682 transitions, 63853 flow. Second operand 15 states and 329 transitions. [2025-04-13 20:51:37,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 4130 transitions, 96856 flow [2025-04-13 20:52:00,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 4130 transitions, 96696 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-04-13 20:52:00,848 INFO L231 Difference]: Finished difference. Result has 225 places, 3977 transitions, 97067 flow [2025-04-13 20:52:00,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=63693, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=825, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=97067, PETRI_PLACES=225, PETRI_TRANSITIONS=3977} [2025-04-13 20:52:00,850 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 191 predicate places. [2025-04-13 20:52:00,850 INFO L485 AbstractCegarLoop]: Abstraction has has 225 places, 3977 transitions, 97067 flow [2025-04-13 20:52:00,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 13 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:52:00,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:52:00,850 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:52:00,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:52:01,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:52:01,051 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:52:01,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:52:01,051 INFO L85 PathProgramCache]: Analyzing trace with hash -643711410, now seen corresponding path program 2 times [2025-04-13 20:52:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:52:01,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896055618] [2025-04-13 20:52:01,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:52:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:52:01,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:52:01,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:52:01,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:52:01,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:52:01,177 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:52:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:52:01,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896055618] [2025-04-13 20:52:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896055618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:52:01,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:52:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:52:01,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327069429] [2025-04-13 20:52:01,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:52:01,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:52:01,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:52:01,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:52:01,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:52:01,198 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-04-13 20:52:01,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 3977 transitions, 97067 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:52:01,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:52:01,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-04-13 20:52:01,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:52:36,603 INFO L116 PetriNetUnfolderBase]: 49545/78783 cut-off events. [2025-04-13 20:52:36,604 INFO L117 PetriNetUnfolderBase]: For 1883098/1898128 co-relation queries the response was YES. [2025-04-13 20:52:37,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673148 conditions, 78783 events. 49545/78783 cut-off events. For 1883098/1898128 co-relation queries the response was YES. Maximal size of possible extension queue 5131. Compared 699257 event pairs, 3948 based on Foata normal form. 4382/82372 useless extension candidates. Maximal degree in co-relation 664538. Up to 53378 conditions per place. [2025-04-13 20:52:37,955 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 2202 selfloop transitions, 370 changer transitions 1/4173 dead transitions. [2025-04-13 20:52:37,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 4173 transitions, 106540 flow [2025-04-13 20:52:37,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:52:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:52:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-04-13 20:52:37,956 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2025-04-13 20:52:37,956 INFO L175 Difference]: Start difference. First operand has 225 places, 3977 transitions, 97067 flow. Second operand 6 states and 123 transitions. [2025-04-13 20:52:37,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 4173 transitions, 106540 flow [2025-04-13 20:53:15,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 4173 transitions, 105571 flow, removed 446 selfloop flow, removed 1 redundant places. [2025-04-13 20:53:15,131 INFO L231 Difference]: Finished difference. Result has 230 places, 4136 transitions, 101318 flow [2025-04-13 20:53:15,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96294, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101318, PETRI_PLACES=230, PETRI_TRANSITIONS=4136} [2025-04-13 20:53:15,134 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 196 predicate places. [2025-04-13 20:53:15,134 INFO L485 AbstractCegarLoop]: Abstraction has has 230 places, 4136 transitions, 101318 flow [2025-04-13 20:53:15,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:15,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:15,135 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:53:15,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:53:15,135 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:15,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1348607660, now seen corresponding path program 1 times [2025-04-13 20:53:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:15,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665333239] [2025-04-13 20:53:15,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:15,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:53:15,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:53:15,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:15,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:15,231 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:53:15,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:15,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665333239] [2025-04-13 20:53:15,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665333239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:53:15,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512347023] [2025-04-13 20:53:15,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:15,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:15,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:15,234 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:53:15,237 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:53:15,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:53:15,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:53:15,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:15,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:15,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 20:53:15,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:53:15,436 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:53:15,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:53:15,658 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:53:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512347023] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:53:15,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:53:15,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2025-04-13 20:53:15,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552012922] [2025-04-13 20:53:15,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:53:15,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:53:15,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:15,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:53:15,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:53:15,678 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-04-13 20:53:15,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 4136 transitions, 101318 flow. Second operand has 21 states, 21 states have (on average 8.285714285714286) internal successors, (174), 21 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:53:15,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:15,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-04-13 20:53:15,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:25,424 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:53:42,277 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:53:46,286 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:53:55,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:03,793 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:08,858 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:12,913 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:18,903 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:23,270 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:27,276 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:31,457 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:35,507 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:47,305 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:51,592 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:54:56,161 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:00,226 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:04,242 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:13,779 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:17,791 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:22,884 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:27,245 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:34,323 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:43,764 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:55:48,484 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:56:02,332 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:56:06,357 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:56:22,729 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:56:26,741 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:56:50,774 INFO L116 PetriNetUnfolderBase]: 101305/147571 cut-off events. [2025-04-13 20:56:50,775 INFO L117 PetriNetUnfolderBase]: For 3018233/3018233 co-relation queries the response was YES. [2025-04-13 20:56:52,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203626 conditions, 147571 events. 101305/147571 cut-off events. For 3018233/3018233 co-relation queries the response was YES. Maximal size of possible extension queue 7521. Compared 1176546 event pairs, 2078 based on Foata normal form. 4653/152224 useless extension candidates. Maximal degree in co-relation 1202525. Up to 32905 conditions per place. [2025-04-13 20:56:53,364 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 6554 selfloop transitions, 5463 changer transitions 0/12020 dead transitions. [2025-04-13 20:56:53,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 12020 transitions, 292406 flow [2025-04-13 20:56:53,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 20:56:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-13 20:56:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 957 transitions. [2025-04-13 20:56:53,367 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5145161290322581 [2025-04-13 20:56:53,367 INFO L175 Difference]: Start difference. First operand has 230 places, 4136 transitions, 101318 flow. Second operand 60 states and 957 transitions. [2025-04-13 20:56:53,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 12020 transitions, 292406 flow [2025-04-13 20:58:49,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 12020 transitions, 290971 flow, removed 449 selfloop flow, removed 4 redundant places. [2025-04-13 20:58:49,915 INFO L231 Difference]: Finished difference. Result has 327 places, 8927 transitions, 222778 flow [2025-04-13 20:58:49,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=97194, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=222778, PETRI_PLACES=327, PETRI_TRANSITIONS=8927} [2025-04-13 20:58:49,919 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 293 predicate places. [2025-04-13 20:58:49,919 INFO L485 AbstractCegarLoop]: Abstraction has has 327 places, 8927 transitions, 222778 flow [2025-04-13 20:58:49,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.285714285714286) internal successors, (174), 21 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:58:49,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:49,920 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:58:49,930 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:58:50,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:50,124 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:58:50,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -812817722, now seen corresponding path program 2 times [2025-04-13 20:58:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:50,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172281714] [2025-04-13 20:58:50,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:58:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:50,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:58:50,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:58:50,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:58:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:50,390 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:58:50,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:50,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172281714] [2025-04-13 20:58:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172281714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:50,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544629147] [2025-04-13 20:58:50,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:58:50,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:50,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:50,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:58:50,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:58:50,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:58:50,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:58:50,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:58:50,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:50,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:58:50,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:50,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:50,909 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:58:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544629147] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:50,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:50,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 14 [2025-04-13 20:58:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872407620] [2025-04-13 20:58:50,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:50,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:58:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:50,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:58:50,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:58:50,931 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-04-13 20:58:50,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 8927 transitions, 222778 flow. Second operand has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 15 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:50,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:50,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-04-13 20:58:50,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 21:00:22,059 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:00:22,060 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:00:23,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:00:23,086 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 21:00:23,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 21:00:23,087 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 21:00:23,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:23,089 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 21:00:23,089 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 21:00:23,089 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 21:00:23,089 INFO L422 BasicCegarLoop]: Path program histogram: [9, 5, 3, 2, 2, 1] [2025-04-13 21:00:23,100 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:00:23,101 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:00:23,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:00:23 BasicIcfg [2025-04-13 21:00:23,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:00:23,111 INFO L158 Benchmark]: Toolchain (without parser) took 771550.50ms. Allocated memory was 125.8MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 88.4MB in the beginning and 744.5MB in the end (delta: -656.0MB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2025-04-13 21:00:23,111 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:23,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.66ms. Allocated memory is still 125.8MB. Free memory was 88.4MB in the beginning and 73.6MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:00:23,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.58ms. Allocated memory is still 125.8MB. Free memory was 73.6MB in the beginning and 71.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:00:23,111 INFO L158 Benchmark]: Boogie Preprocessor took 43.71ms. Allocated memory is still 125.8MB. Free memory was 71.7MB in the beginning and 70.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:23,111 INFO L158 Benchmark]: RCFGBuilder took 362.00ms. Allocated memory is still 125.8MB. Free memory was 70.1MB in the beginning and 43.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:00:23,111 INFO L158 Benchmark]: TraceAbstraction took 770851.50ms. Allocated memory was 125.8MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 43.5MB in the beginning and 744.5MB in the end (delta: -701.0MB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2025-04-13 21:00:23,115 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.66ms. Allocated memory is still 125.8MB. Free memory was 88.4MB in the beginning and 73.6MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.58ms. Allocated memory is still 125.8MB. Free memory was 73.6MB in the beginning and 71.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.71ms. Allocated memory is still 125.8MB. Free memory was 71.7MB in the beginning and 70.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 362.00ms. Allocated memory is still 125.8MB. Free memory was 70.1MB in the beginning and 43.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 770851.50ms. Allocated memory was 125.8MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 43.5MB in the beginning and 744.5MB in the end (delta: -701.0MB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 53 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: 770.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 763.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 2213 SdHoareTripleChecker+Valid, 119.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2096 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 117.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 430 mSDsCounter, 331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7298 IncrementalHoareTripleChecker+Invalid, 7657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 331 mSolverCounterUnsat, 56 mSDtfsCounter, 7298 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 546 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5037 ImplicationChecksByTransitivity, 33.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222778occurred in iteration=21, InterpolantAutomatonStates: 237, 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.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 599 NumberOfCodeBlocks, 599 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 682 ConstructedInterpolants, 0 QuantifiedInterpolants, 5854 SizeOfPredicates, 23 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 32 InterpolantComputations, 17 PerfectInterpolantSequences, 6/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown